Sciweavers

1768 search results - page 33 / 354
» Mining Very Large Databases
Sort
View
KDD
2012
ACM
235views Data Mining» more  KDD 2012»
12 years 10 days ago
A near-linear time approximation algorithm for angle-based outlier detection in high-dimensional data
Outlier mining in d-dimensional point sets is a fundamental and well studied data mining task due to its variety of applications. Most such applications arise in high-dimensional ...
Ninh Pham, Rasmus Pagh
KDD
1997
ACM
111views Data Mining» more  KDD 1997»
14 years 2 months ago
SIPping from the Data Firehose
When mining large databases, the data extraction problem and the interface between the database and data mining algorithm become important issues. Rather than giving a mining algo...
George H. John, Brian Lent
ECML
1997
Springer
14 years 2 months ago
Parallel and Distributed Search for Structure in Multivariate Time Series
Abstract. E cient data mining algorithms are crucial fore ective knowledge discovery. We present the Multi-Stream Dependency Detection (msdd) data mining algorithm that performs a ...
Tim Oates, Matthew D. Schmill, Paul R. Cohen
ISSTA
2009
ACM
14 years 4 months ago
Identifying bug signatures using discriminative graph mining
Bug localization has attracted a lot of attention recently. Most existing methods focus on pinpointing a single statement or function call which is very likely to contain bugs. Al...
Hong Cheng, David Lo, Yang Zhou, Xiaoyin Wang, Xif...
ISMIS
1999
Springer
14 years 2 months ago
Applications and Research Problems of Subgroup Mining
Knowledge Discovery in Databases (KDD) is a data analysis process which, in contrast to conventional data analysis, automatically generates and evaluates very many hypotheses, deal...
Willi Klösgen