Sciweavers

899 search results - page 171 / 180
» Is an ordinal class structure useful in classifier learning
Sort
View
KDD
2009
ACM
191views Data Mining» more  KDD 2009»
14 years 8 months ago
Scalable pseudo-likelihood estimation in hybrid random fields
Learning probabilistic graphical models from high-dimensional datasets is a computationally challenging task. In many interesting applications, the domain dimensionality is such a...
Antonino Freno, Edmondo Trentin, Marco Gori
AIRWEB
2008
Springer
13 years 9 months ago
The anti-social tagger: detecting spam in social bookmarking systems
The annotation of web sites in social bookmarking systems has become a popular way to manage and find information on the web. The community structure of such systems attracts spam...
Beate Krause, Christoph Schmitz, Andreas Hotho, Ge...
KDD
2003
ACM
129views Data Mining» more  KDD 2003»
14 years 7 months ago
Empirical comparisons of various voting methods in bagging
Finding effective methods for developing an ensemble of models has been an active research area of large-scale data mining in recent years. Models learned from data are often subj...
Kelvin T. Leung, Douglas Stott Parker Jr.
BMCBI
2010
174views more  BMCBI 2010»
13 years 7 months ago
The effect of prior assumptions over the weights in BayesPI with application to study protein-DNA interactions from ChIP-based h
Background: To further understand the implementation of hyperparameters re-estimation technique in Bayesian hierarchical model, we added two more prior assumptions over the weight...
Junbai Wang
ICS
2004
Tsinghua U.
14 years 26 days ago
Inter-reference gap distribution replacement: an improved replacement algorithm for set-associative caches
We propose a novel replacement algorithm, called InterReference Gap Distribution Replacement (IGDR), for setassociative secondary caches of processors. IGDR attaches a weight to e...
Masamichi Takagi, Kei Hiraki