Sciweavers

4536 search results - page 106 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
ICDM
2003
IEEE
154views Data Mining» more  ICDM 2003»
15 years 11 months ago
Frequent Sub-Structure-Based Approaches for Classifying Chemical Compounds
In this paper we study the problem of classifying chemical compound datasets. We present a sub-structure-based classification algorithm that decouples the sub-structure discovery...
Mukund Deshpande, Michihiro Kuramochi, George Kary...
JMLR
2008
94views more  JMLR 2008»
15 years 6 months ago
Using Markov Blankets for Causal Structure Learning
We show how a generic feature selection algorithm returning strongly relevant variables can be turned into a causal structure learning algorithm. We prove this under the Faithfuln...
Jean-Philippe Pellet, André Elisseeff
CORR
1999
Springer
222views Education» more  CORR 1999»
15 years 6 months ago
Analysis of approximate nearest neighbor searching with clustered point sets
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
Songrit Maneewongvatana, David M. Mount
CSCWD
2001
Springer
15 years 10 months ago
Update Algorithms for the Sketch Data Model
The authors have developed a new approach to database interoperability using the sketch data model. That technique has now been used in a number of applications, but an important ...
Michael Johnson, Robert D. Rosebrugh
KAIS
2008
150views more  KAIS 2008»
15 years 6 months ago
A survey on algorithms for mining frequent itemsets over data streams
The increasing prominence of data streams arising in a wide range of advanced applications such as fraud detection and trend learning has led to the study of online mining of freq...
James Cheng, Yiping Ke, Wilfred Ng