Sciweavers

521 search results - page 11 / 105
» Coring method for clustering a graph
Sort
View
GFKL
2005
Springer
95views Data Mining» more  GFKL 2005»
15 years 9 months ago
An Indicator for the Number of Clusters: Using a Linear Map to Simplex Structure
Abstract. The problem of clustering data can be formulated as a graph partitioning problem. In this setting, spectral methods for obtaining optimal solutions have received a lot of...
Marcus Weber, Wasinee Rungsarityotin, Alexander Sc...
ICDM
2009
IEEE
153views Data Mining» more  ICDM 2009»
15 years 1 months ago
A New Clustering Algorithm Based on Regions of Influence with Self-Detection of the Best Number of Clusters
Clustering methods usually require to know the best number of clusters, or another parameter, e.g. a threshold, which is not ever easy to provide. This paper proposes a new graph-b...
Fabrice Muhlenbach, Stéphane Lallich
GBRPR
2009
Springer
15 years 10 months ago
Graph Matching Based on Node Signatures
We present an algorithm for graph matching in a pattern recognition context. This algorithm deals with weighted graphs, based on new structural and topological node signatures. Usi...
Salim Jouili, Salvatore Tabbone
ACL
2006
15 years 5 months ago
Unsupervised Part-of-Speech Tagging Employing Efficient Graph Clustering
An unsupervised part-of-speech (POS) tagging system that relies on graph clustering methods is described. Unlike in current state-of-the-art approaches, the kind and number of dif...
Chris Biemann
164
Voted
WEBI
2010
Springer
15 years 1 months ago
Lightweight Clustering Methods for Webspam Demotion
Abstract--To make sure they can quickly respond to a specific query, the main search engines have several mechanisms. One of them consists in ranking web pages according to their i...
Thomas Largillier, Sylvain Peyronnet