نتایج جستجو برای: weighted linear combination method

تعداد نتایج: 2365951  

Journal: :Algorithms 2015
Zhen Shi Chang'an Wei Ping Fu Shouda Jiang

A parallel search strategy based on sparse representation (PS-L1 tracker) is proposed in the particle filter framework. To obtain the weights of state particles, target templates are represented linearly with the dictionary of target candidates. Sparse constraints on the coefficient guarantee that only true target candidates can be selected, and the nonnegative entries denote the associate weig...

2009
Patrick Doetsch Christian Buck Pavlo Golik Niklas Hoppe Michael Kramp Johannes Laudenberg Christian Oberdörfer Pascal Steingrube Jens Forster Arne Mauser

In this work, we describe our approach to the “Small Challenge” of the KDD cup 2009, the prediction of three aspects of customer behavior for a telecommunications service provider. Our most successful method was a Logistic Model Tree with AUC as split criterion using predictions from boosted decision stumps as features. This was the best submission for the “Small Challenge” that did not use add...

2018
Zugang Chen Jia Song Yaping Yang

To help users discover the most relevant spatial datasets in the ever-growing global spatial data infrastructures (SDIs), a number of similarity measures of geospatial data based on metadata have been proposed. Researchers have assessed the similarity of geospatial data according to one or more characteristics of the geospatial data. They created different similarity algorithms for each of the ...

2010
Claudio Marrocco Paolo Simeone Francesco Tortorella

The method we present aims at building a weighted linear combination of already trained dichotomizers, where the weights are determined to maximize the minimum rank margin of the resulting ranking system. This is particularly suited for real applications where it is difficult to exactly determine key parameters such as costs and priors. In such cases ranking is needed rather than classification...

2000
V. Petridis A. Kehagias A. Bakirtzis S. Kiartzis

1 Abstract In this paper we present an application of predictive modular neural networks (PREMONN) to short term load forecasting. PREMONNs are a family of probabilistically motivated algorithms which can be used for time series prediction, classification and identification. PREMONNs utilize local predictors of several types (e.g. linear predictors or artificial neural networks) and produce a f...

2008
Ilya Markov Natalia Vassilieva

It is a common way to process different image features independently in order to measure similarity between images. Color and texture are the common ones to use for searching in natural images. In [10] a technique to combine color and texture features based on a particular query-image in order to improve retrieval efficiency was proposed. Weighted linear combination of color and texture metrics...

2001
Meinolf Sellmann Torsten Fahle

Variable fixing is an important technique when solving combinatorial optimization problems. Unique profitable variable values are detected with respect to the objective function and to the constraint structure of the problem. Relying on that specific structure, effective variable fixing algorithms (VFAs) are only suited for the problems they have been designed for. Frequently, new combinatorial...

2004
Samuel Kim Thomas Eriksson Hong-Goo Kang

A novel scheme to analyze the effects of time variability of vocal tract for speaker recognition is proposed. We adopt a pitch synchronous feature extraction method to describe even more detailed characteristics of vocal tract, and decompose it into rapidly varying and slowly varying components with a specified linear filter along with time axis. Speaker identification tasks are performed with ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید