Sciweavers

1215 search results - page 172 / 243
» Numbers in Multi-relational Data Mining
Sort
View
ICALP
2007
Springer
15 years 6 months ago
Private Multiparty Sampling and Approximation of Vector Combinations
We consider the problem of private efficient data mining of vertically-partitioned databases. Each of several parties holds a column of a data matrix (a vector) and the parties wan...
Yuval Ishai, Tal Malkin, Martin J. Strauss, Rebecc...
SIGMOD
2010
ACM
274views Database» more  SIGMOD 2010»
15 years 4 months ago
K-isomorphism: privacy preserving network publication against structural attacks
Serious concerns on privacy protection in social networks have been raised in recent years; however, research in this area is still in its infancy. The problem is challenging due ...
James Cheng, Ada Wai-Chee Fu, Jia Liu
GECCO
2007
Springer
155views Optimization» more  GECCO 2007»
15 years 6 months ago
Towards clustering with XCS
This paper presents a novel approach to clustering using an accuracy-based Learning Classifier System. Our approach achieves this by exploiting the generalization mechanisms inher...
Kreangsak Tamee, Larry Bull, Ouen Pinngern
SDM
2009
SIAM
175views Data Mining» more  SDM 2009»
15 years 9 months ago
Low-Entropy Set Selection.
Most pattern discovery algorithms easily generate very large numbers of patterns, making the results impossible to understand and hard to use. Recently, the problem of instead sel...
Hannes Heikinheimo, Jilles Vreeken, Arno Siebes, H...
ICDM
2009
IEEE
129views Data Mining» more  ICDM 2009»
15 years 6 months ago
Extended Boolean Matrix Decomposition
—With the vast increase in collection and storage of data, the problem of data summarization is most critical for effective data management. Since much of this data is categorica...
Haibing Lu, Jaideep Vaidya, Vijayalakshmi Atluri, ...