Sciweavers

1364 search results - page 51 / 273
» Sampling Methods for Unsupervised Learning
Sort
View
UAI
2003
15 years 3 months ago
Large-Sample Learning of Bayesian Networks is NP-Hard
In this paper, we provide new complexity results for algorithms that learn discrete-variable Bayesian networks from data. Our results apply whenever the learning algorithm uses a ...
David Maxwell Chickering, Christopher Meek, David ...
106
Voted
ICML
2007
IEEE
16 years 3 months ago
Minimum reference set based feature selection for small sample classifications
We address feature selection problems for classification of small samples and high dimensionality. A practical example is microarray-based cancer classification problems, where sa...
Xue-wen Chen, Jong Cheol Jeong
MM
2010
ACM
137views Multimedia» more  MM 2010»
15 years 2 months ago
Unsupervised summarization of rushes videos
This paper proposes a new framework to formulate the problem of rushes video summarization as an unsupervised learning problem. We pose the problem of video summarization as one o...
Yang Liu, Feng Zhou, Wei Liu, Fernando De la Torre...
127
Voted
CLEF
2009
Springer
15 years 3 months ago
MorphoNet: Exploring the Use of Community Structure for Unsupervised Morpheme Analysis
This paper investigates a novel approach to unsupervised morphology induction relying on community detection in networks. In a first step, morphological transformation rules are a...
Delphine Bernhard
ECML
2007
Springer
15 years 8 months ago
Learning from Relevant Tasks Only
We extend our recent work on relevant subtask learning, a new variant of multitask learning where the goal is to learn a good classifier for a task-of-interest with too few train...
Samuel Kaski, Jaakko Peltonen