Sciweavers

291 search results - page 10 / 59
» Clustering and the Biclique Partition Problem
Sort
View
PKDD
2007
Springer
109views Data Mining» more  PKDD 2007»
14 years 3 months ago
Matching Partitions over Time to Reliably Capture Local Clusters in Noisy Domains
Abstract. When seeking for small clusters it is very intricate to distinguish between incidental agglomeration of noisy points and true local patterns. We present the PAMALOC algor...
Frank Höppner, Mirko Böttcher
JMMA
2010
162views more  JMMA 2010»
13 years 3 months ago
Co-clustering Documents and Words by Minimizing the Normalized Cut Objective Function
This paper follows a word-document co-clustering model independently introduced in 2001 by several authors such as I.S. Dhillon, H. Zha and C. Ding. This model consists in creatin...
Charles-Edmond Bichot
KDD
2003
ACM
210views Data Mining» more  KDD 2003»
14 years 9 months ago
Privacy-preserving k-means clustering over vertically partitioned data
Privacy and security concerns can prevent sharing of data, derailing data mining projects. Distributed knowledge discovery, if done correctly, can alleviate this problem. The key ...
Jaideep Vaidya, Chris Clifton
CVPR
2003
IEEE
14 years 11 months ago
Robust Data Clustering
We address the problem of robust clustering by combining data partitions (forming a clustering ensemble) produced by multiple clusterings. We formulate robust clustering under an ...
Ana L. N. Fred, Anil K. Jain
SAC
2005
ACM
14 years 2 months ago
Rearranging data objects for efficient and stable clustering
When a partitional structure is derived from a data set using a data mining algorithm, it is not unusual to have a different set of outcomes when it runs with a different order of...
Gyesung Lee, Xindong Wu, Jinho Chon