Sciweavers

1402 search results - page 23 / 281
» Sparse-Memory Graph Search
Sort
View
ICDM
2006
IEEE
81views Data Mining» more  ICDM 2006»
15 years 3 months ago
Full Perfect Extension Pruning for Frequent Graph Mining
Mining graph databases for frequent subgraphs has recently developed into an area of intensive research. Its main goals are to reduce the execution time of the existing basic algo...
Christian Borgelt, Thorsten Meinl
WSDM
2009
ACM
178views Data Mining» more  WSDM 2009»
15 years 4 months ago
User Browsing Graph: Structure, Evolution and Application
This paper focuses on ‘user browsing graph’ which is constructed with users’ click-through behavior modeled with Web access logs. User browsing graph has recently been adopt...
Yiqun Liu, Min Zhang, Shaoping Ma, Liyun Ru
AUSAI
2004
Springer
15 years 3 months ago
A New Neighborhood Based on Improvement Graph for Robust Graph Coloring Problem
In this paper, we propose a new neighborhood structure based on the improvement graph for solving the Robust Graph Coloring Problem, an interesting extension of classical graph col...
Songshan Guo, Ying Kong, Andrew Lim, Fan Wang
SMI
2003
IEEE
172views Image Analysis» more  SMI 2003»
15 years 3 months ago
Skeleton Based Shape Matching and Retrieval
In this paper, we describe a novel method for searching and comparing 3D objects. The method encodes the geometric and topological information in the form of a skeletal graph and ...
H. Sundar, Deborah Silver, Nikhil Gagvani, Sven J....
ICPR
2002
IEEE
15 years 11 months ago
A New Algorithm for Inexact Graph Matching
The graph is an essential data structure for representing relational information. When graphs are used to represent objects, comparing objects amounts to graph matching. Inexact g...
Adel Hlaoui, Shengrui Wang