Sciweavers

1285 search results - page 24 / 257
» On the Complexity of Ordinal Clustering
Sort
View
PAKDD
2009
ACM
209views Data Mining» more  PAKDD 2009»
14 years 6 months ago
Approximate Spectral Clustering.
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...
Christopher Leckie, James C. Bezdek, Kotagiri Rama...
BTW
2005
Springer
80views Database» more  BTW 2005»
14 years 2 months ago
Measuring the Quality of Approximated Clusterings
Abstract. Clustering has become an increasingly important task in modern application domains. In many areas, e.g. when clustering complex objects, in distributed clustering, or whe...
Hans-Peter Kriegel, Martin Pfeifle
JASIS
2007
122views more  JASIS 2007»
13 years 8 months ago
Exploiting parallelism to support scalable hierarchical clustering
A distributed memory parallel version of the group average Hierarchical Agglomerative Clustering algorithm is proposed to enable scaling the document clustering problem to large c...
Rebecca Cathey, Eric C. Jensen, Steven M. Beitzel,...
INTERACTION
2009
ACM
14 years 3 months ago
A binary method for fast computation of inter and intra cluster similarities for combining multiple clusterings
In this paper, we introduce a novel binary method for fast computation of an objective function to measure inter and intra class similarities, which is used for combining multiple...
Selim Mimaroglu, A. Murat Yagci
BMCBI
2008
131views more  BMCBI 2008»
13 years 9 months ago
Modifying the DPClus algorithm for identifying protein complexes based on new topological structures
Background: Identification of protein complexes is crucial for understanding principles of cellular organization and functions. As the size of protein-protein interaction set incr...
Min Li, Jianer Chen, Jianxin Wang, Bin Hu, Gang Ch...