Sciweavers

71 search results - page 3 / 15
» Call Graph Prefetching for Database Applications
Sort
View
EDBT
2008
ACM
160views Database» more  EDBT 2008»
14 years 11 months ago
Taxonomy-superimposed graph mining
New graph structures where node labels are members of hierarchically organized ontologies or taxonomies have become commonplace in different domains, e.g., life sciences. It is a ...
Ali Cakmak, Gultekin Özsoyoglu
KDD
2007
ACM
184views Data Mining» more  KDD 2007»
15 years 10 months ago
Correlation search in graph databases
Correlation mining has gained great success in many application domains for its ability to capture the underlying dependency between objects. However, the research of correlation ...
Yiping Ke, James Cheng, Wilfred Ng
SIGMOD
2005
ACM
166views Database» more  SIGMOD 2005»
15 years 9 months ago
Substructure Similarity Search in Graph Databases
Advanced database systems face a great challenge raised by the emergence of massive, complex structural data in bioinformatics, chem-informatics, and many other applications. The ...
Xifeng Yan, Philip S. Yu, Jiawei Han
TKDE
2008
136views more  TKDE 2008»
14 years 9 months ago
Efficient Correlation Search from Graph Databases
Correlation mining has gained great success in many application domains for its ability to capture underlying dependencies between objects. However, research on correlation mining ...
Yiping Ke, James Cheng, Wilfred Ng
KDD
2008
ACM
192views Data Mining» more  KDD 2008»
15 years 10 months ago
Partial least squares regression for graph mining
Attributed graphs are increasingly more common in many application domains such as chemistry, biology and text processing. A central issue in graph mining is how to collect inform...
Hiroto Saigo, Koji Tsuda, Nicole Krämer