Sciweavers

ICDM
2007
IEEE
105views Data Mining» more  ICDM 2007»
13 years 11 months ago
Fast Mining of Complex Spatial Co-location Patterns Using GLIMIT
Most algorithms for mining interesting spatial colocations integrate the co-location / clique generation task with the interesting pattern mining task, and are usually based on th...
Florian Verhein, Ghazi Al-Naymat
AICCSA
2008
IEEE
292views Hardware» more  AICCSA 2008»
13 years 11 months ago
Enumeration of maximal clique for mining spatial co-location patterns
This paper presents a systematic approach to mine colocation patterns in Sloan Digital Sky Survey (SDSS) data. SDSS Data Release 5 (DR5) contains 3.6 TB of data. Availability of s...
Ghazi Al-Naymat
COCOON
2009
Springer
13 years 11 months ago
Graph-Based Data Clustering with Overlaps
We introduce overlap cluster graph modification problems where, other than in most previous work, the clusters of the target graph may overlap. More precisely, the studied graph p...
Michael R. Fellows, Jiong Guo, Christian Komusiewi...
ECCV
1998
Springer
14 years 6 months ago
Matching Hierarchical Structures Using Association Graphs
?It is well-known that the problem of matching two relational structures can be posed as an equivalent problem of finding a maximal clique in a (derived) ?association graph.? Howev...
Marcello Pelillo, Kaleem Siddiqi, Steven W. Zucker