Sciweavers

743 search results - page 99 / 149
» Performance Measurements for Privacy Preserving Data Mining
Sort
View
WWW
2010
ACM
15 years 11 months ago
Find me if you can: improving geographical prediction with social and spatial proximity
Geography and social relationships are inextricably intertwined; the people we interact with on a daily basis almost always live near us. As people spend more time online, data re...
Lars Backstrom, Eric Sun, Cameron Marlow
KDD
2001
ACM
153views Data Mining» more  KDD 2001»
16 years 5 months ago
Evaluation of prediction models for marketing campaigns
We consider prediction-model evaluation in the context of marketing-campaign planning. In order to evaluate and compare models with specific campaign objectives in mind, we need t...
Saharon Rosset, Einat Neumann, Uri Eick, Nurit Vat...
PAKDD
2007
ACM
224views Data Mining» more  PAKDD 2007»
15 years 10 months ago
Graph Nodes Clustering Based on the Commute-Time Kernel
This work presents a kernel method for clustering the nodes of a weighted, undirected, graph. The algorithm is based on a two-step procedure. First, the sigmoid commute-time kernel...
Luh Yen, François Fouss, Christine Decaeste...
ADMA
2006
Springer
121views Data Mining» more  ADMA 2006»
15 years 10 months ago
A New Polynomial Time Algorithm for Bayesian Network Structure Learning
We propose a new algorithm called SCD for learning the structure of a Bayesian network. The algorithm is a kind of constraintbased algorithm. By taking advantage of variable orderi...
Sanghack Lee, Jihoon Yang, Sungyong Park
ICDE
2006
IEEE
124views Database» more  ICDE 2006»
16 years 6 months ago
C-Cubing: Efficient Computation of Closed Cubes by Aggregation-Based Checking
It is well recognized that data cubing often produces huge outputs. Two popular efforts devoted to this problem are (1) iceberg cube, where only significant cells are kept, and (2...
Dong Xin, Zheng Shao, Jiawei Han, Hongyan Liu