Sciweavers

439 search results - page 7 / 88
» Engineering Comparators for Graph Clusterings
Sort
View
KDD
2005
ACM
157views Data Mining» more  KDD 2005»
14 years 8 months ago
A fast kernel-based multilevel algorithm for graph clustering
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis
IWPC
2000
IEEE
14 years 3 days ago
The Effect of Call Graph Construction Algorithms for Object-Oriented Programs on Automatic Clustering
Call graphs are commonly used as input for automatic clustering algorithms, the goal of which is to extract the high level structure of the program under study. Determining the ca...
Derek Rayside, Steve Reuss, Erik Hedges, Kostas Ko...
ICDM
2009
IEEE
171views Data Mining» more  ICDM 2009»
13 years 5 months ago
Hybrid Clustering by Integrating Text and Citation Based Graphs in Journal Database Analysis
We propose a hybrid clustering strategy by integrating heterogeneous information sources as graphs. The hybrid clustering method is extended on the basis of modularity based Louva...
Xinhai Liu, Shi Yu, Yves Moreau, Frizo A. L. Janss...
WEBI
2004
Springer
14 years 1 months ago
Using Semantic Graphs in Clustering Process : Enhance Information Level
In this paper, we particularly focused our attention on how to enhance expressivity of ontologies when used as organized space values in a catalogue request process. Using the Wis...
Jean-Sébastien Brunner, Isabelle Berrien
ICDM
2009
IEEE
117views Data Mining» more  ICDM 2009»
14 years 2 months ago
Clustering with Multiple Graphs
—In graph-based learning models, entities are often represented as vertices in an undirected graph with weighted edges describing the relationships between entities. In many real...
Wei Tang, Zhengdong Lu, Inderjit S. Dhillon