Sciweavers

2227 search results - page 27 / 446
» Graph Mining based on a Data Partitioning Approach
Sort
View
107
Voted
WSDM
2010
ACM
199views Data Mining» more  WSDM 2010»
15 years 9 months ago
A Sketch-Based Distance Oracle for Web-Scale Graphs
We study the fundamental problem of computing distances between nodes in large graphs such as the web graph and social networks. Our objective is to be able to answer distance que...
Atish Das Sarma, Sreenivas Gollapudi, Marc Najork,...
93
Voted
KER
2006
107views more  KER 2006»
15 years 11 days ago
Partitioning strategies for distributed association rule mining
In this paper a number of alternative strategies for distributed/parallel association rule mining are investigated. The methods examined make use of a data structure, the T-tree, ...
Frans Coenen, Paul H. Leng
PAKDD
2007
ACM
140views Data Mining» more  PAKDD 2007»
15 years 6 months ago
A Hybrid Multi-group Privacy-Preserving Approach for Building Decision Trees
In this paper, we study the privacy-preserving decision tree building problem on vertically partitioned data. We made two contributions. First, we propose a novel hybrid approach, ...
Zhouxuan Teng, Wenliang Du
RSCTC
2000
Springer
143views Fuzzy Logic» more  RSCTC 2000»
15 years 4 months ago
On Efficient Construction of Decision Trees from Large Databases
The main task in decision tree construction algorithms is to find the "best partition" of the set of objects. In this paper, we investigate the problem of optimal binary ...
Hung Son Nguyen
ICDM
2007
IEEE
116views Data Mining» more  ICDM 2007»
15 years 6 months ago
Privacy-Preserving k-NN for Small and Large Data Sets
It is not surprising that there is strong interest in kNN queries to enable clustering, classification and outlierdetection tasks. However, previous approaches to privacypreservi...
Artak Amirbekyan, Vladimir Estivill-Castro