Sciweavers

120 search results - page 17 / 24
» Self-Similar Mining of Time Association Rules
Sort
View
IDEAL
2003
Springer
14 years 4 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
JSW
2008
99views more  JSW 2008»
13 years 11 months ago
Using Data Mining in MURA Graphic Problems
The MURA phenomenon will result lots of problems in Photomask and TFT-LCD industries as well. In this paper, we designed and developed a MURA related association rules which suitab...
Wen-Hsing Kao, Jason C. Hung, Victoria Hsu
ICDM
2007
IEEE
145views Data Mining» more  ICDM 2007»
14 years 5 months ago
Using Data Mining to Estimate Missing Sensor Data
Estimating missing sensor values is an inherent problem in sensor network applications; however, existing data estimation approaches do not apply well to the context of datastream...
Le Gruenwald, Hamed Chok, Mazen Aboukhamis
ADC
2003
Springer
182views Database» more  ADC 2003»
14 years 4 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
KDD
2003
ACM
160views Data Mining» more  KDD 2003»
14 years 11 months ago
Playing hide-and-seek with correlations
We present a method for very high-dimensional correlation analysis. The method relies equally on rigorous search strategies and on human interaction. At each step, the method cons...
Chris Jermaine