Sciweavers

47 search results - page 2 / 10
» A graph method for keyword-based selection of the top-K data...
Sort
View
CIKM
2008
Springer
13 years 5 months ago
Structure feature selection for graph classification
With the development of highly efficient graph data collection technology in many application fields, classification of graph data emerges as an important topic in the data mining...
Hongliang Fei, Jun Huan
EDBT
2009
ACM
208views Database» more  EDBT 2009»
13 years 10 months ago
Flexible and efficient querying and ranking on hyperlinked data sources
There has been an explosion of hyperlinked data in many domains, e.g., the biological Web. Expressive query languages and effective ranking techniques are required to convert this...
Ramakrishna Varadarajan, Vagelis Hristidis, Louiqa...
SIGMOD
2007
ACM
413views Database» more  SIGMOD 2007»
14 years 3 months ago
Effective keyword-based selection of relational databases
The wide popularity of free-and-easy keyword based searches over World Wide Web has fueled the demand for incorporating keyword-based search over structured databases. However, mo...
Bei Yu, Guoliang Li, Karen R. Sollins, Anthony K. ...
ICDE
2006
IEEE
177views Database» more  ICDE 2006»
14 years 5 months ago
Searching Substructures with Superimposed Distance
Efficient indexing techniques have been developed for the exact and approximate substructure search in large scale graph databases. Unfortunately, the retrieval problem of structu...
Xifeng Yan, Feida Zhu, Jiawei Han, Philip S. Yu
AC
2000
Springer
13 years 8 months ago
Graph-Theoretical Methods in Computer Vision
The management of large databases of hierarchical (e.g., multi-scale or multilevel) image features is a common problem in object recognition. Such structures are often represented ...
Ali Shokoufandeh, Sven J. Dickinson