Sciweavers

95 search results - page 15 / 19
» Reduction Techniques for Instance-Based Learning Algorithms
Sort
View
ICML
2005
IEEE
15 years 10 months ago
Exploiting syntactic, semantic and lexical regularities in language modeling via directed Markov random fields
We present a directed Markov random field (MRF) model that combines n-gram models, probabilistic context free grammars (PCFGs) and probabilistic latent semantic analysis (PLSA) fo...
Shaojun Wang, Shaomin Wang, Russell Greiner, Dale ...
AAAI
2008
14 years 12 months ago
Sparse Projections over Graph
Recent study has shown that canonical algorithms such as Principal Component Analysis (PCA) and Linear Discriminant Analysis (LDA) can be obtained from graph based dimensionality ...
Deng Cai, Xiaofei He, Jiawei Han
KDD
2004
ACM
170views Data Mining» more  KDD 2004»
15 years 10 months ago
Why collective inference improves relational classification
Procedures for collective inference make simultaneous statistical judgments about the same variables for a set of related data instances. For example, collective inference could b...
David Jensen, Jennifer Neville, Brian Gallagher
86
Voted
IEAAIE
2003
Springer
15 years 2 months ago
Fast Feature Selection by Means of Projections
The attribute selection techniques for supervised learning, used in the preprocessing phase to emphasize the most relevant attributes, allow making models of classification simple...
Roberto Ruiz, José Cristóbal Riquelm...
KDD
2008
ACM
121views Data Mining» more  KDD 2008»
15 years 10 months ago
Reconstructing chemical reaction networks: data mining meets system identification
We present an approach to reconstructing chemical reaction networks from time series measurements of the concentrations of the molecules involved. Our solution strategy combines t...
Yong Ju Cho, Naren Ramakrishnan, Yang Cao