Sciweavers

446 search results - page 53 / 90
» Randomization in Privacy-Preserving Data Mining
Sort
View
KDD
2006
ACM
122views Data Mining» more  KDD 2006»
14 years 10 months ago
Measuring and extracting proximity in networks
Measuring distance or some other form of proximity between objects is a standard data mining tool. Connection subgraphs were recently proposed as a way to demonstrate proximity be...
Yehuda Koren, Stephen C. North, Chris Volinsky
SIGIR
2003
ACM
14 years 3 months ago
Table extraction using conditional random fields
The ability to find tables and extract information from them is a necessary component of data mining, question answering, and other information retrieval tasks. Documents often c...
David Pinto, Andrew McCallum, Xing Wei, W. Bruce C...
CORR
2010
Springer
177views Education» more  CORR 2010»
13 years 10 months ago
Supervised Random Walks: Predicting and Recommending Links in Social Networks
Predicting the occurrence of links is a fundamental problem in networks. In the link prediction problem we are given a snapshot of a network and would like to infer which interact...
Lars Backstrom, Jure Leskovec
COMSWARE
2007
IEEE
14 years 4 months ago
Analysis of Dynamic Sensor Networks: Power Law Then What?
— Recent studies on wireless sensor networks (WSN) have shown that the duration of contacts and inter-contacts are power law distributed. While this is a strong property of these...
Eric Fleury, Jean-Loup Guillaume, Céline Ro...
KDD
2008
ACM
137views Data Mining» more  KDD 2008»
14 years 10 months ago
Learning classifiers from only positive and unlabeled data
The input to an algorithm that learns a binary classifier normally consists of two sets of examples, where one set consists of positive examples of the concept to be learned, and ...
Charles Elkan, Keith Noto