Sciweavers

705 search results - page 5 / 141
» Proximity Cluster Trees
Sort
View
DEXAW
2008
IEEE
128views Database» more  DEXAW 2008»
14 years 2 months ago
Proximity Estimation and Hardness of Short-Text Corpora
Abstract—In this work, we investigate the relative hardness of shorttext corpora in clustering problems and how this hardness relates to traditional similarity measures. Our appr...
Marcelo Luis Errecalde, Diego Ingaramo, Paolo Ross...
KDD
2007
ACM
144views Data Mining» more  KDD 2007»
14 years 8 months ago
Fast direction-aware proximity for graph mining
In this paper we study asymmetric proximity measures on directed graphs, which quantify the relationships between two nodes or two groups of nodes. The measures are useful in seve...
Hanghang Tong, Christos Faloutsos, Yehuda Koren
ICPR
2008
IEEE
14 years 2 months ago
Online adaptive clustering in a decision tree framework
We present an online adaptive clustering algorithm in a decision tree framework which has an adaptive tree and a code formation layer. The code formation layer stores the represen...
Jayanta Basak
GFKL
2004
Springer
117views Data Mining» more  GFKL 2004»
14 years 28 days ago
Cluster Ensembles
Cluster ensembles are collections of individual solutions to a given clustering problem which are useful or necessary to consider in a wide range of applications. The R package˜c...
Kurt Hornik
TREC
2004
13 years 9 months ago
Using Clustering and Blade Clusters in the Terabyte Task
Web search engines exploit conjunctive queries and special ranking criteria which differ from the disjunctive queries typically used for ad-hoc retrieval. We wanted to asses the e...
Giuseppe Attardi, Andrea Esuli, Chirag Patel