Tesis sobre el tema "Dissimilarités"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte los 50 mejores tesis para su investigación sobre el tema "Dissimilarités".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Explore tesis sobre una amplia variedad de disciplinas y organice su bibliografía correctamente.
Seston, Morgan. "Dissimilarités de Robinson : algorithmes de reconnaissance et d'approximation". Aix-Marseille 2, 2008. http://theses.univ-amu.fr.lama.univ-amu.fr/2008AIX22045.pdf.
Texto completoBaudrier, Etienne. "Comparaison d'images binaires reposant sur une mesure locale des dissimilarités : Application à la classification". Reims, 2005. http://theses.univ-reims.fr/exl-doc/GED00000305.pdf.
Texto completoThis PhD deals with the comparison of binary images that are not composed of a single pattern. The proposed method is then extended to gray level images. Using a measure example - the Hausdorff distance (HD) - a local measure is defined throught a window, and its properties depending on the window size and the global HD measure are proved. Thanks to them, a window-size criterion is defined so as the window to be adjusted to the local dissimilarity. The local dissimilarity map (LDM) is then defined when the window slides over all the compared images. The LDM can be defined with other measure than the HD using the same algorithm, nevertheless, the DH properties leads to a LDM fast computation. The LDM can be used as image dissimilarity visualization method or a tool to decide on image similarity. For this last point, a first step is a binary-image adapted multiresolution analysis which is base on the median morphological filter. This allows to have an resolution adapted to the researched similarity degree. A second step consists in using LDM information concerning the dissimilarities and their spatial distribution to compare the images. Several comparison methods are tested, the most efficient one is based on the SVM with the whole LDM as input data. The method efficiency is successfully tested on an ancient-impressions database and on a face database
Dalleau, Kevin. "Une approche stochastique à base d’arbres aléatoires pour le calcul de dissimilarités : application au clustering pour diverses structures de données". Electronic Thesis or Diss., Université de Lorraine, 2021. http://www.theses.fr/2021LORR0181.
Texto completoThe notion of distance, and more generally of dissimilarity, is an important one in data mining, especially in unsupervised approaches. The algorithms belonging to this class of methods aim at grouping objects in an homogeneous way, and many of them rely on a notion of dissimilarity, in order to quantify the proximity between objects. The choice of algorithms as well as that of dissimilarities is not trivial. Several elements can motivate these choices, such as the type of data – homogeneous data or not –, their representation – feature vectors, graphs –, or some of their characteristics – highly correlated, noisy, etc. –. Although many measures exist, their choice can become complex in some specific settings. This leads to additional complexity in data mining tasks. In this thesis, we present a new approach for computing dissimilarities based on random trees. It is an original approach, which has several advantages such as a great versatility. Indeed, using different dissimilarity calculation modules that we can plug to the method, it becomes possible to apply it in various settings. In particular, we present in this document two modules, enabling the computation of dissimilarities - and, in fine, clustering - on data structured as feature vectors, and on data in the form of graphs. We discuss the very promising results obtained by this approach, as well as the numerous perspectives that it opens, such as the computation of dissimilarity in the framework of attributed graphs, through a unified approach
Abou, Latif Firas. "Identification du profil des utilisateurs d’un hypermédia encyclopédique à l’aide de classifieurs basés sur des dissimilarités : création d’un composant d’un système expert pour Hypergéo". Thesis, Rouen, INSA, 2011. http://www.theses.fr/2011ISAM0004/document.
Texto completoThis thesis is devoted to identify the profile of hypermedia user, then to adapt it according to user’s profile. This profile is found by using supervised learning algorithm like SVM. The user model is one of the essential components of adaptive hypermedia. One way to characterize this model is to associate a user to a profile. Web Usage Mining (WUM) identifies this profile from traces. However, these techniques usually operate on large mass of data. In the case when not enough data are available, we propose to use the structure and the content of the hypermedia. Hence, we used supervised kernel learning algorithms for which we have defined the measure of similarity between traces based on a “distance” between documents of the site. Our approach was validated using synthetic data and then using real data from the traces of Hypergéo users, Hypergéo is an encyclopedic website specialized in geography. Our results were compared with those obtained using a techniques of WUM(the algorithm of characteristic patterns). Finally, our proposals to identify the profiles a posteriori led usto highlight five profiles. Hypergéo users are classified according to their interests when the “semantic distance” between documents is applied
Abou, Latif Firas. "Identification du profil des utilisateurs d'un hypermédia encyclopédique à l'aide de classifieurs basés sur des dissimilarités : création d'un composant d'un système expert pour Hypergéo". Phd thesis, INSA de Rouen, 2011. http://tel.archives-ouvertes.fr/tel-00625439.
Texto completoKetata, Ines. "Extraction et Modélisation de la cinétique du traceur en imagerie TEP pour la caractérisation des tissus tumoraux". Thesis, Reims, 2013. http://www.theses.fr/2013REIMS031/document.
Texto completoThe research of this thesis proposes in the context of the breast cancer characterization in order to achieve a new approach for the extraction and modeling of the tracer kinetics in PET imaging.The measurement of the counting rate of a tracer in a region of interest (ROI) estimated using an extension of a Real Valued Local Dissimilarity Map (RVLDM) proposed grayscale and the use of dynamic models as the method of factor analysis of medical image sequences (FAMIS) applied on the ROI enable an automatic early quantification of glucose metabolism. More specifically, it is to determine a new KFPQ empirical parameter. It is calculated from the two compartments obtained in the region of interest and tumor as assessed during the first pass of the 18F-FDG tracer in the early PET images
Cao, Hongliu. "Forêt aléatoire pour l'apprentissage multi-vues basé sur la dissimilarité : Application à la Radiomique". Thesis, Normandie, 2019. http://www.theses.fr/2019NORMR073/document.
Texto completoThe work of this thesis was initiated by a Radiomic learning problem. Radiomics is a medical discipline that aims at the large-scale analysis of data from traditional medical imaging to assist in the diagnosis and treatment of cancer. The main hypothesis of this discipline is that by extracting a large amount of information from the images, we can characterize the specificities of this pathology in a much better way than the human eye. To achieve this, Radiomics data are generally based on several types of images and/or several types of features (from images, clinical, genomic). This thesis approaches this problem from the perspective of Machine Learning (ML) and aims to propose a generic solution, adapted to any similar learning problem. To do this, we identify two types of ML problems behind Radiomics: (i) learning from high dimension, low sample size (HDLSS) and (ii) multiview learning. The solutions proposed in this manuscript exploit dissimilarity representations obtained using the Random Forest method. The use of dissimilarity representations makes it possible to overcome the well-known difficulties of learning high dimensional data, and to facilitate the joint analysis of the multiple descriptions, i.e. the views.The contributions of this thesis focus on the use of the dissimilarity easurement embedded in the Random Forest method for HDLSS multi-view learning. In particular, we present three main results: (i) the demonstration and analysis of the effectiveness of this measure for HDLSS multi-view learning; (ii) a new method for measuring dissimilarities from Random Forests, better adapted to this type of learning problem; and (iii) a new way to exploit the heterogeneity of views, using a dynamic combination mechanism. These results have been obtained on radiomic data but also on classical multi-view learning problems
Drouet, d'Aubigny Gérard Romier Guy Van Cutsem Bernard. "L'analyse multidimensionnelle des données de dissimilarité". S.l. : Université Grenoble 1, 2008. http://tel.archives-ouvertes.fr/tel-00332393.
Texto completoZhu, Xibin [Verfasser]. "Adaptive prototype-based dissimilarity learning / Xibin Zhu". Bielefeld : Universitätsbibliothek Bielefeld, 2015. http://d-nb.info/1072224704/34.
Texto completoOrtiz-Reynoso, Alejandra. "Perceiving similarity and dissimilarity in diverse teams". Thesis, University of Sheffield, 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.422641.
Texto completoXu, Weiping. "Non-Euclidean dissimilarity data in pattern recognition". Thesis, University of York, 2012. http://etheses.whiterose.ac.uk/3848/.
Texto completoCejnog, Luciano Walenty Xavier. "Rigid registration based on local geometric dissimilarity". Universidade Federal de Juiz de Fora (UFJF), 2015. https://repositorio.ufjf.br/jspui/handle/ufjf/4882.
Texto completoApproved for entry into archive by Adriana Oliveira (adriana.oliveira@ufjf.edu.br) on 2017-06-24T13:12:44Z (GMT) No. of bitstreams: 1 lucianowalentyxaviercejnog.pdf: 14234810 bytes, checksum: 492ebb7393b5f0e7cfc6e822067fe492 (MD5)
Made available in DSpace on 2017-06-24T13:12:44Z (GMT). No. of bitstreams: 1 lucianowalentyxaviercejnog.pdf: 14234810 bytes, checksum: 492ebb7393b5f0e7cfc6e822067fe492 (MD5) Previous issue date: 2015-09-21
CAPES - Coordenação de Aperfeiçoamento de Pessoal de Nível Superior
Este trabalho visa melhorar um método clássico para o problema de registro rígido, o ICP (iterative Closest Point), fazendo com que a busca dos pontos mais próximos, uma de suas fases principais, considere informações aproximadas da geometria local de cada ponto combinadas à distância Euclidiana originalmente usada. Para isso é necessária uma etapa de pré-processamento, na qual a geometria local é estimada em tensores de orientação de segunda ordem. É definido o CTSF, um fator de similaridade entre tensores. O ICP é alterado de modo a considerar uma combinação linear do CTSF com a distância Euclidiana para estabelecer correspondências entre duas nuvens de pontos, variando os pesos relativos entre os dois fatores. Isso proporciona uma capacidade maior de convergência para ângulos maiores em relação ao ICP original, tornando o método comparável aos que constituem o estado da arte da área. Para comprovar o ganho obtido, foram realizados testes exaustivos em malhas com características geométricas variadas, para diferentes níveis de ruído aditivo, outliers e em casos de sobreposição parcial, variando os parâmetros do método de estimativa dos tensores. Foi definida uma nova base com malhas sintéticas para os experimentos, bem como um protocolo estatístico de avaliação quantitativa. Nos resultados, a avaliação foi feita de modo a determinar bons valores de parâmetros para malhas com diferentes características, e de que modo os parâmetros afetam a qualidade do método em situações com ruído aditivo, outliers, e sobreposição parcial.
This work aims to enhance a classic method for the rigid registration problem, the ICP (Iterative Closest Point), modifying one of its main steps, the closest point search, in order to consider approximated information of local geometry combined to the Euclidean distance, originally used. For this, a preprocessing stage is applied, in which the local geometry is estimated in second-order orientation tensors. We define the CTSF, a similarity factor between tensors. Our method uses a linear combination between this factor and the Euclidean distance, in order to establish correspondences, and a strategy of weight variation between both factors. This increases the convergence probability for higher angles with respect to the original ICP, making our method comparable to some of the state-of-art techniques. In order to comprove the enhancement, exhaustive tests were made in point clouds with different geometric features, with variable levels of additive noise and outliers and in partial overlapping situations, varying also the parameters of the tensor estimative method. A dataset of synthetic point clouds was defined for the experiments, as well as a statistic protocol for quantitative evaluation. The results were analyzed in order to highlight good parameter ranges for different point clouds, and how these parameters affect the behavior of the method in situations of additive noise, outliers and partial overlapping.
Deneuve, Emeline. "Three essays on key audit matters dissimilarity". Electronic Thesis or Diss., Cergy-Pontoise, Ecole supérieure des sciences économiques et commerciales, 2023. http://www.theses.fr/2023ESEC0002.
Texto completoMy dissertation consists of three essays reported in three different Chapters, each related to a different research question about the Key Audit Matters (KAM) section in audit reports. KAM disclosures have been implemented to enhance the communicative value of audit reports and to increase users’ confidence in the audit process and the companies’ financial statements (EY Reporting, 2015). KAMs reflect the greatest risks of material misstatements encountered during the audit process based on auditors’ professional judgment (FRC, 2020). Their implementation represents the most significant change in the audit report for the past 70 years. KAMs have first been implemented in the United Kingdom (UK) in 2013. To get the largest sample period possible, I use hand-collected data from premium-listed non-financial firms on the London Stock Exchange (LSE). KAMs represent additional qualitative disclosures in the audit report, where auditors report one KAM per risk encountered during the audit process. Each KAM is related to a significant matter and is composed of two parts. Auditors first describe the risk encountered and then explain the audit procedures performed to address the risk identified. I define these two parts as the following two KAM components: the risk description and the auditors’ response and observation. Although auditors are encouraged to write KAMs in their own words (FRC, 2013b), critics of this new disclosure requirement fear that KAMs would be boilerplate and standardized (Citi Research, 2014; Gray, Turner, Coram, & Mock, 2011; Mock et al., 2013). Although several researchers examine the consequences of the KAM regulation worldwide, I believe that examining the content of KAMs provides more granular insights into the audit process. I develop measures of dissimilarity to capture specific information in KAMs. These measures reflect differences in words written by auditors for the same type of KAM. My Thesis contributes to the KAM literature by providing a granular analysis of the content of KAM disclosures and by complementing studies examining textual features of KAMs (e.g., Burke, Hoitash, Hoitash, & Xiao, 2022; Chen, Nelson, Wang, & Yu, 2020; Gutierrez, Minutti-Meza, Tatum, & Vulcheva, 2018; Lennox, Schmidt, & Thompson, 2022)
Beninel, Farid. "Problèmes de représentations sphériques des tableaux de dissimilarité". Grenoble 2 : ANRT, 1987. http://catalogue.bnf.fr/ark:/12148/cb376028409.
Texto completoMokbel, Bassam [Verfasser]. "Dissimilarity-based learning for complex data / Bassam Mokbel". Bielefeld : Universitätsbibliothek Bielefeld, 2016. http://d-nb.info/1082033952/34.
Texto completoGisbrecht, Andrej [Verfasser]. "Advances in dissimilarity-based data visualisation / Andrej Gisbrecht". Bielefeld : Universitätsbibliothek Bielefeld, 2015. http://d-nb.info/1068621729/34.
Texto completoPerrier, Xavier. "Analyse de la diversité génétique : mesures de dissimilarité et représentations arborées". Montpellier 2, 1998. http://www.theses.fr/1998MON20201.
Texto completoHasenfuß, Alexander [Verfasser]. "Topographic mapping of dissimilarity datasets / vorgelegt von Alexander Hasenfuß". [Clausthal-Zellerfeld] : [Univ.-Bibliothek], 2009. http://d-nb.info/997448334/34.
Texto completoChan, Yat-ling y 陳逸靈. "An optimization algorithm for clustering using weighted dissimilarity measures". Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2003. http://hub.hku.hk/bib/B26667009.
Texto completoHahsler, Michael y Kurt Hornik. "Dissimilarity Plots. A Visual Exploration Tool for Partitional Clustering". Department of Statistics and Mathematics, WU Vienna University of Economics and Business, 2009. http://epub.wu.ac.at/1244/1/document.pdf.
Texto completoSeries: Research Report Series / Department of Statistics and Mathematics
Ignacio, Paul Samuel Padasas. "Stability of persistent directed clique homology on dissimilarity networks". Diss., University of Iowa, 2019. https://ir.uiowa.edu/etd/6961.
Texto completoLhéritier, Alix. "Méthodes non-paramétriques pour l'apprentissage et la détection de dissimilarité statistique multivariée". Thesis, Nice, 2015. http://www.theses.fr/2015NICE4072/document.
Texto completoIn this thesis, we study problems related to learning and detecting multivariate statistical dissimilarity, which are of paramount importance for many statistical learning methods nowadays used in an increasingly number of fields. This thesis makes three contributions related to these problems. The first contribution introduces a notion of multivariate nonparametric effect size shedding light on the nature of the dissimilarity detected between two datasets. Our two step method first decomposes a dissimilarity measure (Jensen-Shannon divergence) aiming at localizing the dissimilarity in the data embedding space, and then proceeds by aggregating points of high discrepancy and in spatial proximity into clusters. The second contribution presents the first sequential nonparametric two-sample test. That is, instead of being given two sets of observations of fixed size, observations can be treated one at a time and, when strongly enough evidence has been found, the test can be stopped, yielding a more flexible procedure while keeping guaranteed type I error control. Additionally, under certain conditions, when the number of observations tends to infinity, the test has a vanishing probability of type II error. The third contribution consists in a sequential change detection test based on two sliding windows on which a two-sample test is performed, with type I error guarantees. Our test has controlled memory footprint and, as opposed to state-of-the-art methods that also provide type I error control, has constant time complexity per observation, which makes our test suitable for streaming data
Kamdem, Kengne Christiane. "Abstraction et comparaison de traces d'exécution pour l'analyse d'applications multimédias embarquées". Thesis, Grenoble, 2014. http://www.theses.fr/2014GRENM061/document.
Texto completoThe SoC-Trace project aims to develop a set of methods and tools based on execution traces of multicore embedded applications to meet the growing needs of observability and 'débogability' required by the industry. The project aims in particular the development of new analytical methods, based on different data analysis techniques such as probabilistic analysis, data mining, and data aggregation. They should allow the automatic identification of anomalies, the analysis of complex correlations and dependencies between different components of an embedded application and control of the volume traces that can now exceed the gigabyte. The aim of the thesis is to provide a high-level representation of information in the trace based semantics. It will initially develop an effective tool for comparing traces, to define a semantic distance for execution traces, then a second time to analyze and interpret the results of comparisons of traces based on the defined distance
Shojanazeri, Hamid. "A new perceptual dissimilarity measure for image retrieval and clustering". Thesis, Federation University Australia, 2018. http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/168086.
Texto completoDoctor of Philosophy
Cléa, Gomes da Silva Alzennyr. "Dissimilarity fuctions analysis based on dynamic clustering for symbolic data". Universidade Federal de Pernambuco, 2005. https://repositorio.ufpe.br/handle/123456789/2797.
Texto completoA análise de dados simbólicos (Symbolic Data Analysis) é um novo domínio na área de descoberta automática de conhecimento que visa desenvolver métodos para dados descritos por variáveis que podem assumir como valor conjuntos de categorias, intervalos ou distribuições de probabilidade. Essas novas variáveis permitem levar em conta a variabilidade e/ou a incerteza presente nos dados. O tratamento de dados simbólicos através de técnicas estatísticas e de aprendizagem de máquina necessita da introdução de medidas de distância capazes de manipular tal tipo de dado. Com esse objetivo, diversas funções de dissimilaridade têm sido propostas na literatura. Entretanto, nenhum estudo comparativo acerca do desempenho de tais funções em problemas que envolvem simultaneamente dados simbólicos booleanos e modais foi realizado. A principal contribuição dessa dissertação é realizar uma análise comparativa e uma avaliação empírica sobre funções de dissimilaridade para dados simbólicos, uma vez que esse tipo de estudo, apesar de muito relevante, é quase inexistente na literatura. Além disso, este trabalho também introduz novas funções de dissimilaridade que podem ser usadas no agrupamento dinâmico de dados simbólicos. Os algoritmos de agrupamento dinâmico consistem em obter, simultaneamente, uma partição em um número fixo de classes e a identificação de um representante para cada classe, minimizando localmente um critério que mede a adequação entre as classes e os seus representantes. Para validar esse estudo, foram realizados experimentos com bases de dados de referência na literatura e dois conjuntos de dados artificiais de intervalos com diferentes graus de dificuldade de classificação, objetivando a comparação das funções avaliadas. A precisão dos resultados foi mensurada por um índice externo de agrupamento aplicado na validação cruzada não supervisionada, para as bases de dados reais, e também no quadro de uma experiência Monte Carlo, para as bases de dados artificiais. Com os resultados alcançados é possível verificar a adequação das diversas funções de dissimilaridade aos diferentes tipos de dados simbólicos (multivalorado, multivalorado ordinal, intervalar, e modal de mesmo suporte e de suportes diferentes), bem como identificar as melhores configurações de funções. Testes estatísticos validam as conclusões
Drouet, d'Aubigny Gérard. "L'analyse multidimensionnelle des données de dissimilarité : [thèse soutenue sur un ensemble de travaux]". Grenoble 1, 1989. http://tel.archives-ouvertes.fr/tel-00332393.
Texto completoMachmouchi, Mouzid. "Contributions à la mise en oeuvre des méthodes d'analyse des données de dissimilarité". Grenoble 2, 1992. http://www.theses.fr/1992GRE21025.
Texto completoThis work presents a comparative study of several methods for resolving problem of multidimensional scaling (mds), and proposes new methods and new solving strategies. First, we present many methods based on the optimisation of the function kruskal stress. The development of these methods shows important problems due to the necessity of the optimisation of no convex and no differentiable functions. Next, we propose an algorithm based on the two phases alternate iteration. The first one solves a no differentiable programmation problem by introducing an heuristic step proposed by. Kruskal. The second phase solves a regression problem. Then, we prove by using simulated annealing methods that we improve the numerate quality of solutions, we propose an efficace strategy to exit from situations of local optimates, and we find especially a way to solve elegantly past problems caused by the necessity to activate present mds algorithms from many initial configurations sufficiently distinct. Then, we suggest a new resolving strategy of mds problem with the creation of algorithm s. E. M. Scal. This igorithm applies the method s. E. M. (stochastique estimation, maximisation) by estimating the configuration matrix x with maximise the likelihood of observed dissimilarities
Snyder, Jasmine. "The Role of Stress and Demographic Dissimilarity in the Employment Interview". Thesis, Hofstra University, 2013. http://pqdtopen.proquest.com/#viewpdf?dispub=3595493.
Texto completoThis study explored the impact demographic dissimilarity between an interviewer and a job candidate has on how the candidate is evaluated for a job. The interviewer's levels of race- and gender-based prejudice were examined as moderators of this relationship, while stress was examined as a mediator. Race and gender dissimilarity were manipulated by presenting participants with scripted videos of a job candidate responding to interview questions. Participants, who consisted of undergraduate students, were randomly assigned to evaluate a White male, a White female, an African-American male, or an African-American female job applicant. After a brief introductory clip of the candidate, participants reported how stressful they expected the task of evaluating the candidate to be and after watching the video of the interview evaluated the candidate for the job of Academic Advisor, and completed measures of prejudice.
While racial and gender dissimilarity to the job candidate did not directly affect how the candidate was evaluated for the job, results showed that racial and gender dissimilarity indirectly affected how the candidate was evaluated for the job through the mediator of stress and at different levels of race- and gender-based prejudice. Theoretical support for the impact of demographic dissimilarity on interview outcomes is provided and the practical implications of these findings are discussed. Suggestions for future areas of research are also presented.
Selvan, A. D. Arul Nirai. "Highlighting dissimilarity in medical images using hierarchical clustering based segmentation (HCS)". Thesis, Sheffield Hallam University, 2007. http://shura.shu.ac.uk/20342/.
Texto completoLyons, Sherrice Olithia. "The Effects of Cultural Dissimilarity on Employee Job Attitudes and Productivity". ScholarWorks, 2018. https://scholarworks.waldenu.edu/dissertations/5371.
Texto completoAupetit, Sébastien. "Contributions aux Modèles de Markov Cachés : métaheuristiques d'apprentissage, nouveaux modèles et visualisation de dissimilarité". Phd thesis, Université François Rabelais - Tours, 2005. http://tel.archives-ouvertes.fr/tel-00168392.
Texto completode métaheuristiques biomimétiques classiques (les algorithmes génétiques, l'algorithme de fourmis artificielles API et l'optimisation par essaim particulaire) au problème de l'apprentissage de MMC. Dans la
deuxième partie, nous proposons un nouveau type de modèle de Markov caché, appelé modèle Markov caché à substitutions de symboles (MMCSS). Un MMCSS permet d'incorporer des connaissances a priori dans le processus d'apprentissage et de reconnaissance. Les premières expérimentations de ces modèles sur des images démontrent leur intérêt. Dans la troisième partie, nous proposons une nouvelle méthode de représentation de dissimilarité appelée matrice de scatterplots pseudo-euclidienne (MSPE), permettant de mieux comprendre les interactions entre des MMC. Cette MSPE est construite à partir
d'une technique que nous nommons analyse en composantes principales à noyau indéfini (ACPNI). Nous terminons par la présentation de la bibliothèque HMMTK, développée au cours de ce travail. Cette dernière intègre des mécanismes de parallélisation et les algorithmes développés au cours de la thèse.
Simon-Gabriel, Carl-Johann [Verfasser] y Bernhard [Akademischer Betreuer] Schölkopf. "Distribution-Dissimilarities in Machine Learning / Carl-Johann Simon-Gabriel ; Betreuer: Bernhard Schölkopf". Tübingen : Universitätsbibliothek Tübingen, 2019. http://d-nb.info/1204930058/34.
Texto completoSimon-Gabriel, Carl-Johann Verfasser] y Bernhard [Akademischer Betreuer] [Schölkopf. "Distribution-Dissimilarities in Machine Learning / Carl-Johann Simon-Gabriel ; Betreuer: Bernhard Schölkopf". Tübingen : Universitätsbibliothek Tübingen, 2019. http://d-nb.info/1204930058/34.
Texto completoNielsen, Brittany M. "Impact of ingroup identity, outgroup entitativity and value dissimilarity on vicarious retribution". Thesis, California State University, Long Beach, 2014. http://pqdtopen.proquest.com/#viewpdf?dispub=1527738.
Texto completoPrevious literature has found that individuals who are highly identified with their own ingroup and who perceive an outgroup as being more cohesive (viz., high in entitativity) will exhibit greater levels of vicarious retribution. Further studies have shown that an individual who perceives the outgroup as having dissimilar values to their own will engage in higher levels of direct aggression. The current study was the first to investigate value dissimilarity as a moderator in the relationship between both ingroup identification and outgroup entitativity on subsequent vicarious retribution. This study used a 3 (value dissimilarity: high, low, neutral/no information) x 2 (outgroup entitativity: high, low) between subjects design. Results indicated that among participants who had a strong reaction to the provocation, low value dissimilarity significantly lowered aggression thus serving to buffer the effect of provocation on subsequent vicarious retribution. Implications for reducing intergroup violence and vicarious retribution are discussed.
Resare, Pontus. "Examining Handovers in a Telecommunications Network Using Markov Chains and Dissimilarity Matrices". Thesis, KTH, Matematisk statistik, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-229069.
Texto completoEtt telekommunikationsnätverk är uppdelat i celler, dessa har radioegenskaper som ska minska interferensen. Användare rör sig mellan cellerna med sin utrustning. Om utrustningen används aktivt, så kommer den gå igenom en process kallad handover när den rör sig mellan celler, och sekvenser av besökta celler skapas. Detta examensarbete undersöker dessa handovers och de motsvarande cellsekvenserna. I detta examensarbete finns det två mål relaterade till handover mellan celler. Det första målet är att bestämma om olika typer av cellsekvenser har olika proportioner av oönskat beteende, det andra målet är att skapa en metod som kan upptäcka skillnader i handovermönster mellan olika tidsperioder. För båda målen så undersöks det om cellsekvenserna kan modelleras som Markovkedjor av ordning r. För att uppnå det första målet, så undersöks det med hjälp av en Markovkedjemetod, om sekvenser med samma r första celler har samma proportion av oönskat beteende. Cellsekvenserna undersöks också i sin helhet genom att de klassificeras med hjälp av en olikhetsmatris. För att uppnå det andra målet, så undersöks det först om det är möjligt att modellera cellsekvenserna från olika tidsperioder som Markovkedjor för att sedan göra ett homogenitetstest dem emellan. Efter detta så undersöks det om olikhetsmått kan användas för att upptäcka skillnader mellan tidsperioder, detta görs med hjälp av olikhetsmatriser. I detta examensarbete så kan man konstatera att olika typer av sekvenser har olika proportioner av oönskat beteende. Dessutom så kan det konstateras att det inte fungerar att detektera skillnader i handovermönster genom att modellera cellsekvenserna som Markovkedjor och sedan göra homogenitetstest. Slutligen så kan det även konstateras att det fungerar att använda olikhetsmått för att upptäcka skillnader i handovermönster, dessutom så finns det förslag på några lämpliga olikhetsmått.
健資, 谷岡 y Kensuke Tanioka. "Constrained analysis of asymmetric dissimilarity data by using both MDS and clustering". Thesis, https://doors.doshisha.ac.jp/opac/opac_link/bibid/BB12970687/?lang=0, 2016. https://doors.doshisha.ac.jp/opac/opac_link/bibid/BB12970687/?lang=0.
Texto completoIn this paper, we dealt with constrained analysis of asymmetric dissimilarity data by using MDS and clustering. As a feature of these methods, these models describe not asymmetric relations between objects but those between clusters based on various models. Concretely, we proposed four kinds of constrained asymmetric methods based on Unfolding, slide-vector model, hill-climbing model and radius model, respectively. In addition to that, relations between these methods are also shown based on these objective functions.
博士(文化情報学)
Doctor of Culture and Information Science
同志社大学
Doshisha University
Weil, Shawn Aaron. "The impact of perceptual dissimilarity on the perception of foreign accented speech". The Ohio State University, 2003. http://rave.ohiolink.edu/etdc/view?acc_num=osu1068481600.
Texto completoSnyman, Andries. "Service-learning and experiential learning as forms of experiential education : similarities and dissimilarities". Journal for New Generation Sciences, Vol 3, Issue 1: Central University of Technology, Free State, Bloemfontein, 2005. http://hdl.handle.net/11462/473.
Texto completoIn 2003 is vier technikons genooi om deel te neem aan die "Community Higher Education Service Partnership" (CHESP) inisiatief van die "Joint Education Trust" (JET). Die doel is om diens-leer modules oor verskeie dissiplines heen te ontwikkel en op die wyse technikons meer effektief betrokke te kry by gemeenskapsontwikkeling en die kapasiteitsbou van gemeenskapsleiers, akademici en deelnemers uit die dienste sektor. Technikons neig om diens-leer te identifiseer met hulle praktyk van ervaringsleer. Die doel van die artikel is om die neiging aan te spreek deur te wys op die ooreenkomste en verskille tussen die twee vorme van leer, en wel op basis van Andrew Furco (1996) se analise van ervaringsonderwys. Hoewel daar sekere ooreenkomste tussen diens-leer en ervaringsleer bestaan, plaas die verskille hulle op twee onderskeie punte van Furco se kontinuum vir ervaringsonderwys. Met die oog op die suksesvolle implementering van diens-leer deur technikons is dit noodsaaklik dat akademici en rolspelers uit die gemeenskap hierdie ooreenkomste en verskille verstaan.
Ekladious, George S. Eskander. "A dissimilarity representation approach to designing systems for signature verification and bio-cryptography". Mémoire, École de technologie supérieure, 2014. http://espace.etsmtl.ca/1326/1/EKLADIOUS_George_S._Eskander.pdf.
Texto completoAspiras, Olivia G. "Regulatory Fit of Social Comparison Information: Similarity versus Dissimilarity to Health Role Models". University of Toledo / OhioLINK, 2016. http://rave.ohiolink.edu/etdc/view?acc_num=toledo1481120129818667.
Texto completoBarnett, Michael Antonio. "Intra-racial relations among blacks in the United States: dissimilarities, partnerships, and common identities". FIU Digital Commons, 1997. http://digitalcommons.fiu.edu/etd/1400.
Texto completoBaudrier, Etienne Ruan Su. "Comparaison d'images binaires reposant sur une mesure locale des dissimilarités Application à la classification /". Reims : S.C.D. de l'Université, 2005. http://scdurca.univ-reims.fr/exl-doc/GED00000305.pdf.
Texto completoNimpfer, John Adam. "The Self-Evaluation Maintenance Model as a Moderator of Similarity-Attraction Vs Dissimilarity-Repulsion". W&M ScholarWorks, 1997. https://scholarworks.wm.edu/etd/1539626145.
Texto completoPegg, Samantha. "Child on child killing : societal and legal similarities and dissimilarities, 1840-1890 and 1950-2000". Thesis, Nottingham Trent University, 2007. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.441453.
Texto completoBouthillon, Marine. "Dispositif de discrimination entre des micro-organismes et leur environnement pour une détection précoce". Thesis, Strasbourg, 2016. http://www.theses.fr/2016STRAD005.
Texto completoAn acquisition system and its algorithm are designed. Their purpose is contaminants detection as quality control in pharmaceutical industry. Contaminants are colonies of micro-organisms growing on micro-porous membrane. We use 3D surface measurement, which has never been done in a microbiological context. In addition, our contribution is to use an LED based lighting instead of a laser. It leads to an important noise reduction. It allows to decrease micro-organisms incubation period from 14 days in current method to 5 days or less. The height map from the system are processed with an outlier detection method combined to a support vector machine. Colonies show varying and various signals, and artifacts are present in the data. Nevertheless, we have been able to detect with success the presence or absence of contaminants with a rate of 98%
Oosterhof, Atze. "Better together antecedents and consequences of perceived expertise dissimilarity and perceived expertise complementarity in teams /". [S.l. : [Groningen : s.n.] ; University Library Groningen] [Host], 2008. http://irs.ub.rug.nl/ppn/.
Texto completoOrtín, Nadal Anna Pilar. "Mental activity in Descartes' causal-semantic model of sensory perception". Thesis, University of Edinburgh, 2018. http://hdl.handle.net/1842/31538.
Texto completoOhmer, Whitney S. "Generational Differences in the Workplace: How Does Dissimilarity Affect the Different Generations in Relation to Work Teams?" Xavier University / OhioLINK, 2014. http://rave.ohiolink.edu/etdc/view?acc_num=xavier1421852575.
Texto completoBuchta, Christian, Martin Kober, Ingo Feinerer y Kurt Hornik. "Spherical k-Means Clustering". American Statistical Association, 2012. http://epub.wu.ac.at/4000/1/paper.pdf.
Texto completoCoombes, Caitlin E. "Validation of clustering solutions for clinical data through biologically meaningful simulations and mixed-distance dissimilarity methods". The Ohio State University, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=osu1584957936561871.
Texto completo