Sciweavers

2297 search results - page 106 / 460
» A fast APRIORI implementation
Sort
View
FIMI
2004
279views Data Mining» more  FIMI 2004»
15 years 14 days ago
DCI Closed: A Fast and Memory Efficient Algorithm to Mine Frequent Closed Itemsets
One of the main problems raising up in the frequent closed itemsets mining problem is the duplicate detection. In this paper we propose a general technique for promptly detecting ...
Claudio Lucchese, Salvatore Orlando, Raffaele Pere...
ECIR
2003
Springer
15 years 14 days ago
Attaining Fast and Successful Searches in E-commerce Environments
Current online stores suffer from a cardinal problem. There are too many products to offer, and customers find themselves lost due to the vast selection. As opposed to traditional ...
Raz Lin, Sarit Kraus, Jeffrey D. Tew
WSC
1998
15 years 12 days ago
An Object-Oriented Environment for Fast Simulation Using Compiler Techniques
In this paper, an efficient simulation environment that utilizes compiler techniques to speed up simulation is presented. The method is based on the utilization of flexible, proce...
Yiqing Huang, Ravishankar K. Iyer
SODA
1997
ACM
199views Algorithms» more  SODA 1997»
15 years 12 days ago
Fast Algorithms for Sorting and Searching Strings
We present theoretical algorithms for sorting and searching multikey data, and derive from them practical C implementations for applications in which keys are character strings. T...
Jon Louis Bentley, Robert Sedgewick
NIPS
1993
15 years 12 days ago
Fast Pruning Using Principal Components
We present a new algorithm for eliminating excess parameters and improving network generalization after supervised training. The method, \Principal Components Pruning (PCP)",...
Asriel U. Levin, Todd K. Leen, John E. Moody