Sciweavers

78 search results - page 12 / 16
» A Pitfall in Determining the Optimal Feature Subset Size
Sort
View
OL
2011
242views Neural Networks» more  OL 2011»
13 years 2 months ago
On connected domination in unit ball graphs
Given a simple undirected graph, the minimum connected dominating set problem is to find a minimum cardinality subset of vertices D inducing a connected subgraph such that each ve...
Sergiy Butenko, Sera Kahruman-Anderoglu, Oleksii U...
TSP
2010
13 years 2 months ago
Learning graphical models for hypothesis testing and classification
Sparse graphical models have proven to be a flexible class of multivariate probability models for approximating high-dimensional distributions. In this paper, we propose techniques...
Vincent Y. F. Tan, Sujay Sanghavi, John W. Fisher ...
TIP
2010
155views more  TIP 2010»
13 years 5 months ago
Laplacian Regularized D-Optimal Design for Active Learning and Its Application to Image Retrieval
—In increasingly many cases of interest in computer vision and pattern recognition, one is often confronted with the situation where data size is very large. Usually, the labels ...
Xiaofei He
CBMS
1997
IEEE
13 years 11 months ago
Radial basis function-based image segmentation using a receptive field
This paper presents a novel method for CT head image automatic segmentation. The images are obtained from patients having the spontaneous intra cerebral brain hemorrhage ICH. Th...
Domagoj Kovacevic, Sven Loncaric
LWA
2007
13 years 8 months ago
Towards Learning User-Adaptive State Models in a Conversational Recommender System
Typical conversational recommender systems support interactive strategies that are hard-coded in advance and followed rigidly during a recommendation session. In fact, Reinforceme...
Tariq Mahmood, Francesco Ricci