Sciweavers

2227 search results - page 23 / 446
» Graph Mining based on a Data Partitioning Approach
Sort
View
IEEEPACT
2002
IEEE
15 years 5 months ago
Exploiting Pseudo-Schedules to Guide Data Dependence Graph Partitioning
This paper presents a new modulo scheduling algorithm for clustered microarchitectures. The main feature of the proposed scheme is that the assignment of instructions to clusters ...
Alex Aletà, Josep M. Codina, F. Jesú...
91
Voted
PKDD
2009
Springer
134views Data Mining» more  PKDD 2009»
15 years 7 months ago
Mining Graph Evolution Rules
In this paper we introduce graph-evolution rules, a novel type of frequency-based pattern that describe the evolution of large networks over time, at a local level. Given a sequenc...
Michele Berlingerio, Francesco Bonchi, Björn ...
112
Voted
PAMI
2006
141views more  PAMI 2006»
15 years 10 days ago
Diffusion Maps and Coarse-Graining: A Unified Framework for Dimensionality Reduction, Graph Partitioning, and Data Set Parameter
We provide evidence that non-linear dimensionality reduction, clustering and data set parameterization can be solved within one and the same framework. The main idea is to define ...
Stéphane Lafon, Ann B. Lee
132
Voted
ICDM
2009
IEEE
171views Data Mining» more  ICDM 2009»
14 years 10 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...
KDD
2008
ACM
165views Data Mining» more  KDD 2008»
16 years 25 days ago
Colibri: fast mining of large static and dynamic graphs
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
Hanghang Tong, Spiros Papadimitriou, Jimeng Sun, P...