Sciweavers

942 search results - page 45 / 189
» Efficiently Mining Long Patterns from Databases
Sort
View
DAWAK
2004
Springer
15 years 1 months ago
PROWL: An Efficient Frequent continuity Mining Algorithm on Event Sequences
Mining association rule in event sequences is an important data mining problem with many applications. Most of previous studies on association rules are on mining intra-transaction...
Kuo-Yu Huang, Chia-Hui Chang, Kuo-Zui Lin
KDD
2002
ACM
140views Data Mining» more  KDD 2002»
15 years 10 months ago
Mining frequent item sets by opportunistic projection
In this paper, we present a novel algorithm OpportuneProject for mining complete set of frequent item sets by projecting databases to grow a frequent item set tree. Our algorithm ...
Junqiang Liu, Yunhe Pan, Ke Wang, Jiawei Han
COMPSAC
2005
IEEE
14 years 11 months ago
A Novel Method for Protecting Sensitive Knowledge in Association Rules Mining
Discovering frequent patterns from huge amounts of data is one of the most studied problems in data mining. However, some sensitive patterns with security policies may cause a thr...
En Tzu Wang, Guanling Lee, Yu Tzu Lin
DEXA
2001
Springer
112views Database» more  DEXA 2001»
15 years 2 months ago
An Information-Driven Framework for Image Mining
Image mining systems that can automatically extract semantically meaningful information (knowledge) from image data are increasingly in demand. The fundamental challenge in image m...
Ji Zhang, Wynne Hsu, Mong-Li Lee
VLDB
2008
ACM
147views Database» more  VLDB 2008»
15 years 10 months ago
Providing k-anonymity in data mining
In this paper we present extended definitions of k-anonymity and use them to prove that a given data mining model does not violate the k-anonymity of the individuals represented in...
Arik Friedman, Ran Wolff, Assaf Schuster