Search results for "Network science"
showing 10 items of 103 documents
Contrasting Automatic and Manual Group Formation: A Case Study in a Software Engineering Postgraduate Course
2021
This paper proposes the comparison of a group formation approach based on an evolutionary algorithm with a manual approach performed by an instructor with ten years of experience on this task. The groups were created based on the professional, psychological, and experience profile of each student. The results obtained demonstrated the algorithm’s potential, reaching an average similarity of \(83.46\%\) with the groups formed manually by the instructor.
Optimisation des requêtes de similarité dans les espaces métriques répondant aux besoins des usagers
2012
The complexity of data stored in large databases has increased at very fast paces. Hence, operations more elaborated than traditional queries are essential in order to extract all required information from the database. Therefore, the interest of the database community in similarity search has increased significantly. Two of the well-known types of similarity search are the Range (Rq) and the k-Nearest Neighbor (kNNq) queries, which, as any of the traditional ones, can be sped up by indexing structures of the Database Management System (DBMS). Another way of speeding up queries is to perform query optimization. In this process, metrics about data are collected and employed to adjust the par…
Overlapping Community Structure in Co-authorship Networks: A Case Study
2014
Community structure is one of the key properties of real-world complex networks. It plays a crucial role in their behaviors and topology. While an important work has been done on the issue of community detection, very little attention has been devoted to the analysis of the community structure. In this paper, we present an extensive investigation of the overlapping community network deduced from a large-scale co-authorship network. The nodes of the overlapping community network represent the functional communities of the co-authorship network, and the links account for the fact that communities share some nodes in the co-authorship network. The comparative evaluation of the topological prop…
Usage of HMM-Based Speech Recognition Methods for Automated Determination of a Similarity Level Between Languages
2019
The problem of automated determination of language similarity (or even defining of a distance on the space of languages) could be solved in different ways – working with phonetic transcriptions, with speech recordings or both of them. For the recordings, we propose and test a HMM-based one: in the first part of our article we successfully try language detection, afterwards we are trying to calculate distances between HMM-based models, using different metrics and divergences. The Kullback-Leibler divergence is the only one we got good results with – it means that the calculated distances between languages correspond to analytical understanding of similarity between them. Even if it does not …
Using Chemical Structural Indicators for Periodic Classification of Local Anaesthetics
2011
Algorithms for classification and taxonomy based on criteria as information entropy and its production are proposed. Some local anaesthetics, currently in use, are classified using five characteristic chemical properties of different portions of their molecules. Many classification algorithms are based on information entropy. When applying the procedures to sets of moderate size, an excessive number of results appear compatible with data and the number suffers a combinatorial explosion. However, after the equipartition conjecture one has a selection criterion between different variants resulting from classification between hierarchical trees. Information entropy and principal component anal…
Effects of morphometric descriptor changes on statistical classification and morphospaces
2004
Ten morphometric descriptors (five pairs of form and shape parameters) are used to describe the complex morphology of the first lower molar of two morphologically similar species, Microtus arvalis and M. agrestis. These descriptors are derived either from linear measurements or from outline analysis. The effects of these different descriptors on classical analysis as used in biology or palaeobiology are explored. First, the reliability of results in statistical classification is assessed. All of the descriptors discriminate well between the two species. The initial morphometric scheme (linear or outline) does not induce marked differences in statistical classification and the major discrepa…
Assessment of the probabilities for evolutionary structural changes in protein folds.
2007
Abstract Motivation: The evolution of protein sequences can be described by a stepwise process, where each step involves changes of a few amino acids. In a similar manner, the evolution of protein folds can be at least partially described by an analogous process, where each step involves comparatively simple changes affecting few secondary structure elements. A number of such evolution steps, justified by biologically confirmed examples, have previously been proposed by other researchers. However, unlike the situation with sequences, as far as we know there have been no attempts to estimate the comparative probabilities for different kinds of such structural changes. Results: We have tried …
Graph-based exploration and clustering analysis of semantic spaces
2019
Abstract The goal of this study is to demonstrate how network science and graph theory tools and concepts can be effectively used for exploring and comparing semantic spaces of word embeddings and lexical databases. Specifically, we construct semantic networks based on word2vec representation of words, which is “learnt” from large text corpora (Google news, Amazon reviews), and “human built” word networks derived from the well-known lexical databases: WordNet and Moby Thesaurus. We compare “global” (e.g., degrees, distances, clustering coefficients) and “local” (e.g., most central nodes and community-type dense clusters) characteristics of considered networks. Our observations suggest that …
Movie Script Similarity Using Multilayer Network Portrait Divergence
2020
International audience; This paper addresses the question of movie similarity through multilayer graph similarity measures. Recent work has shown how to construct multilayer networks using movie scripts, and how they capture different aspects of the stories. Based on this modeling, we propose to rely on the multilayer structure and compute different similarities, so we may compare movies, not from their visual content, summary, or actors, but actually from their own storyboard. We propose to do so using “portrait divergence”, which has been recently introduced to compute graph distances from summarizing graph characteristics. We illustrate our approach on the series of six Star Wars movies.
Top-k String Similarity Joins
2020
Top-k joins have been extensively studied in relational databases as ranking operations when every object has, among others, at least one ranking attribute. However, the focus has mostly been the case when the join attributes are of primitive data types (e.g., numerical values) and the join predicate is equality. In this work, we consider string objects assigned such ranking attributes or simply scores. Given two collection of string objects and a string similarity measure (e.g., the Edit distance), we introduce the top-k string similarity join () which returns k sufficiently similar pairs of objects with respect to a similarity threshold ϵ, which have the highest combined score computed by…