ICDM 2003 - PDF Preprint Papers

ICDM 2003 IEEE International Conference on Data Mining

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed ICDM-2003 Paper

click to vote

ICDM
2003
IEEE

240views Data Mining» more ICDM 2003»

Clustering of Time Series Subsequences is Meaningless: Implications for Previous and Future Research

14 years 4 months ago

Download www.cs.ucr.edu

Given the recent explosion of interest in streaming data and online algorithms, clustering of time series subsequences, extracted via a sliding window, has received much attention...

Eamonn J. Keogh, Jessica Lin, Wagner Truppel

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	240	Clustering of Time Series Subsequences is Meaningless: Implications for Previous and Future Research	claim
2	238	Sentiment Analyzer: Extracting Sentiments about a Given Topic using Natural Language Processing Techniques	claim
3	225	Combining the web content and usage mining to understand the visitor behavior in a web site	claim
4	220	Exploiting Unlabeled Data for Improving Accuracy of Predictive Data Mining	claim
5	210	CBC: Clustering Based Text Classification Requiring Minimal Labeled Data	claim
6	184	Analyzing High-Dimensional Data by Subspace Validity	claim
7	184	Detecting Patterns of Change Using Enhanced Parallel Coordinates Visualization	claim
8	181	Dynamic Weighted Majority: A New Ensemble Method for Tracking Concept Drift	claim
9	178	Spatial Interest Pixels (SIPs): Useful Low-Level Features of Visual Media Data	claim
10	170	Algorithms for Spatial Outlier Detection	claim
11	160	Indexing and Mining Free Trees	claim
12	158	Identifying Markov Blankets with Decision Tree Induction	claim
13	158	Combining Multiple Weak Clusterings	claim
14	154	Frequent Sub-Structure-Based Approaches for Classifying Chemical Compounds	claim
15	154	MaPle: A Fast Algorithm for Maximal Pattern-based Clustering	claim
16	153	Dimensionality Reduction Using Kernel Pooled Local Discriminant Information	claim
17	148	Inference of Protein-Protein Interactions by Unlikely Profile Pair	claim
18	143	Active Sampling for Feature Selection	claim
19	142	Privacy-Preserving Collaborative Filtering Using Randomized Perturbation Techniques	claim
20	141	TSP: Mining Top-K Closed Sequential Patterns	claim
21	141	Association Rule Mining in Peer-to-Peer Systems	claim
22	140	Mining Frequent Itemsets in Distributed and Dynamic Databases	claim
23	138	PixelMaps: A New Visual Data Mining Approach for Analyzing Large Spatial Data Sets	claim
24	138	Ontologies Improve Text Document Clustering	claim
25	136	T-Trees, Vertical Partitioning and Distributed Association Rule Mining	claim
26	136	Statistical Relational Learning for Document Mining	claim
27	135	An Algorithm for the Exact Computation of the Centroid of Higher Dimensional Polyhedra and its Application to Kernel Machines	claim
28	134	Probabilistic User Behavior Models	claim
29	134	Cost-Sensitive Learning by Cost-Proportionate Example Weighting	claim
30	130	Information Theoretic Clustering of Sparse Co-Occurrence Data	claim
31	128	Building Text Classifiers Using Positive and Unlabeled Examples	claim
32	127	A High-Performance Distributed Algorithm for Mining Association Rules	claim
33	126	Mining Relevant Text from Unlabelled Documents	claim
34	126	Interpretations of Association Rules by Granular Computing	claim
35	125	Improving Home Automation by Discovering Regularly Occurring Device Usage Patterns	claim
36	125	Clustering Item Data Sets with Association-Taxonomy Similarity	claim
37	123	Complex Spatial Relationships	claim
38	119	A Dynamic Adaptive Self-Organising Hybrid Model for Text Clustering	claim
39	118	Links Between Kleinberg's Hubs and Authorities, Correspondence Analysis, and Markov Chains	claim
40	115	Icon-based Visualization of Large High-Dimensional Datasets	claim
41	115	On Precision and Recall of Multi-Attribute Data Extraction from Semistructured Sources	claim
42	115	A new optimization criterion for generalized discriminant analysis on undersampled problems	claim
43	114	Unsupervised Link Discovery in Multi-relational Data via Rarity Analysis	claim
44	113	Semantic Role Parsing: Adding Semantic Structure to Unstructured Text	claim
45	112	Privacy-preserving Distributed Clustering using Generative Models	claim
46	111	OP-Cluster: Clustering by Tendency in High Dimensional Space	claim
47	110	Direct Interesting Rule Generation	claim
48	109	Comparing Pure Parallel Ensemble Creation Techniques Against Bagging	claim
49	107	Objective and Subjective Algorithms for Grouping Association Rules	claim
50	105	SVM Based Models for Predicting Foreign Currency Exchange Rates	claim
51	104	Localized Prediction of Continuous Target Variables Using Hierarchical Clustering	claim
52	104	Structure Search and Stability Enhancement of Bayesian Networks	claim
53	102	Bootstrapping Rule Induction	claim
54	101	Interactive Visualization and Navigation in Large Data Collections using the Hyperbolic Space	claim
55	100	Towards Simple, Easy-to-Understand, yet Accurate Classifiers	claim
56	100	Tractable Group Detection on Large Link Data Sets	claim
57	99	Scalable Model-based Clustering by Working on Data Summaries	claim
58	99	Simple Estimators for Relational Bayesian Classifiers	claim
59	98	On the Privacy Preserving Properties of Random Data Perturbation Techniques	claim
60	96	Mining Plans for Customer-Class Transformation	claim
61	95	Evolutionary Gabor Filter Optimization with Application to Vehicle Detection	claim
62	92	Validating and Refining Clusters via Visual Rendering	claim
63	92	Enhancing Techniques for Efficient Topic Hierarchy Integration	claim
64	92	Postprocessing Decision Trees to Extract Actionable Knowledge	claim
65	91	MPIS: Maximal-Profit Item Selection with Cross-Selling Considerations	claim
66	88	Class Decomposition via Clustering: A New Framework for Low-Variance Classifiers	claim
67	71	Tree-structured Partitioning Based on Splitting Histograms of Distances	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers