Sciweavers

10458 search results - page 348 / 2092
» Modeling Features at Runtime
Sort
View
KDD
2010
ACM
274views Data Mining» more  KDD 2010»
15 years 10 months ago
Grafting-light: fast, incremental feature selection and structure learning of Markov random fields
Feature selection is an important task in order to achieve better generalizability in high dimensional learning, and structure learning of Markov random fields (MRFs) can automat...
Jun Zhu, Ni Lao, Eric P. Xing
170
Voted
BMCBI
2010
132views more  BMCBI 2010»
15 years 6 months ago
Error margin analysis for feature gene extraction
Background: Feature gene extraction is a fundamental issue in microarray-based biomarker discovery. It is normally treated as an optimization problem of finding the best predictiv...
Chi Kin Chow, Hai Long Zhu, Jessica Lacy, Winston ...
ICSE
2003
IEEE-ACM
15 years 12 months ago
A Tutorial on Feature Oriented Programming and Product-Lines
ct Feature Oriented Programming (FOP) is a design methodology and tools for program synthesis. The goal is to specify a target program in terms of the features that it offers, and ...
Don S. Batory
CIKM
2011
Springer
14 years 6 months ago
Towards feature selection in network
Traditional feature selection methods assume that the data are independent and identically distributed (i.i.d.). In real world, tremendous amounts of data are distributed in a net...
Quanquan Gu, Jiawei Han
KDD
2006
ACM
179views Data Mining» more  KDD 2006»
16 years 7 months ago
Extracting key-substring-group features for text classification
In many text classification applications, it is appealing to take every document as a string of characters rather than a bag of words. Previous research studies in this area mostl...
Dell Zhang, Wee Sun Lee