Sciweavers

50 search results - page 2 / 10
» Using the fractal dimension to cluster datasets
Sort
View
PAKDD
2004
ACM
94views Data Mining» more  PAKDD 2004»
14 years 23 days ago
Self-Similar Mining of Time Association Rules
Although the task of mining association rules has received considerable attention in the literature, algorithms to find time association rules are often inadequate, by either miss...
Daniel Barbará, Ping Chen, Zohreh Nazeri
ICCS
2005
Springer
14 years 28 days ago
Dimension Reduction for Clustering Time Series Using Global Characteristics
Existing methods for time series clustering rely on the actual data values can become impractical since the methods do not easily handle dataset with high dimensionality, missing v...
Xiaozhe Wang, Kate A. Smith, Rob J. Hyndman
ICML
2007
IEEE
14 years 8 months ago
Adaptive dimension reduction using discriminant analysis and K-means clustering
We combine linear discriminant analysis (LDA) and K-means clustering into a coherent framework to adaptively select the most discriminative subspace. We use K-means clustering to ...
Chris H. Q. Ding, Tao Li
CGF
2011
12 years 11 months ago
Visualizing High-Dimensional Structures by Dimension Ordering and Filtering using Subspace Analysis
High-dimensional data visualization is receiving increasing interest because of the growing abundance of highdimensional datasets. To understand such datasets, visualization of th...
Bilkis J. Ferdosi, Jos B. T. M. Roerdink
ICDE
2007
IEEE
165views Database» more  ICDE 2007»
14 years 8 months ago
Distance Based Subspace Clustering with Flexible Dimension Partitioning
Traditional similarity or distance measurements usually become meaningless when the dimensions of the datasets increase, which has detrimental effects on clustering performance. I...
Guimei Liu, Jinyan Li, Kelvin Sim, Limsoon Wong