Sciweavers

2308 search results - page 208 / 462
» A Perspective on Databases and Data Mining
Sort
View
CINQ
2004
Springer
125views Database» more  CINQ 2004»
16 years 6 hour ago
Deducing Bounds on the Support of Itemsets
Mining Frequent Itemsets is the core operation of many data mining algorithms. This operation however, is very data intensive and sometimes produces a prohibitively large output. I...
Toon Calders
DIS
2006
Springer
15 years 10 months ago
Symmetric Item Set Mining Based on Zero-Suppressed BDDs
In this paper, we propose a method for discovering hidden information from large-scale item set data based on the symmetry of items. Symmetry is a fundamental concept in the theory...
Shin-ichi Minato
ISCI
2007
99views more  ISCI 2007»
15 years 6 months ago
Privacy-preserving algorithms for distributed mining of frequent itemsets
Standard algorithms for association rule mining are based on identification of frequent itemsets. In this paper, we study how to maintain privacy in distributed mining of frequen...
Sheng Zhong
DMIN
2006
115views Data Mining» more  DMIN 2006»
15 years 8 months ago
Privacy Preserving in Clustering using Fuzzy Sets
Data mining techniques, in spite of their benefit in a wide range of applications have also raised threat to privacy and data security. This paper addresses the problem of preservi...
S. Srinivasa Rao 0002, K. V. S. V. N. Raju, P. Kus...
KDD
2002
ACM
115views Data Mining» more  KDD 2002»
16 years 7 months ago
Collaborative crawling: mining user experiences for topical resource discovery
The rapid growth of the world wide web had made the problem of topic speci c resource discovery an important one in recent years. In this problem, it is desired to nd web pages wh...
Charu C. Aggarwal