Sciweavers

2227 search results - page 185 / 446
» Graph Mining based on a Data Partitioning Approach
Sort
View
ICML
2007
IEEE
16 years 4 months ago
Learning from interpretations: a rooted kernel for ordered hypergraphs
The paper presents a kernel for learning from ordered hypergraphs, a formalization that captures relational data as used in Inductive Logic Programming (ILP). The kernel generaliz...
Gabriel Wachman, Roni Khardon
SDM
2010
SIAM
182views Data Mining» more  SDM 2010»
15 years 4 months ago
HCDF: A Hybrid Community Discovery Framework
We introduce a novel Bayesian framework for hybrid community discovery in graphs. Our framework, HCDF (short for Hybrid Community Discovery Framework), can effectively incorporate...
Keith Henderson, Tina Eliassi-Rad, Spiros Papadimi...
ICDM
2006
IEEE
107views Data Mining» more  ICDM 2006»
15 years 9 months ago
Improving Grouped-Entity Resolution Using Quasi-Cliques
The entity resolution (ER) problem, which identifies duplicate entities that refer to the same real world entity, is essential in many applications. In this paper, in particular,...
Byung-Won On, Ergin Elmacioglu, Dongwon Lee, Jaewo...
ICCV
2007
IEEE
16 years 5 months ago
Efficient Mining of Frequent and Distinctive Feature Configurations
We present a novel approach to automatically find spatial configurations of local features occurring frequently on instances of a given object class, and rarely on the background....
Till Quack, Vittorio Ferrari, Bastian Leibe, Luc J...
TPCG
2003
IEEE
15 years 8 months ago
Guided Navigation in Task-Oriented 3D Graph Visualizations
In many application areas an optimal visualization of a complex graph depends on the specific task to be accomplished by the user. Therefore a means of locally customizable layou...
Guido Reina, Sven Lange-Last, Klaus D. Engel, Thom...