Sciweavers

2635 search results - page 166 / 527
» Algorithms for the Database Layout Problem
Sort
View
KDD
2001
ACM
196views Data Mining» more  KDD 2001»
16 years 5 months ago
Efficient discovery of error-tolerant frequent itemsets in high dimensions
We present a generalization of frequent itemsets allowing the notion of errors in the itemset definition. We motivate the problem and present an efficient algorithm that identifie...
Cheng Yang, Usama M. Fayyad, Paul S. Bradley
ACMSE
2009
ACM
15 years 11 months ago
A hybrid approach to mining frequent sequential patterns
The mining of frequent sequential patterns has been a hot and well studied area—under the broad umbrella of research known as KDD (Knowledge Discovery and Data Mining)— for we...
Erich Allen Peterson, Peiyi Tang
ICDE
2006
IEEE
176views Database» more  ICDE 2006»
16 years 6 months ago
Mondrian Multidimensional K-Anonymity
K-Anonymity has been proposed as a mechanism for protecting privacy in microdata publishing, and numerous recoding "models" have been considered for achieving kanonymity...
Kristen LeFevre, David J. DeWitt, Raghu Ramakrishn...
DEXAW
2007
IEEE
77views Database» more  DEXAW 2007»
15 years 11 months ago
Hyperlink Classification: A New Approach to Improve PageRank
Hyperlink Structure is widely used in the hypertext classification, but it has not been paid enough attention. We propose a hyperlink classification approach to improve PageRank a...
Li Cun-he, Lv Ke-qiang
CINQ
2004
Springer
119views Database» more  CINQ 2004»
15 years 10 months ago
How to Quickly Find a Witness
The subfield of itemset mining is essentially a collection of algorithms. Whenever a new type of constraint is discovered, a specialized algorithm is proposed to handle it. All o...
Daniel Kifer, Johannes Gehrke, Cristian Bucila, Wa...