Sciweavers

185 search results - page 12 / 37
» CLARANS: A Method for Clustering Objects for Spatial Data Mi...
Sort
View
SDM
2008
SIAM
177views Data Mining» more  SDM 2008»
13 years 9 months ago
Robust Clustering in Arbitrarily Oriented Subspaces
In this paper, we propose an efficient and effective method to find arbitrarily oriented subspace clusters by mapping the data space to a parameter space defining the set of possi...
Elke Achtert, Christian Böhm, Jörn David...
ICDM
2009
IEEE
169views Data Mining» more  ICDM 2009»
13 years 5 months ago
Learning the Shared Subspace for Multi-task Clustering and Transductive Transfer Classification
There are many clustering tasks which are closely related in the real world, e.g. clustering the web pages of different universities. However, existing clustering approaches neglec...
Quanquan Gu, Jie Zhou
PAKDD
2004
ACM
183views Data Mining» more  PAKDD 2004»
14 years 26 days ago
Constraint-Based Graph Clustering through Node Sequencing and Partitioning
This paper proposes a two-step graph partitioning method to discover constrained clusters with an objective function that follows the well-known minmax clustering principle. Compar...
Yu Qian, Kang Zhang, Wei Lai
KES
2008
Springer
13 years 7 months ago
Data Mining for Navigation Generating System with Unorganized Web Resources
Users prefer to navigate subjects from organized topics in an abundance resources than to list pages retrieved from search engines. We propose a framework to cluster frequent items...
Diana Purwitasari, Yasuhisa Okazaki, Kenzi Watanab...
PAKDD
2009
ACM
123views Data Mining» more  PAKDD 2009»
14 years 2 days ago
Clustering with Lower Bound on Similarity
We propose a new method, called SimClus, for clustering with lower bound on similarity. Instead of accepting k the number of clusters to find, the alternative similarity-based app...
Mohammad Al Hasan, Saeed Salem, Benjarath Pupacdi,...