126 search results - page 8 / 26 » BAG: a graph theoretic sequence clustering algorithm |
197
click to vote
ACSC
2009
IEEE
16 years 2 months ago
2009
IEEE
Most text mining methods are based on representing documents using a vector space model, commonly known as a bag of word model, where each document is modeled as a linear vector r...
196
Voted
FOCS
2003
IEEE
16 years 21 days ago
2003
IEEE
We consider the problem of clustering a collection of elements based on pairwise judgments of similarity and dissimilarity. Bansal, Blum and Chawla (in: Proceedings of 43rd FOCS, ...
234
Voted
MOBIHOC
2002
ACM
16 years 7 months ago
2002
ACM
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
206
click to vote
FOCS
2000
IEEE
15 years 11 months ago
2000
IEEE
We motivate and develop a natural bicriteria measure for assessing the quality of a clustering that avoids the drawbacks of existing measures. A simple recursive heuristic is shown...
167
Voted
APPML
2002
15 years 7 months ago
2002
A method for structural clustering is proposed involving data on subset-to-entity linkages that can be calculated with structural data such as graphs or sequences or images. The m...