Sciweavers

4085 search results - page 28 / 817
» Benchmarking Data Mining Algorithms
Sort
View
ADC
2008
Springer
110views Database» more  ADC 2008»
14 years 2 months ago
Graph Mining based on a Data Partitioning Approach
Existing graph mining algorithms typically assume that the dataset can fit into main memory. As many large graph datasets cannot satisfy this condition, truly scalable graph minin...
Son N. Nguyen, Maria E. Orlowska, Xue Li
KDD
2005
ACM
147views Data Mining» more  KDD 2005»
14 years 1 months ago
Combining proactive and reactive predictions for data streams
Mining data streams is important in both science and commerce. Two major challenges are (1) the data may grow without limit so that it is difficult to retain a long history; and (...
Ying Yang, Xindong Wu, Xingquan Zhu
PKDD
2009
Springer
147views Data Mining» more  PKDD 2009»
14 years 2 months ago
Kernel Polytope Faces Pursuit
Abstract. Polytope Faces Pursuit (PFP) is a greedy algorithm that approximates the sparse solutions recovered by 1 regularised least-squares (Lasso) [4,10] in a similar vein to (Or...
Tom Diethe, Zakria Hussain
AUSDM
2006
Springer
177views Data Mining» more  AUSDM 2006»
13 years 11 months ago
On The Optimal Working Set Size in Serial and Parallel Support Vector Machine Learning With The Decomposition Algorithm
The support vector machine (SVM) is a wellestablished and accurate supervised learning method for the classification of data in various application fields. The statistical learnin...
Tatjana Eitrich, Bruno Lang
KDD
1997
ACM
154views Data Mining» more  KDD 1997»
13 years 11 months ago
Autonomous Discovery of Reliable Exception Rules
This paper presents an autonomous algorithm for discovering exception rules from data sets. An exception rule, which is defined as a deviational pattern to a well-known fact, exhi...
Einoshin Suzuki