Sciweavers

8294 search results - page 100 / 1659
» Presenting Data from Experiments in Algorithmics
Sort
View
KDD
2006
ACM
198views Data Mining» more  KDD 2006»
16 years 5 months ago
Event detection from evolution of click-through data
Previous efforts on event detection from the web have focused primarily on web content and structure data ignoring the rich collection of web log data. In this paper, we propose t...
Qiankun Zhao, Tie-Yan Liu, Sourav S. Bhowmick, Wei...
DATAMINE
2006
130views more  DATAMINE 2006»
15 years 4 months ago
Mining Adaptive Ratio Rules from Distributed Data Sources
Different from traditional association-rule mining, a new paradigm called Ratio Rule (RR) was proposed recently. Ratio rules are aimed at capturing the quantitative association kno...
Jun Yan, Ning Liu, Qiang Yang, Benyu Zhang, QianSh...
BMCBI
2007
160views more  BMCBI 2007»
15 years 4 months ago
Identifying protein complexes directly from high-throughput TAP data with Markov random fields
Background: Predicting protein complexes from experimental data remains a challenge due to limited resolution and stochastic errors of high-throughput methods. Current algorithms ...
Wasinee Rungsarityotin, Roland Krause, Arno Sch&ou...
NIPS
2004
15 years 6 months ago
Non-Local Manifold Tangent Learning
We claim and present arguments to the effect that a large class of manifold learning algorithms that are essentially local and can be framed as kernel learning algorithms will suf...
Yoshua Bengio, Martin Monperrus
NIPS
1998
15 years 6 months ago
Learning from Dyadic Data
Dyadic data refers to a domain with two nite sets of objects in which observations are made for dyads, i.e., pairs with one element from either set. This type of data arises natur...
Thomas Hofmann, Jan Puzicha, Michael I. Jordan