Sciweavers

2111 search results - page 89 / 423
» Understanding the Yarowsky Algorithm
Sort
View
ICCV
2009
IEEE
14 years 7 months ago
Unsupervised learning of high-order structural semantics from images
Structural semantics are fundamental to understanding both natural and man-made objects from languages to buildings. They are manifested as repeated structures or patterns and are...
Jizhou Gao, Yin Hu, Jinze Liu, Ruigang Yang
PRL
2010
158views more  PRL 2010»
14 years 8 months ago
Data clustering: 50 years beyond K-means
: Organizing data into sensible groupings is one of the most fundamental modes of understanding and learning. As an example, a common scheme of scientific classification puts organ...
Anil K. Jain
PAMI
2006
127views more  PAMI 2006»
14 years 9 months ago
Incremental Nonlinear Dimensionality Reduction by Manifold Learning
Understanding the structure of multidimensional patterns, especially in unsupervised case, is of fundamental importance in data mining, pattern recognition and machine learning. Se...
Martin H. C. Law, Anil K. Jain
ICCAD
1997
IEEE
121views Hardware» more  ICCAD 1997»
15 years 2 months ago
Adaptive methods for netlist partitioning
An algorithm that remains in use at the core of many partitioning systems is the Kernighan-Lin algorithm and a variant the Fidducia-Matheysses (FM) algorithm. To understand the FM...
Wray L. Buntine, Lixin Su, A. Richard Newton, Andr...
BMCBI
2010
88views more  BMCBI 2010»
14 years 10 months ago
FastTagger: an efficient algorithm for genome-wide tag SNP selection using multi-marker linkage disequilibrium
Background: Human genome contains millions of common single nucleotide polymorphisms (SNPs) and these SNPs play an important role in understanding the association between genetic ...
Guimei Liu, Yue Wang, Limsoon Wong