Sciweavers

1813 search results - page 43 / 363
» Instance Pruning Techniques
Sort
View
FIMI
2003
120views Data Mining» more  FIMI 2003»
15 years 1 months ago
MAFIA: A Performance Study of Mining Maximal Frequent Itemsets
We present a performance study of the MAFIA algorithm for mining maximal frequent itemsets from a transactional database. In a thorough experimental analysis, we isolate the effec...
Douglas Burdick, Manuel Calimlim, Jason Flannick, ...
IJCNN
2006
IEEE
15 years 5 months ago
Ensemble Techniques for Avoiding Poor Performance in Evolved Neural Networks
— The idea of using evolutionary techniques to optimize the performance of neural networks is now widely used, but some approaches have been found to result in the evolution of r...
John A. Bullinaria
ICDE
2005
IEEE
156views Database» more  ICDE 2005»
16 years 1 months ago
Reverse Nearest Neighbors in Large Graphs
A reverse nearest neighbor (RNN) query returns the data objects that have a query point as their nearest neighbor (NN). Although such queries have been studied quite extensively in...
Man Lung Yiu, Dimitris Papadias, Nikos Mamoulis, Y...
KDD
1998
ACM
120views Data Mining» more  KDD 1998»
15 years 4 months ago
Large Datasets Lead to Overly Complex Models: An Explanation and a Solution
This paper explores unexpected results that lie at the intersection of two common themes in the KDD community: large datasets and the goal of building compact models. Experiments ...
Tim Oates, David Jensen
GRAPHICSINTERFACE
2009
14 years 9 months ago
Recognizing interspersed sketches quickly
Sketch recognition is the automated recognition of hand-drawn diagrams. When allowing users to sketch as they would naturally, users may draw shapes in an interspersed manner, sta...
Tracy Anne Hammond, Randall Davis