Sciweavers

5046 search results - page 57 / 1010
» Non-redundant data clustering
Sort
View
ICASSP
2011
IEEE
14 years 10 months ago
A clustering based framework for dictionary block structure identification
Sparse representations over redundant dictionaries offer an efficient paradigm for signal representation. Recently block-sparsity has been put forward as a prior condition for so...
Ender M. Eksioglu
ICDM
2005
IEEE
150views Data Mining» more  ICDM 2005»
15 years 11 months ago
Combining Multiple Clusterings by Soft Correspondence
Combining multiple clusterings arises in various important data mining scenarios. However, finding a consensus clustering from multiple clusterings is a challenging task because ...
Bo Long, Zhongfei (Mark) Zhang, Philip S. Yu
PAKDD
2010
ACM
134views Data Mining» more  PAKDD 2010»
15 years 8 months ago
A Robust Seedless Algorithm for Correlation Clustering
Abstract. Finding correlation clusters in the arbitrary subspaces of highdimensional data is an important and a challenging research problem. The current state-of-the-art correlati...
Mohammad S. Aziz, Chandan K. Reddy
DMIN
2006
151views Data Mining» more  DMIN 2006»
15 years 7 months ago
Rough Set Theory: Approach for Similarity Measure in Cluster Analysis
- Clustering of data is an important data mining application. One of the problems with traditional partitioning clustering methods is that they partition the data into hard bound n...
Shuchita Upadhyaya, Alka Arora, Rajni Jain
KDD
2007
ACM
181views Data Mining» more  KDD 2007»
16 years 6 months ago
BoostCluster: boosting clustering by pairwise constraints
Data clustering is an important task in many disciplines. A large number of studies have attempted to improve clustering by using the side information that is often encoded as pai...
Yi Liu, Rong Jin, Anil K. Jain