Sciweavers

2004 search results - page 120 / 401
» Sampling from large graphs
Sort
View
CIMCA
2005
IEEE
15 years 12 months ago
A Hybrid Estimation of Distribution Algorithm for the Minimal Switching Graph Problem
Minimal Switching Graph (MSG) is a graphical model for the constrained via minimization problem — a combinatorial optimization problem in integrated circuit design automation. F...
Maolin Tang, Raymond Y. K. Lau
EMNLP
2010
15 years 4 months ago
Efficient Graph-Based Semi-Supervised Learning of Structured Tagging Models
We describe a new scalable algorithm for semi-supervised training of conditional random fields (CRF) and its application to partof-speech (POS) tagging. The algorithm uses a simil...
Amarnag Subramanya, Slav Petrov, Fernando Pereira
BMCBI
2007
128views more  BMCBI 2007»
15 years 6 months ago
A Bayesian nonparametric method for prediction in EST analysis
Background: Expressed sequence tags (ESTs) analyses are a fundamental tool for gene identification in organisms. Given a preliminary EST sample from a certain library, several sta...
Antonio Lijoi, Ramsés H. Mena, Igor Prü...
EMNLP
2006
15 years 7 months ago
Unsupervised Information Extraction Approach Using Graph Mutual Reinforcement
Information Extraction (IE) is the task of extracting knowledge from unstructured text. We present a novel unsupervised approach for information extraction based on graph mutual r...
Hany Hassan, Ahmed Hassan, Ossama Emam
ICDM
2005
IEEE
165views Data Mining» more  ICDM 2005»
15 years 12 months ago
Orthogonal Neighborhood Preserving Projections
— Orthogonal Neighborhood Preserving Projections (ONPP) is a linear dimensionality reduction technique which attempts to preserve both the intrinsic neighborhood geometry of the ...
Effrosini Kokiopoulou, Yousef Saad