Sciweavers

692 search results - page 17 / 139
» A new clustering algorithm for coordinate-free data
Sort
View
CEC
2005
IEEE
14 years 1 months ago
Improvements to the scalability of multiobjective clustering
In previous work, we have proposed a novel approach to data clustering based on the explicit optimization of a partitioning with respect to two complementary clustering objectives ...
Julia Handl, Joshua D. Knowles
PAKDD
2009
ACM
123views Data Mining» more  PAKDD 2009»
14 years 17 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,...
SAC
2005
ACM
14 years 1 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
BMCBI
2010
121views more  BMCBI 2010»
13 years 5 months ago
A grammar-based distance metric enables fast and accurate clustering of large sets of 16S sequences
Background: We propose a sequence clustering algorithm and compare the partition quality and execution time of the proposed algorithm with those of a popular existing algorithm. T...
David J. Russell, Samuel F. Way, Andrew K. Benson,...
KDD
2006
ACM
167views Data Mining» more  KDD 2006»
14 years 8 months ago
Clustering pair-wise dissimilarity data into partially ordered sets
Ontologies represent data relationships as hierarchies of possibly overlapping classes. Ontologies are closely related to clustering hierarchies, and in this article we explore th...
Jinze Liu, Qi Zhang, Wei Wang 0010, Leonard McMill...