Sciweavers

184 search results - page 26 / 37
» Efficiently handling feature redundancy in high-dimensional ...
Sort
View
TASLP
2002
84views more  TASLP 2002»
13 years 7 months ago
Maximum likelihood multiple subspace projections for hidden Markov models
The first stage in many pattern recognition tasks is to generate a good set of features from the observed data. Usually, only a single feature space is used. However, in some compl...
Mark J. F. Gales
ICDM
2010
IEEE
99views Data Mining» more  ICDM 2010»
13 years 5 months ago
A System for Mining Temporal Physiological Data Streams for Advanced Prognostic Decision Support
We present a mining system that can predict the future health status of the patient using the temporal trajectories of health status of a set of similar patients. The main noveltie...
Jimeng Sun, Daby Sow, Jianying Hu, Shahram Ebadoll...
SDM
2008
SIAM
133views Data Mining» more  SDM 2008»
13 years 9 months ago
Semantic Smoothing for Bayesian Text Classification with Small Training Data
Bayesian text classifiers face a common issue which is referred to as data sparsity problem, especially when the size of training data is very small. The frequently used Laplacian...
Xiaohua Zhou, Xiaodan Zhang, Xiaohua Hu
ACL
2009
13 years 5 months ago
Concise Integer Linear Programming Formulations for Dependency Parsing
We formulate the problem of nonprojective dependency parsing as a polynomial-sized integer linear program. Our formulation is able to handle non-local output features in an effici...
André L. Martins, Noah A. Smith, Eric P. Xi...
JUCS
2006
117views more  JUCS 2006»
13 years 7 months ago
Resource Efficient Maintenance of Wireless Network Topologies
Abstract: Multiple hop routing in mobile ad hoc networks can minimize energy consumption and increase data throughput. Yet, the problem of radio interferences remain. However if th...
Tamás Lukovszki, Christian Schindelhauer, K...