نتایج جستجو برای: pairwise similarity and dissimilarity constraints

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

Journal: :Journal of chemical information and modeling 2007
Guillermo Restrepo Héber Mesa Eugenio-José Llanos

We discussed three dissimilarity measures between dendrograms defined over the same set, they are triples, partition, and cluster indices. All of them decompose the dendrograms into subsets. In the case of triples and partition indices, these subsets correspond to binary partitions containing some clusters, while in the cluster index, a novel dissimilarity method introduced in this paper, the s...

2011
Wouter Voorspoels Gerrit Storms Wolf Vanpaemel

We examine the influence of contrast categories on the internal graded membership structure of natural language categories. To this end we contrast two exemplar models in their account of typicality: According to the GCM, typicality is the summed similarity towards all category members. According to the SDGCM, typicality is determined by both the summed similarity towards all category members a...

2011
Hong-mei Ju Feng-Ying Wang

We propose a new similarity measure for interval-valued fuzzy sets and show its usefulness in medical diagnostic reasoning. We point out advantages of this new concept over the most commonly used similarity measures which are the counterparts of distances. The measure we propose involves both similarity and dissimilarity.

2010
Andrej Gisbrecht Bassam Mokbel Barbara Hammer

Relational generative topographic mappings (RGTM) provide a statistically motivated data inspection and visualization tool for pairwise dissimilarities by fitting a constraint Gaussian mixture model to the data. Since it is based on pairwise dissimilarities of data, it scales quadratically with the number of training samples, making the method infeasible for large data sets. In this contributio...

Journal: :Comp. Opt. and Appl. 2010
Andrea Cassioli Marco Locatelli Fabio Schoen

Very hard optimization problems, i.e., problems with a large number of variables and local minima, have been effectively attacked with algorithms which mix local searches with heuristic procedures in order to widely explore the search space. A Population Based Approach based on a Monotonic Basin Hopping optimization algorithm has turned out to be very effective for this kind of problems. In the...

Journal: :Pattern Recognition 2009
Emre Baseski Aykut Erdem Sibel Tari

Skeletal trees are commonly used in order to express geometric properties of the shape. Accordingly, tree edit distance is used to compute a dissimilarity between two given shapes. We present a new tree edit based shape matching method which uses a recent coarse skeleton representation. The coarse skeleton representation allows us to represent both shapes and shape categories in the form of dep...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه سمنان - دانشکده علوم انسانی 1393

today, persian poetry is of great importance to many scholars around the world. the interest and attention of various cultures toward such a fine literature has given quite a good motivation for a comparative study. the major concern of the study is to investigate how nature is depicted through the works of the great english poet, william wordsworth (1770-1850) and the outstanding contemporary ...

2016
Seyed Mostafa Mousavi Kahaki Md Jan Nordin Amir H. Ashtari Sophia J. Zahra

An invariant feature matching method is proposed as a spatially invariant feature matching approach. Deformation effects, such as affine and homography, change the local information within the image and can result in ambiguous local information pertaining to image points. New method based on dissimilarity values, which measures the dissimilarity of the features through the path based on Eigenve...

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

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