Sciweavers

349 search results - page 56 / 70
» Online Data Mining for Co-Evolving Time Sequences
Sort
View
SDM
2008
SIAM
161views Data Mining» more  SDM 2008»
14 years 11 months ago
Efficient Maximum Margin Clustering via Cutting Plane Algorithm
Maximum margin clustering (MMC) is a recently proposed clustering method, which extends the theory of support vector machine to the unsupervised scenario and aims at finding the m...
Bin Zhao, Fei Wang, Changshui Zhang
ICDM
2007
IEEE
227views Data Mining» more  ICDM 2007»
15 years 4 months ago
Optimal Subsequence Bijection
We consider the problem of elastic matching of sequences of real numbers. Since both a query and a target sequence may be noisy, i.e., contain some outlier elements, it is desirab...
Longin Jan Latecki, Qiang Wang, Suzan Koknar-Tezel...
NECO
2000
86views more  NECO 2000»
14 years 9 months ago
A Bayesian Committee Machine
The Bayesian committee machine (BCM) is a novel approach to combining estimators which were trained on different data sets. Although the BCM can be applied to the combination of a...
Volker Tresp
ICDM
2008
IEEE
145views Data Mining» more  ICDM 2008»
15 years 4 months ago
Paired Learners for Concept Drift
To cope with concept drift, we paired a stable online learner with a reactive one. A stable learner predicts based on all of its experience, whereas a reactive learner predicts ba...
Stephen H. Bach, Marcus A. Maloof
WADS
1989
Springer
84views Algorithms» more  WADS 1989»
15 years 2 months ago
Skip Lists: A Probabilistic Alternative to Balanced Trees
rees can be used for representing abstract data types such as dictionaries and ordered lists. They work well when the elements are inserted in a random order. Some sequences of ope...
William Pugh