Introduction aux méthodes d'appariement optimal (Optimal Matching Analysis)
نویسندگان
چکیده
منابع مشابه
Méthodes à noyaux appliquées aux textes structurés
Résumé. Cet article ébauche un état de l’art sur l’utilisation des noyaux pour le traitement des données structurées. Les applications modernes de la fouille de données sont de plus en plus confrontés à des données structurées, notamment textuelles. Les algorithmes d’apprentissage doivent donc être capables de tirer parti des informations apportées par la structure, ce qui pose d’intéressants p...
متن کاملOptimal Multi-Scale Matching
The coarse-to-fine search strategy is extensively used in current reported research. However, it has the same problems as any hill climbing algorithm, most importantly, it often finds local instead of global minima. Drawing upon the artificial intelligence literature, we applied an optimal graph search, namely A*, to the problem. Using real stereo and video test sets, we compared the A* method ...
متن کاملAn Optimal Matching Problem
Suppose we are given three goods, X,Y , and Z. They are not homogeneous, but come in different qualities, x ∈ X , y ∈ Y and z ∈ Z. Goods X and Y are used for the sole purpose of producing good Z, which we are interested in. To obtain one piece of good Z, one has to assemble one piece of good X and one piece of good Y . More precisely, one can obtain a piece of quality z by assembling one piece ...
متن کاملOptimal pattern matching algorithms
We study a class of finite state machines, called w-matching machines, which yield to simulate the behavior of pattern matching algorithms while searching for a pattern w. They can be used to compute the asymptotic speed, i.e. the limit of the expected ratio of the number of text accesses to the length of the text, of algorithms while parsing an iid text to find the pattern w. Defining the orde...
متن کاملOptimal Dynamic Matching
We study a dynamic matching environment where individuals arrive sequentially. There is a tradeoff between waiting for a thicker market, allowing for higher quality matches, and minimizing agents’waiting costs. The optimal mechanism cumulates a stock of incongruent pairs up to a threshold and matches all others in an assortative fashion instantaneously. In decentralized settings, a similar prot...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of Sociological Methodology/Bulletin de Méthodologie Sociologique
سال: 2006
ISSN: 0759-1063,2070-2779
DOI: 10.1177/075910630609000103