Sciweavers

1658 search results - page 111 / 332
» Learning Unknown Graphs
Sort
View
ALT
2008
Springer
16 years 1 months ago
Exploiting Cluster-Structure to Predict the Labeling of a Graph
Abstract. The nearest neighbor and the perceptron algorithms are intuitively motivated by the aims to exploit the “cluster” and “linear separation” structure of the data to...
Mark Herbster
FLAIRS
2003
15 years 6 months ago
Identifying Inhabitants of an Intelligent Environment Using a Graph-Based Data Mining System
The goal of the MavHome smart home project is to build an intelligent home environment that is aware of its inhabitants and their activities. Such a home is designed to provide ma...
Ritesh Mehta, Diane J. Cook, Lawrence B. Holder
CORR
2002
Springer
82views Education» more  CORR 2002»
15 years 4 months ago
Using eigenvectors of the bigram graph to infer morpheme identity
This paper describes the results of some experiments exploring statistical methods to infer syntactic categories from a raw corpus in an unsupervised fashion. It shares certain po...
Mikhail Belkin, John A. Goldsmith
ALT
1999
Springer
15 years 9 months ago
PAC Learning with Nasty Noise
We introduce a new model for learning in the presence of noise, which we call the Nasty Noise model. This model generalizes previously considered models of learning with noise. Th...
Nader H. Bshouty, Nadav Eiron, Eyal Kushilevitz
AAAI
2010
15 years 6 months ago
Multi-Instance Dimensionality Reduction
Multi-instance learning deals with problems that treat bags of instances as training examples. In single-instance learning problems, dimensionality reduction is an essential step ...
Yu-Yin Sun, Michael K. Ng, Zhi-Hua Zhou