Sciweavers

2297 search results - page 6 / 460
» A fast APRIORI implementation
Sort
View
FIMI
2004
123views Data Mining» more  FIMI 2004»
14 years 11 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
DMIN
2006
174views Data Mining» more  DMIN 2006»
14 years 11 months ago
Association Rule Mining from XML Data
- With the growing usage of XML in the World Wide Web and elsewhere as a standard for the exchange of data and to represent semistructured data, there is an imminent need for tools...
Qin Ding, Gnanasekaran Sundarraj
FCCM
2006
IEEE
170views VLSI» more  FCCM 2006»
15 years 1 months ago
An Architecture for Efficient Hardware Data Mining using Reconfigurable Computing Systems
The Apriori algorithm is a fundamental correlation-based data mining kernel used in a variety of fields. The innovation in this paper is a highly parallel custom architecture impl...
Zachary K. Baker, Viktor K. Prasanna

Tutorial
5774views
16 years 10 months ago
On the implementation of fast marching methods for 3D lattices
This technical report discusses Sethian's Fast Marching Method and its higher accuracy variant. Both methods may be used to compute the arrival times at the points of a discre...
Jakob Andreas Bærentzen
IPOM
2005
Springer
15 years 3 months ago
Evaluation of the Fast Handover Implementation for Mobile IPv6 in a Real Testbed
Abstract. Fast Handovers is an enhancement to the Mobile IPv6 protocol, currently specified in an IETF draft, which reduces the handover latency. This can be beneficial to real-t...
Albert Cabellos-Aparicio, Jose Núñez...