Sciweavers

7623 search results - page 2 / 1525
» Algorithmic Features of Eclat
Sort
View
IDEAL
2003
Springer
14 years 19 days ago
Improving the Efficiency of Frequent Pattern Mining by Compact Data Structure Design
Mining frequent patterns has been a topic of active research because it is computationally the most expensive step in association rule discovery. In this paper, we discuss the use ...
Raj P. Gopalan, Yudho Giri Sucahyo
DAWAK
2004
Springer
14 years 25 days ago
Algorithms for Discovery of Frequent Superset, Rather than Frequent Subset
Abstract. In this paper, we propose a novel mining task: mining frequent superset from the database of itemsets that is useful in bioinformatics, e-learning systems, jobshop schedu...
Zhung-Xun Liao, Man-Kwan Shan
RSKT
2007
Springer
14 years 1 months ago
Mining Associations for Interface Design
Abstract. Consumer research has indicated that consumers use compensatory and non-compensatory decision strategies when formulating their purchasing decisions. Compensatory decisio...
Timothy Maciag, Daryl H. Hepting, Dominik Slezak, ...
ADC
2003
Springer
182views Database» more  ADC 2003»
14 years 20 days ago
CT-ITL : Efficient Frequent Item Set Mining Using a Compressed Prefix Tree with Pattern Growth
Discovering association rules that identify relationships among sets of items is an important problem in data mining. Finding frequent item sets is computationally the most expens...
Yudho Giri Sucahyo, Raj P. Gopalan
IPL
2007
104views more  IPL 2007»
13 years 7 months ago
A linear-time algorithm for Euclidean feature transform sets
The Euclidean distance transform of a binary image is the function that assigns to every pixel the Euclidean distance to the background. The Euclidean feature transform is the fun...
Wim H. Hesselink