Sciweavers

4377 search results - page 685 / 876
» Mass problems and randomness
Sort
View
ICS
2010
Tsinghua U.
16 years 3 months ago
Local Algorithms for Finding Interesting Individuals in Large Networks
: We initiate the study of local, sublinear time algorithms for finding vertices with extreme topological properties -- such as high degree or clustering coefficient -- in large so...
Mickey Brautbar, Michael Kearns
PAKDD
2009
ACM
209views Data Mining» more  PAKDD 2009»
16 years 3 months ago
Approximate Spectral Clustering.
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...
Christopher Leckie, James C. Bezdek, Kotagiri Rama...
SDM
2009
SIAM
125views Data Mining» more  SDM 2009»
16 years 3 months ago
Providing Privacy through Plausibly Deniable Search.
Query-based web search is an integral part of many people’s daily activities. Most do not realize that their search history can be used to identify them (and their interests). I...
Chris Clifton, Mummoorthy Murugesan
FOIKS
2008
Springer
16 years 3 months ago
Cost-minimising strategies for data labelling : optimal stopping and active learning
Supervised learning deals with the inference of a distribution over an output or label space $\CY$ conditioned on points in an observation space $\CX$, given a training dataset $D$...
Christos Dimitrakakis, Christian Savu-Krohn
ALT
2001
Springer
16 years 3 months ago
Learning of Boolean Functions Using Support Vector Machines
This paper concerns the design of a Support Vector Machine (SVM) appropriate for the learning of Boolean functions. This is motivated by the need of a more sophisticated algorithm ...
Ken Sadohara