Sciweavers

4085 search results - page 174 / 817
» Benchmarking Data Mining Algorithms
Sort
View
143
Voted
KDD
1997
ACM
159views Data Mining» more  KDD 1997»
15 years 7 months ago
New Algorithms for Fast Discovery of Association Rules
Discovery of association rules is an important problem in database mining. In this paper we present new algorithms for fast association mining, which scan the database only once, ...
Mohammed Javeed Zaki, Srinivasan Parthasarathy, Mi...
KDD
2003
ACM
170views Data Mining» more  KDD 2003»
16 years 3 months ago
Efficient decision tree construction on streaming data
Decision tree construction is a well studied problem in data mining. Recently, there has been much interest in mining streaming data. Domingos and Hulten have presented a one-pass...
Ruoming Jin, Gagan Agrawal
CORR
2010
Springer
219views Education» more  CORR 2010»
15 years 3 months ago
Clustering high dimensional data using subspace and projected clustering algorithms
: Problem statement: Clustering has a number of techniques that have been developed in statistics, pattern recognition, data mining, and other fields. Subspace clustering enumerate...
Rahmat Widia Sembiring, Jasni Mohamad Zain, Abdull...
SDM
2007
SIAM
137views Data Mining» more  SDM 2007»
15 years 4 months ago
Are approximation algorithms for consensus clustering worthwhile?
Consensus clustering has emerged as one of the principal clustering problems in the data mining community. In recent years the theoretical computer science community has generated...
Michael Bertolacci, Anthony Wirth
KDD
2010
ACM
246views Data Mining» more  KDD 2010»
15 years 1 months ago
Latent aspect rating analysis on review text data: a rating regression approach
In this paper, we define and study a new opinionated text data analysis problem called Latent Aspect Rating Analysis (LARA), which aims at analyzing opinions expressed about an e...
Hongning Wang, Yue Lu, Chengxiang Zhai