Sciweavers

Share
CVPR
2011
IEEE
8 years 4 months ago
Face Recognition in Unconstrained Videos with Matched Background Similarity
Recognizing faces in unconstrained videos is a task of mounting importance. While obviously related to face recognition in still images, it has its own unique characteristics and ...
Lior Wolf, Tal Hassner, Itay Maoz
ACL
2010
8 years 6 months ago
Coreference Resolution with Reconcile
Despite the existence of several noun phrase coreference resolution data sets as well as several formal evaluations on the task, it remains frustratingly difficult to compare resu...
Veselin Stoyanov, Claire Cardie, Nathan Gilbert, E...
ICMLA
2008
8 years 9 months ago
A Weighted Distance Measure for Calculating the Similarity of Sparsely Distributed Trajectories
This article presents a method for the calculating similarity of two trajectories. The method is especially designed for a situation where the points of the trajectories are distr...
Pekka Siirtola, Perttu Laurinen, Juha Röning
AIA
2007
8 years 9 months ago
A framework for generating data to simulate changing environments
A fundamental assumption often made in supervised classification is that the problem is static, i.e. the description of the classes does not change with time. However many practi...
Anand M. Narasimhamurthy, Ludmila I. Kuncheva
ICANN
2003
Springer
9 years 1 months ago
Supervised Locally Linear Embedding
Locally linear embedding (LLE) is a recently proposed method for unsupervised nonlinear dimensionality reduction. It has a number of attractive features: it does not require an ite...
Dick de Ridder, Olga Kouropteva, Oleg Okun, Matti ...
PAKDD
2004
ACM
143views Data Mining» more  PAKDD 2004»
9 years 1 months ago
Compact Dual Ensembles for Active Learning
Generic ensemble methods can achieve excellent learning performance, but are not good candidates for active learning because of their different design purposes. We investigate how...
Amit Mandvikar, Huan Liu, Hiroshi Motoda
ISNN
2004
Springer
9 years 1 months ago
Sparse Bayesian Learning Based on an Efficient Subset Selection
Based on rank-1 update, Sparse Bayesian Learning Algorithm (SBLA) is proposed. SBLA has the advantages of low complexity and high sparseness, being very suitable for large scale pr...
Liefeng Bo, Ling Wang, Licheng Jiao
IJCNN
2006
IEEE
9 years 2 months ago
Nominal-scale Evolving Connectionist Systems
— A method is presented for extending the Evolving Connectionist System (ECoS) algorithm that allows it to explicitly represent and learn nominal-scale data without the need for ...
Michael J. Watts
MCS
2007
Springer
9 years 2 months ago
An Experimental Study on Rotation Forest Ensembles
Rotation Forest is a recently proposed method for building classifier ensembles using independently trained decision trees. It was found to be more accurate than bagging, AdaBoost...
Ludmila I. Kuncheva, Juan José Rodrí...
SDM
2009
SIAM
160views Data Mining» more  SDM 2009»
9 years 5 months ago
Discovering Substantial Distinctions among Incremental Bi-Clusters.
A fundamental task of data analysis is comprehending what distinguishes clusters found within the data. We present the problem of mining distinguishing sets which seeks to find s...
Faris Alqadah, Raj Bhatnagar
books