Sciweavers

8294 search results - page 1016 / 1659
» Presenting Data from Experiments in Algorithmics
Sort
View
KDD
2004
ACM
132views Data Mining» more  KDD 2004»
16 years 7 months ago
A probabilistic framework for semi-supervised clustering
Unsupervised clustering can be significantly improved using supervision in the form of pairwise constraints, i.e., pairs of instances labeled as belonging to same or different clu...
Sugato Basu, Mikhail Bilenko, Raymond J. Mooney
IJCNN
2006
IEEE
16 years 1 months ago
Support Vector Machines to Weight Voters in a Voting System of Entity Extractors
—Support Vector Machines are used to combine the outputs of multiple entity extractors, thus creating a composite entity extraction system. The composite system has a significant...
Deborah Duong, James Venuto, Ben Goertzel, Ryan Ri...
NIPS
1998
15 years 8 months ago
Coding Time-Varying Signals Using Sparse, Shift-Invariant Representations
A common way to represent a time series is to divide it into shortduration blocks, each of which is then represented by a set of basis functions. A limitation of this approach, ho...
Michael S. Lewicki, Terrence J. Sejnowski
HUC
2010
Springer
15 years 7 months ago
Bayesian recognition of motion related activities with inertial sensors
This work presents the design and evaluation of an activity recognition system for seven important motion related activities. The only sensor used is an Inertial Measurement Unit ...
Korbinian Frank, Maria Josefa Vera Nadales, Patric...
ICML
2005
IEEE
16 years 8 months ago
Clustering through ranking on manifolds
Clustering aims to find useful hidden structures in data. In this paper we present a new clustering algorithm that builds upon the consistency method (Zhou, et.al., 2003), a semi-...
Markus Breitenbach, Gregory Z. Grudic
« Prev « First page 1016 / 1659 Last » Next »