Sciweavers

630 search results - page 106 / 126
» Sameness: An Experiment in Code Search
Sort
View
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
14 years 9 months ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen
KDD
2006
ACM
198views Data Mining» more  KDD 2006»
14 years 9 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...
SIGMOD
2001
ACM
158views Database» more  SIGMOD 2001»
14 years 9 months ago
Generating Efficient Plans for Queries Using Views
We study the problem of generating e cient, equivalent rewritings using views to compute the answer to a query. We take the closed-world assumption, in which views are materialize...
Foto N. Afrati, Chen Li, Jeffrey D. Ullman
CIKM
2009
Springer
14 years 3 months ago
Evaluating top-k queries over incomplete data streams
We study the problem of continuous monitoring of top-k queries over multiple non-synchronized streams. Assuming a sliding window model, this general problem has been a well addres...
Parisa Haghani, Sebastian Michel, Karl Aberer
JCDL
2009
ACM
179views Education» more  JCDL 2009»
14 years 3 months ago
Disambiguating authors in academic publications using random forests
Users of digital libraries usually want to know the exact author or authors of an article. But different authors may share the same names, either as full names or as initials and...
Pucktada Treeratpituk, C. Lee Giles