Sciweavers

340 search results - page 1 / 68
» Clustering with Lower Bound on Similarity
Sort
View
PAKDD
2009
ACM
123views Data Mining» more  PAKDD 2009»
13 years 9 months 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,...
COCOON
2005
Springer
13 years 10 months ago
A Quadratic Lower Bound for Rocchio's Similarity-Based Relevance Feedback Algorithm
Rocchio’s similarity-based relevance feedback algorithm, one of the most important query reformation methods in information retrieval, is essentially an adaptive supervised lear...
Zhixiang Chen, Bin Fu
RSFDGRC
2009
Springer
119views Data Mining» more  RSFDGRC 2009»
13 years 11 months ago
Interval Set Cluster Analysis: A Re-formulation
A new clustering strategy is proposed based on interval sets, which is an alternative formulation different from the ones used in the existing studies. Instead of using a single s...
Yiyu Yao, Pawan Lingras, Ruizhi Wang, Duoqian Miao
DATAMINE
2006
166views more  DATAMINE 2006»
13 years 4 months ago
Accelerated EM-based clustering of large data sets
Motivated by the poor performance (linear complexity) of the EM algorithm in clustering large data sets, and inspired by the successful accelerated versions of related algorithms l...
Jakob J. Verbeek, Jan Nunnink, Nikos A. Vlassis
JCO
2010
75views more  JCO 2010»
13 years 3 months ago
A quadratic lower bound for Rocchio's similarity-based relevance feedback algorithm with a fixed query updating factor
Rocchio’s similarity-based relevance feedback algorithm, one of the most important query reformation methods in information retrieval, is essentially an adaptive supervised lear...
Zhixiang Chen, Bin Fu, John Abraham