Sciweavers

374 search results - page 35 / 75
» New Algorithms for Fast Discovery of Association Rules
Sort
View
ASC
2011
14 years 4 months ago
A rough set approach to multiple dataset analysis
In the area of data mining, the discovery of valuable changes and connections (e.g., causality) from multiple data sets has been recognized as an important issue. This issue essen...
Ken Kaneiwa
DMIN
2006
144views Data Mining» more  DMIN 2006»
14 years 11 months ago
Discovering Assignment Rules in Workforce Schedules Using Data Mining
Discovering hidden patterns in large sets of workforce schedules to gain insight into the potential knowledge in workforce schedules are crucial to better understanding the workfor...
Jihong Yan
ICDM
2006
IEEE
132views Data Mining» more  ICDM 2006»
15 years 3 months ago
Mining for Tree-Query Associations in a Graph
New applications of data mining, such as in biology, bioinformatics, or sociology, are faced with large datasets structured as graphs. We present an efficient algorithm for minin...
Eveline Hoekx, Jan Van den Bussche
IDEAL
2003
Springer
15 years 3 months 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
ADC
2003
Springer
182views Database» more  ADC 2003»
15 years 3 months 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