Sciweavers

4085 search results - page 232 / 817
» Benchmarking Data Mining Algorithms
Sort
View
129
Voted
CF
2010
ACM
15 years 7 months ago
Towards chip-on-chip neuroscience: fast mining of neuronal spike streams using graphics hardware
Computational neuroscience is being revolutionized with the advent of multi-electrode arrays that provide real-time, dynamic perspectives into brain function. Mining neuronal spik...
Yong Cao, Debprakash Patnaik, Sean P. Ponce, Jerem...
139
Voted
AIA
2007
15 years 5 months ago
A framework for generating data to simulate changing environments
A fundamental assumption often made in supervised classification is that the problem is static, i.e. the description of the classes does not change with time. However many practi...
Anand M. Narasimhamurthy, Ludmila I. Kuncheva
115
Voted
FIMI
2004
123views Data Mining» more  FIMI 2004»
15 years 5 months ago
Surprising Results of Trie-based FIM Algorithms
Trie is a popular data structure in frequent itemset mining (FIM) algorithms. It is memory-efficient, and allows fast construction and information retrieval. Many trie-related tec...
Ferenc Bodon
123
Voted
KES
2004
Springer
15 years 9 months ago
FIT: A Fast Algorithm for Discovering Frequent Itemsets in Large Databases
Association rule mining is an important data mining problem that has been studied extensively. In this paper, a simple but Fast algorithm for Intersecting attribute lists using a ...
Jun Luo, Sanguthevar Rajasekaran
124
Voted
KDD
2002
ACM
140views Data Mining» more  KDD 2002»
16 years 4 months ago
Mining frequent item sets by opportunistic projection
In this paper, we present a novel algorithm OpportuneProject for mining complete set of frequent item sets by projecting databases to grow a frequent item set tree. Our algorithm ...
Junqiang Liu, Yunhe Pan, Ke Wang, Jiawei Han