5046 search results - page 18 / 1010 » Non-redundant data clustering |
CORR
2010
Springer
14 years 11 months ago
2010
Springer
: Problem statement: Clustering has a number of techniques that have been developed in statistics, pattern recognition, data mining, and other fields. Subspace clustering enumerate...
103
click to vote
FLAIRS
2009
14 years 9 months ago
2009
In this paper, we are interested in the qualitative knowledge that underlies some given probabilistic information. To represent such qualitative structures, we use ordinal conditi...
113
Voted
KDD
2010
ACM
14 years 9 months ago
2010
ACM
One essential issue of document clustering is to estimate the appropriate number of clusters for a document collection to which documents should be partitioned. In this paper, we ...
109
click to vote
SIGMOD
1998
ACM
15 years 4 months ago
1998
ACM
Data mining applications place special requirements on clustering algorithms including: the ability to nd clusters embedded in subspaces of high dimensional data, scalability, end...
172
click to vote
ISNN
2011
Springer
14 years 2 months ago
2011
Springer
This paper presents a new method that uses orthogonalized features for time series clustering and classification. To cluster or classify time series data, either original data or...