Sciweavers

537 search results - page 25 / 108
» A Rough Set Approach to Attribute Generalization in Data Min...
Sort
View
DAWAK
2006
Springer
15 years 9 months ago
Achieving k-Anonymity by Clustering in Attribute Hierarchical Structures
Abstract. Individual privacy will be at risk if a published data set is not properly de-identified. k-anonymity is a major technique to de-identify a data set. A more general view ...
Jiuyong Li, Raymond Chi-Wing Wong, Ada Wai-Chee Fu...
PAKDD
2009
ACM
151views Data Mining» more  PAKDD 2009»
16 years 21 days ago
Budget Semi-supervised Learning
In this paper we propose to study budget semi-supervised learning, i.e., semi-supervised learning with a resource budget, such as a limited memory insufficient to accommodate and/...
Zhi-Hua Zhou, Michael Ng, Qiao-Qiao She, Yuan Jian...
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
16 years 6 months ago
Dense itemsets
Frequent itemset mining has been the subject of a lot of work in data mining research ever since association rules were introduced. In this paper we address a problem with frequen...
Heikki Mannila, Jouni K. Seppänen
DMKD
2004
ACM
133views Data Mining» more  DMKD 2004»
15 years 11 months ago
Mining complex matchings across Web query interfaces
To enable information integration, schema matching is a critical step for discovering semantic correspondences of attributes across heterogeneous sources. As a new attempt, this p...
Bin He, Kevin Chen-Chuan Chang, Jiawei Han
JDWM
2010
139views more  JDWM 2010»
15 years 4 months ago
Mining Frequent Generalized Patterns for Web Personalization in the Presence of Taxonomies
The Web is a continuously evolving environment, since its content is updated on a regular basis. As a result, the traditional usagebased approach to generate recommendations that ...
Panagiotis Giannikopoulos, Iraklis Varlamis, Magda...