Sciweavers

1364 search results - page 199 / 273
» Sampling Methods for Unsupervised Learning
Sort
View
SDM
2008
SIAM
161views Data Mining» more  SDM 2008»
15 years 3 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
BMCBI
2006
154views more  BMCBI 2006»
15 years 2 months ago
Analysis with respect to instrumental variables for the exploration of microarray data structures
Background: Evaluating the importance of the different sources of variations is essential in microarray data experiments. Complex experimental designs generally include various fa...
Florent Baty, Michaël Facompré, Jan Wi...

Source Code
846views
15 years 9 months ago
Supervised Color Image Segmentation in a Markovian Framework
This is the sample implementation of a Markov random field based color image segmentation algorithm described in the following paper: Zoltan Kato, Ting Chuen Pong, and John Chu...
Mihaly Gara, Zoltan Kato
MICAI
2009
Springer
15 years 8 months ago
Supervised Recognition of Age-Related Spanish Temporal Phrases
This paper reports research on temporal expressions shaped by a common temporal expression for a period of years modified by an adverb of time. From a Spanish corpus we found that ...
Sofía N. Galicia-Haro, Alexander F. Gelbukh
ICPR
2008
IEEE
15 years 8 months ago
Semi-supervised feature selection under logistic I-RELIEF framework
We consider feature selection in the semi-supervised learning setting. This problem is rarely addressed in the literature. We propose a new algorithm as a natural extension of the...
Yubo Cheng, Yunpeng Cai, Yijun Sun, Jian Li