Sciweavers

1096 search results - page 196 / 220
» Evaluating Algorithms for Concept Description
Sort
View
GIS
2007
ACM
14 years 9 months ago
Partition-based lazy updates for continuous queries over moving objects
Continuous spatial queries posted within an environment of moving objects produce as their results a time-varying set of objects. In the most ambitious case both queries and data ...
Yu-Ling Hsueh, Roger Zimmermann, Haojun Wang, Wei-...
OOPSLA
2010
Springer
13 years 7 months ago
G-Finder: routing programming questions closer to the experts
Programming forums are becoming the primary tools for programmers to find answers for their programming problems. Our empirical study of popular programming forums shows that the...
Wei Li, Charles Zhang, Songlin Hu
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
SIGMOD
2009
ACM
258views Database» more  SIGMOD 2009»
14 years 8 months ago
Continuous obstructed nearest neighbor queries in spatial databases
In this paper, we study a novel form of continuous nearest neighbor queries in the presence of obstacles, namely continuous obstructed nearest neighbor (CONN) search. It considers...
Yunjun Gao, Baihua Zheng
BMCBI
2007
128views more  BMCBI 2007»
13 years 8 months ago
Model order selection for bio-molecular data clustering
Background: Cluster analysis has been widely applied for investigating structure in bio-molecular data. A drawback of most clustering algorithms is that they cannot automatically ...
Alberto Bertoni, Giorgio Valentini