Sciweavers

2137 search results - page 43 / 428
» Experiments on Graph Clustering Algorithms
Sort
View
PAKDD
2010
ACM
169views Data Mining» more  PAKDD 2010»
13 years 9 months ago
Correspondence Clustering: An Approach to Cluster Multiple Related Spatial Datasets
Domain experts are frequently interested to analyze multiple related spatial datasets. This capability is important for change analysis and contrast mining. In this paper, a novel ...
Vadeerat Rinsurongkawong, Christoph F. Eick
IJCNLP
2005
Springer
14 years 1 months ago
Document Clustering with Grouping and Chaining Algorithms
Document clustering has many uses in natural language tools and applications. For instance, summarizing sets of documents that all describe the same event requires first identifyi...
Yllias Chali, Soufiane Noureddine
CICLING
2008
Springer
13 years 9 months ago
Evaluation of Internal Validity Measures in Short-Text Corpora
Short texts clustering is one of the most difficult tasks in natural language processing due to the low frequencies of the document terms. We are interested in analysing these kind...
Diego Ingaramo, David Pinto, Paolo Rosso, Marcelo ...
SDM
2007
SIAM
74views Data Mining» more  SDM 2007»
13 years 9 months ago
HACS: Heuristic Algorithm for Clustering Subsets
The term consideration set is used in marketing to refer to the set of items a customer thought about purchasing before making a choice. While consideration sets are not directly ...
Ding Yuan, W. Nick Street
DAM
2008
134views more  DAM 2008»
13 years 7 months ago
Efficient algorithms for finding critical subgraphs
This paper presents algorithms to find vertex-critical and edgecritical subgraphs in a given graph G, and demonstrates how these critical subgraphs can be used to determine the ch...
Christian Desrosiers, Philippe Galinier, Alain Her...