Sciweavers

3413 search results - page 529 / 683
» New Support Vector Algorithms
Sort
View
154
Voted
ML
2000
ACM
154views Machine Learning» more  ML 2000»
15 years 2 months ago
Lazy Learning of Bayesian Rules
The naive Bayesian classifier provides a simple and effective approach to classifier learning, but its attribute independence assumption is often violated in the real world. A numb...
Zijian Zheng, Geoffrey I. Webb
118
Voted
DSN
2007
IEEE
15 years 9 months ago
Electing an Eventual Leader in an Asynchronous Shared Memory System
This paper considers the problem of electing an eventual leader in an asynchronous shared memory system. While this problem has received a lot of attention in messagepassing syste...
Antonio Fernández, Ernesto Jiménez, ...
STOC
2010
ACM
185views Algorithms» more  STOC 2010»
15 years 6 months ago
Measuring independence of datasets
Approximating pairwise, or k-wise, independence with sublinear memory is of considerable importance in the data stream model. In the streaming model the joint distribution is give...
Vladimir Braverman, Rafail Ostrovsky
157
Voted
DATAMINE
1999
152views more  DATAMINE 1999»
15 years 2 months ago
Discovery of Frequent DATALOG Patterns
Discovery of frequent patterns has been studied in a variety of data mining settings. In its simplest form, known from association rule mining, the task is to discover all frequent...
Luc Dehaspe, Hannu Toivonen
131
Voted
CIKM
2011
Springer
14 years 2 months ago
Building directories for social tagging systems
Today, a number of algorithms exist for constructing tag hierarchies from social tagging data. While these algorithms were designed with ontological goals in mind, we know very li...
Denis Helic, Markus Strohmaier