Sciweavers

306 search results - page 45 / 62
» Mining tree queries in a graph
Sort
View
WSDM
2009
ACM
140views Data Mining» more  WSDM 2009»
14 years 2 months ago
Effective latent space graph-based re-ranking model with global consistency
Recently the re-ranking algorithms have been quite popular for web search and data mining. However, one of the issues is that those algorithms treat the content and link informati...
Hongbo Deng, Michael R. Lyu, Irwin King
FOCS
1998
IEEE
14 years 6 days ago
The Complexity of Acyclic Conjunctive Queries
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
Georg Gottlob, Nicola Leone, Francesco Scarcello
KDD
2006
ACM
198views Data Mining» more  KDD 2006»
14 years 8 months ago
Event detection from evolution of click-through data
Previous efforts on event detection from the web have focused primarily on web content and structure data ignoring the rich collection of web log data. In this paper, we propose t...
Qiankun Zhao, Tie-Yan Liu, Sourav S. Bhowmick, Wei...
MSR
2006
ACM
14 years 1 months ago
Detecting similar Java classes using tree algorithms
Similarity analysis of source code is helpful during development to provide, for instance, better support for code reuse. Consider a development environment that analyzes code whi...
Tobias Sager, Abraham Bernstein, Martin Pinzger, C...
WWW
2008
ACM
14 years 8 months ago
Information retrieval and knowledge discovery on the semantic web of traditional chinese medicine
We conduct the first systematical adoption of the Semantic Web solution in the integration, management, and utilization of TCM information and knowledge resources. As the results,...
Zhaohui Wu, Tong Yu, Huajun Chen, Xiaohong Jiang, ...