To see the other types of publications on this topic, follow the link: String similarity measure.

Journal articles on the topic 'String similarity measure'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'String similarity measure.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Revesz, Peter Z. "A Tiling Algorithm-Based String Similarity Measure." WSEAS TRANSACTIONS ON COMPUTER RESEARCH 9 (August 10, 2021): 109–12. http://dx.doi.org/10.37394/232018.2021.9.13.

Full text
Abstract:
This paper describes a similarity measure for strings based on a tiling algorithm. The algorithm is applied to a pair of proteins that are described by their respective amino acid sequences. The paper also describes how the algorithm can be used to find highly conserved amino acid sequences and examples of horizontal gene transfer between different species
APA, Harvard, Vancouver, ISO, and other styles
2

Al-Bakry, Abbas, and Marwa Al-Rikaby. "Enhanced Levenshtein Edit Distance Method functioning as a String-to-String Similarity Measure." Iraqi Journal for Computers and Informatics 42, no. 1 (2016): 48–54. http://dx.doi.org/10.25195/ijci.v42i1.83.

Full text
Abstract:
Levenshtein is a Minimum Edit Distance method; it is usually used in spell checking applications for generatingcandidates. The method computes the number of the required edit operations to transform one string to another and it canrecognize three types of edit operations: deletion, insertion, and substitution of one letter. Damerau modified the Levenshteinmethod to consider another type of edit operations, the transposition of two adjacent letters, in addition to theconsidered three types. However, the modification suffers from the time complexity which was added to the original quadratictime
APA, Harvard, Vancouver, ISO, and other styles
3

Sakunthala Prabha, K. S., C. Mahesh, and S. P. Raja. "An Enhanced Semantic Focused Web Crawler Based on Hybrid String Matching Algorithm." Cybernetics and Information Technologies 21, no. 2 (2021): 105–20. http://dx.doi.org/10.2478/cait-2021-0022.

Full text
Abstract:
Abstract Topic precise crawler is a special purpose web crawler, which downloads appropriate web pages analogous to a particular topic by measuring cosine similarity or semantic similarity score. The cosine based similarity measure displays inaccurate relevance score, if topic term does not directly occur in the web page. The semantic-based similarity measure provides the precise relevance score, even if the synonyms of the given topic occur in the web page. The unavailability of the topic in the ontology produces inaccurate relevance score by the semantic focused crawlers. This paper overcome
APA, Harvard, Vancouver, ISO, and other styles
4

Rakhmawati, Nur Aini, and Miftahul Jannah. "Food Ingredients Similarity Based on Conceptual and Textual Similarity." Halal Research Journal 1, no. 2 (2021): 87–95. http://dx.doi.org/10.12962/j22759970.v1i2.107.

Full text
Abstract:
Open Food Facts provides a database of food products such as product names, compositions, and additives, where everyone can contribute to add the data or reuse the existing data. The open food facts data are dirty and needs to be processed before storing the data to our system. To reduce redundancy in food ingredients data, we measure the similarity of ingredient food using two similarities: the conceptual similarity and textual similarity. The conceptual similarity measures the similarity between the two datasets by its word meaning (synonym), while the textual similarity is based on fuzzy st
APA, Harvard, Vancouver, ISO, and other styles
5

Znamenskij, Sergej Vital'evich. "Stable assessment of the quality of similarity algorithms of character strings and their normalizations." Program Systems: Theory and Applications 9, no. 4 (2018): 561–78. http://dx.doi.org/10.25209/2079-3316-2018-9-4-561-578.

Full text
Abstract:
The choice of search tools for hidden commonality in the data of a new nature requires stable and reproducible comparative assessments of the quality of abstract algorithms for the proximity of symbol strings. Conventional estimates based on artificially generated or manually labeled tests vary significantly, rather evaluating the method of this artificial generation with respect to similarity algorithms, and estimates based on user data cannot be accurately reproduced. A simple, transparent, objective and reproducible numerical quality assessment of a string metric. Parallel texts of book tra
APA, Harvard, Vancouver, ISO, and other styles
6

Setiawan, Rudi. "Similarity Checking Similarity Checking of Source Code Module Using Running Karp Rabin Greedy String Tiling." Science Proceedings Series 1, no. 2 (2019): 43–46. http://dx.doi.org/10.31580/sps.v1i2.624.

Full text
Abstract:

 
 
 Similarity checking of source code module, required a long process if it is done manually. Based on that problem, this research designed a software with structure-based approach using string matching technique with Running Karp-Rabin Greedy String Tiling (RKR-GST) Algorithm to check the similarity and using Dice Coefficient method to measure the level of similarity from 2 results source code modules.
 
 
 
 The result of the experiments show that RKRGST which applied in this system capable of recognizing the changing of statement and the changing statem
APA, Harvard, Vancouver, ISO, and other styles
7

RODRIGUEZ, WLADIMIR, MARK LAST, ABRAHAM KANDEL, and HORST BUNKE. "GEOMETRIC APPROACH TO DATA MINING." International Journal of Image and Graphics 01, no. 02 (2001): 363–86. http://dx.doi.org/10.1142/s0219467801000220.

Full text
Abstract:
In this paper, a new, geometric approach to pattern identification in data mining is presented. It is based on applying string edit distance computation to measuring the similarity between multi-dimensional curves. The string edit distance computation is extended to allow the possibility of using strings, where each element is a vector rather than just a symbol. We discuss an approach for representing 3D-curves using the curvature and the tension as their symbolic representation. This transformation preserves all the information contained in the original 3D-curve. We validate this approach thr
APA, Harvard, Vancouver, ISO, and other styles
8

Samanta, Soumitra, Steve O’Hagan, Neil Swainston, Timothy J. Roberts, and Douglas B. Kell. "VAE-Sim: A Novel Molecular Similarity Measure Based on a Variational Autoencoder." Molecules 25, no. 15 (2020): 3446. http://dx.doi.org/10.3390/molecules25153446.

Full text
Abstract:
Molecular similarity is an elusive but core “unsupervised” cheminformatics concept, yet different “fingerprint” encodings of molecular structures return very different similarity values, even when using the same similarity metric. Each encoding may be of value when applied to other problems with objective or target functions, implying that a priori none are “better” than the others, nor than encoding-free metrics such as maximum common substructure (MCSS). We here introduce a novel approach to molecular similarity, in the form of a variational autoencoder (VAE). This learns the joint distribut
APA, Harvard, Vancouver, ISO, and other styles
9

Zhu, Jin, Dayu Cheng, Weiwei Zhang, Ci Song, Jie Chen, and Tao Pei. "A New Approach to Measuring the Similarity of Indoor Semantic Trajectories." ISPRS International Journal of Geo-Information 10, no. 2 (2021): 90. http://dx.doi.org/10.3390/ijgi10020090.

Full text
Abstract:
People spend more than 80% of their time in indoor spaces, such as shopping malls and office buildings. Indoor trajectories collected by indoor positioning devices, such as WiFi and Bluetooth devices, can reflect human movement behaviors in indoor spaces. Insightful indoor movement patterns can be discovered from indoor trajectories using various clustering methods. These methods are based on a measure that reflects the degree of similarity between indoor trajectories. Researchers have proposed many trajectory similarity measures. However, existing trajectory similarity measures ignore the ind
APA, Harvard, Vancouver, ISO, and other styles
10

Sabarish, B. A., Karthi R., and Gireesh Kumar T. "String-Based Feature Representation for Trajectory Clustering." International Journal of Embedded and Real-Time Communication Systems 10, no. 2 (2019): 1–18. http://dx.doi.org/10.4018/ijertcs.2019040101.

Full text
Abstract:
A trajectory is the spatial trail of a moving object as a function of time. All moving objects such as humans, robots, cloud, taxis, animals, mobile phones generate trajectories. Trajectory clustering is grouping of trajectories that have similar moving patterns, and the formed clusters depend on feature representation, similarity metrics, and clustering algorithm used. In this article, trajectory features are generated after mapping trajectories onto grids, as this smoothens the variations that occur in spatial coordinates. These variations occur due to differences in how GPS points at varyin
APA, Harvard, Vancouver, ISO, and other styles
11

Qiu, Dehong, Jialin Sun, and Hao Li. "Improving Similarity Measure for Java Programs Based on Optimal Matching of Control Flow Graphs." International Journal of Software Engineering and Knowledge Engineering 25, no. 07 (2015): 1171–97. http://dx.doi.org/10.1142/s0218194015500229.

Full text
Abstract:
Measuring program similarity plays an important role in solving many problems in software engineering. However, because programs are instruction sequences with complex structures and semantic functions and furthermore, programs may be obfuscated deliberately through semantics-preserving transformations, measuring program similarity is a difficult task that has not been adequately addressed. In this paper, we propose a new approach to measuring Java program similarity. The approach first measures the low-level similarity between basic blocks according to the bytecode instruction sequences and t
APA, Harvard, Vancouver, ISO, and other styles
12

LYRAS, DIMITRIOS P., KYRIAKOS N. SGARBAS, and NIKOLAOS D. FAKOTAKIS. "APPLYING SIMILARITY MEASURES FOR AUTOMATIC LEMMATIZATION: A CASE STUDY FOR MODERN GREEK AND ENGLISH." International Journal on Artificial Intelligence Tools 17, no. 05 (2008): 1043–64. http://dx.doi.org/10.1142/s021821300800428x.

Full text
Abstract:
This paper addresses the problem of automatic induction of the normalized form (lemma) of regular and mildly irregular words with no direct supervision using language-independent algorithms. More specifically, two string distance metric models (i.e. the Levenshtein Edit Distance algorithm and the Dice Coefficient similarity measure) were employed in order to deal with the automatic word lemmatization task by combining two alignment models based on the string similarity and the most frequent inflectional suffixes. The performance of the proposed model has been evaluated quantitatively and quali
APA, Harvard, Vancouver, ISO, and other styles
13

Ibrahim, Arsmah, Zainab Abu Bakar, Nuru’l–‘Izzah Othman, and Nor Fuzaina Ismail. "Assessing the Line-By-Line Marking Performance of n-Gram String Similarity Method." Scientific Research Journal 6, no. 1 (2009): 15. http://dx.doi.org/10.24191/srj.v6i1.5636.

Full text
Abstract:
Manual marking of free-response solutions in mathematics assessments is very demanding in terms of time and effort. Available software equipped with automated marking features to mark open-ended questions has very limited capabilities. In most cases the marking process focuses on the final answer only. Few available software are capable of marking the intermediate steps as is norm in manual marking. This paper discusses the line-by-line marking performance of the n_gram string similarity method using the Dice coefficient as means to measure similarity. The marks awarded by the automated markin
APA, Harvard, Vancouver, ISO, and other styles
14

WANG, SHENG, and WEI-MOU ZHENG. "CLePAPS: FAST PAIR ALIGNMENT OF PROTEIN STRUCTURES BASED ON CONFORMATIONAL LETTERS." Journal of Bioinformatics and Computational Biology 06, no. 02 (2008): 347–66. http://dx.doi.org/10.1142/s0219720008003461.

Full text
Abstract:
Fast, efficient, and reliable algorithms for pairwise alignment of protein structures are in ever-increasing demand for analyzing the rapidly growing data on protein structures. CLePAPS is a tool developed for this purpose. It distinguishes itself from other existing algorithms by the use of conformational letters, which are discretized states of 3D segmental structural states. A letter corresponds to a cluster of combinations of the three angles formed by Cα pseudobonds of four contiguous residues. A substitution matrix called CLESUM is available to measure the similarity between any two such
APA, Harvard, Vancouver, ISO, and other styles
15

Son, Nguyen Van, Le Thanh Huong, and Nguyen Chi Thanh. "A two-phase plagiarism detection system based on multi-layer long short-term memory networks." IAES International Journal of Artificial Intelligence (IJ-AI) 10, no. 3 (2021): 636. http://dx.doi.org/10.11591/ijai.v10.i3.pp636-648.

Full text
Abstract:
Finding plagiarism strings between two given documents are the main task of the plagiarism detection problem. Traditional approaches based on string matching are not very useful in cases of similar semantic plagiarism. Deep learning approaches solve this problem by measuring the semantic similarity between pairs of sentences. However, these approaches still face the following challenging points. First, it is impossible to solve cases where only part of a sentence belongs to a plagiarism passage. Second, measuring the sentential similarity without considering the context of surrounding sentence
APA, Harvard, Vancouver, ISO, and other styles
16

TSAY, YIH-TAY, and WEN-HSIANG TSAI. "MODEL-GUIDED ATTRIBUTED STRING MATCHING BY SPLIT-AND-MERGE FOR SHAPE RECOGNITION." International Journal of Pattern Recognition and Artificial Intelligence 03, no. 02 (1989): 159–79. http://dx.doi.org/10.1142/s0218001489000140.

Full text
Abstract:
Due to noise and distortion, segmentation uncertainty is a key problem in structural pattern analysis. In this paper we propose the use of the split operation for shape recognition by attributed string matching. After illustrating the disadvantage of attributed string matching using the merge operation, the split operation is proposed. Under the guidance of the model shape, an input shape can be reapproximated, using the split operation, into a new attributed string representation. By combining the split and the merge operations for shape matching it is unnecessary to apply any type of edit op
APA, Harvard, Vancouver, ISO, and other styles
17

Putra, Pandu Pratama, Afriansyah Afriansyah, and Muhammad Syaifullah. "Pendeteksi Kesamaan Dokumen pada Sistem Informasi Pendaftaran Proposal Skripsi dengan Pendekatan Algoritma Rabin-Karp." INTECOMS: Journal of Information Technology and Computer Science 2, no. 1 (2019): 40–47. http://dx.doi.org/10.31539/intecoms.v2i1.738.

Full text
Abstract:
Plagiarism is a significant problem in many areas, including universities. plagiarism is usually performed on digital content is to copy-paste of the original document. To anticipate, we need a way to analyze the technique of plagiarism. There are several approaches that can be taken, for example by using a search algorithm Rabin-Karp string because these algorithms can be used to detect plagiarism in a text document. In the testing phase, the test documents used were three documents with similarity level categories of low, medium and high. From some of the testing that has been done, this app
APA, Harvard, Vancouver, ISO, and other styles
18

CHALI, YLLIAS, and SADID A. HASAN. "Query-focused multi-document summarization: automatic data annotations and supervised learning approaches." Natural Language Engineering 18, no. 1 (2011): 109–45. http://dx.doi.org/10.1017/s1351324911000167.

Full text
Abstract:
AbstractIn this paper, we apply different supervised learning techniques to build query-focused multi-document summarization systems, where the task is to produce automatic summaries in response to a given query or specific information request stated by the user. A huge amount of labeled data is a prerequisite for supervised training. It is expensive and time-consuming when humans perform the labeling task manually. Automatic labeling can be a good remedy to this problem. We employ five different automatic annotation techniques to build extracts from human abstracts using ROUGE, Basic Element
APA, Harvard, Vancouver, ISO, and other styles
19

Pratama, Zudha, Ema Utami, and M. Rudyanto Arief. "Analisa Perbandingan Jenis N-GRAM Dalam Penentuan Similarity Pada Deteksi Plagiat." Creative Information Technology Journal 4, no. 4 (2019): 254. http://dx.doi.org/10.24076/citec.2017v4i4.118.

Full text
Abstract:
Dampak.akses informasi yang mudah membuat tindakan plagiasi makin marak. Tindakan tersebut dapat dicegah dengan menggunakan sistem deteksi plagiat. Sistem tersebut dapat dibangun dengan menggunakan konsep similarity dengan algoritma rabin-karp sebagai string matchingnya dan n-gram sebagai metode parsingnya. Penelitian terdahulu menggunakan kedua algoritma tersebut menunjukkan hasil sistem yang cukup baik untuk deteksi plagiat. Kemudian hasil penelitian dari luar negeri ada yang melakukan hal serupa mengenai deteksi plagiat serta menghasilkan penemuan baru misalnya cross-language similarity. Se
APA, Harvard, Vancouver, ISO, and other styles
20

Kuang, Teo Poh, Hamidah Ibrahim, Fatimah Sidi, Nur Izura Udzir, and Ali A. Alwan. "An Effective Naming Heterogeneity Resolution for XACML Policy Evaluation in a Distributed Environment." Symmetry 13, no. 12 (2021): 2394. http://dx.doi.org/10.3390/sym13122394.

Full text
Abstract:
Policy evaluation is a process to determine whether a request submitted by a user satisfies the access control policies defined by an organization. Naming heterogeneity between the attribute values of a request and a policy is common due to syntactic variations and terminological variations, particularly among organizations of a distributed environment. Existing policy evaluation engines employ a simple string equal matching function in evaluating the similarity between the attribute values of a request and a policy, which are inaccurate, since only exact match is considered similar. This work
APA, Harvard, Vancouver, ISO, and other styles
21

MOHRI, MEHRYAR. "EDIT-DISTANCE OF WEIGHTED AUTOMATA: GENERAL DEFINITIONS AND ALGORITHMS." International Journal of Foundations of Computer Science 14, no. 06 (2003): 957–82. http://dx.doi.org/10.1142/s0129054103002114.

Full text
Abstract:
The problem of computing the similarity between two sequences arises in many areas such as computational biology and natural language processing. A common measure of the similarity of two strings is their edit-distance, that is the minimal cost of a series of symbol insertions, deletions, or substitutions transforming one string into the other. In several applications such as speech recognition or computational biology, the objects to compare are distributions over strings, i.e., sets of strings representing a range of alternative hypotheses with their associated weights or probabilities. We d
APA, Harvard, Vancouver, ISO, and other styles
22

SAKAKIBARA, YASUBUMI, KRIS POPENDORF, NANA OGAWA, KIYOSHI ASAI, and KENGO SATO. "STEM KERNELS FOR RNA SEQUENCE ANALYSES." Journal of Bioinformatics and Computational Biology 05, no. 05 (2007): 1103–22. http://dx.doi.org/10.1142/s0219720007003028.

Full text
Abstract:
Several computational methods based on stochastic context-free grammars have been developed for modeling and analyzing functional RNA sequences. These grammatical methods have succeeded in modeling typical secondary structures of RNA, and are used for structural alignment of RNA sequences. However, such stochastic models cannot sufficiently discriminate member sequences of an RNA family from nonmembers and hence detect noncoding RNA regions from genome sequences. A novel kernel function, stem kernel, for the discrimination and detection of functional RNA sequences using support vector machines
APA, Harvard, Vancouver, ISO, and other styles
23

Pinaire, Jessica, Etienne Chabert, Jérôme Azé, Sandra Bringay, and Paul Landais. "Sequential Pattern Mining to Predict Medical In-Hospital Mortality from Administrative Data: Application to Acute Coronary Syndrome." Journal of Healthcare Engineering 2021 (May 25, 2021): 1–12. http://dx.doi.org/10.1155/2021/5531807.

Full text
Abstract:
Prediction of a medical outcome based on a trajectory of care has generated a lot of interest in medical research. In sequence prediction modeling, models based on machine learning (ML) techniques have proven their efficiency compared to other models. In addition, reducing model complexity is a challenge. Solutions have been proposed by introducing pattern mining techniques. Based on these results, we developed a new method to extract sets of relevant event sequences for medical events’ prediction, applied to predict the risk of in-hospital mortality in acute coronary syndrome (ACS). From the
APA, Harvard, Vancouver, ISO, and other styles
24

Birkenes, Magnus Breder, and Jürg Fleischer. "Syntactic vs. phonological areas: A quantitative perspective on Hessian dialects." Journal of Linguistic Geography 9, no. 2 (2021): 142–61. http://dx.doi.org/10.1017/jlg.2021.9.

Full text
Abstract:
AbstractThis paper takes a quantitative perspective on data from the project Syntax hessischer Dialekte (SyHD), covering dialects in the German state of Hesse, an area with rich dialectal variation. Many previous dialectometric analyses abstracted away from intralocal variation (e.g., by only counting the most frequent variant at a location). In contrast, we do justice to intralocal variation by taking into account local frequency relations. The study shows that the border between Low German and Central German—one of the most important isoglosses in German dialectology—is not relevant for synt
APA, Harvard, Vancouver, ISO, and other styles
25

Gali, Najlah, Radu Mariescu-Istodor, Damien Hostettler, and Pasi Fränti. "Framework for syntactic string similarity measures." Expert Systems with Applications 129 (September 2019): 169–85. http://dx.doi.org/10.1016/j.eswa.2019.03.048.

Full text
APA, Harvard, Vancouver, ISO, and other styles
26

Flower, Darren R. "On the Properties of Bit String-Based Measures of Chemical Similarity." Journal of Chemical Information and Computer Sciences 38, no. 3 (1998): 379–86. http://dx.doi.org/10.1021/ci970437z.

Full text
APA, Harvard, Vancouver, ISO, and other styles
27

El-ghafar, Randa Mohamed Abd, Ali H. El-Bastawissy, Eman S. Nasr, and Mervat H. Gheith. "An Effective Entity Resolution Approach for Big Data." International Journal of Innovative Technology and Exploring Engineering 10, no. 11 (2021): 100–112. http://dx.doi.org/10.35940/ijitee.k9503.09101121.

Full text
Abstract:
Entity Resolution (ER) is defined as the process 0f identifying records/ objects that correspond to real-world objects/ entities. To define a good ER approach, the schema of the data should be well-known. In addition, schema alignment of multiple datasets is not an easy task and may require either domain expert or ML algorithm to select which attributes to match. Schema agnostic meta-blocking tries to solve such a problem by considering each token as a blocking key regardless of the attributes it appears in. It may also be coupled with meta-blocking to reduce the number of false negatives. How
APA, Harvard, Vancouver, ISO, and other styles
28

ARDILA, YOAN JOSÉ PINZÓN, RAPHAËL CLIFFORD, COSTAS S. ILIOPOULOS, GAD M. LANDAU, and MANAL MOHAMED. "NECKLACE SWAP PROBLEM FOR RHYTHMIC SIMILARITY MEASURES." International Journal of Computational Methods 05, no. 03 (2008): 351–63. http://dx.doi.org/10.1142/s0219876208001583.

Full text
Abstract:
Given two n-bit (cyclic) binary strings, A and B, represented on a circle (necklace instances), let each sequence have the same number (k) of 1's. We are interested in computing the cyclic swap distance between A and B, i.e. the minimum number of swaps needed to convert A to B, minimized over all possible rotations of B. We show that, given the compressed representation of A and B, this distance may be computed in O(k2).
APA, Harvard, Vancouver, ISO, and other styles
29

Egghe, L., and C. Michel. "Strong similarity measures for ordered sets of documents in information retrieval." Information Processing & Management 38, no. 6 (2002): 823–48. http://dx.doi.org/10.1016/s0306-4573(01)00051-6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
30

Jerman-Blažič, Borka, and Milan Randić. "Similarity measures for sets of strings and application in chemical classification." Journal of Mathematical Chemistry 4, no. 1 (1990): 217–25. http://dx.doi.org/10.1007/bf01170014.

Full text
APA, Harvard, Vancouver, ISO, and other styles
31

Zhang, Jin, and Marcia Lei Zeng. "A new similarity measure for subject hierarchical structures." Journal of Documentation 70, no. 3 (2014): 364–91. http://dx.doi.org/10.1108/jd-12-2012-0160.

Full text
Abstract:
Purpose – The purpose of this paper is to introduce a new similarity method to gauge the differences between two subject hierarchical structures. Design/methodology/approach – In the proposed similarity measure, nodes on two hierarchical structures are projected onto a two-dimensional space, respectively, and both structural similarity and subject similarity of nodes are considered in the similarity between the two hierarchical structures. The extent to which the structural similarity impacts on the similarity can be controlled by adjusting a parameter. An experiment was conducted to evaluate
APA, Harvard, Vancouver, ISO, and other styles
32

Wu, Shuangyuan, Shihong Xia, Zhaoqi Wang, and Chunpeng Li. "Efficient motion data indexing and retrieval with local similarity measure of motion strings." Visual Computer 25, no. 5-7 (2009): 499–508. http://dx.doi.org/10.1007/s00371-009-0345-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
33

Tsuruoka, Y., J. McNaught, J. ;c Tsujii, and S. Ananiadou. "Learning string similarity measures for gene/protein name dictionary look-up using logistic regression." Bioinformatics 23, no. 20 (2007): 2768–74. http://dx.doi.org/10.1093/bioinformatics/btm393.

Full text
APA, Harvard, Vancouver, ISO, and other styles
34

ICHISE, RYUTARO. "AN ANALYSIS OF MULTIPLE SIMILARITY MEASURES FOR ONTOLOGY MAPPING PROBLEM." International Journal of Semantic Computing 04, no. 01 (2010): 103–22. http://dx.doi.org/10.1142/s1793351x1000095x.

Full text
Abstract:
This paper presents an analysis of similarity measures for the ontology mapping problem. To that end, 48 similarity measures such as string matching and knowledge based similarities that have been widely used in ontology mapping systems are defined. The similarity measures are investigated by discriminant analysis with a real-world data set. As a result, it was possible to identify 22 effective similarity measures for the ontology mapping problem out of 48 possible similarity measures. The identified measures have a wide variety in the type of similarity. To test whether the identified similar
APA, Harvard, Vancouver, ISO, and other styles
35

Revesz, Peter Z. "A Comparative Analysis of Motifs from Minoan and Hungarian Folk Art." MATEC Web of Conferences 210 (2018): 05020. http://dx.doi.org/10.1051/matecconf/201821005020.

Full text
Abstract:
This paper presents a similarity measure for motives. The similarity measure is applied to several ceramic and metal artifacts that contain spiral motives. The similarity measure shows a particularly strong similarity between some Minoan and Hungarian ceramics.
APA, Harvard, Vancouver, ISO, and other styles
36

Rahal, Imad, and Colin Wielga. "Source Code Plagiarism Detection Using Biological String Similarity Algorithms." Journal of Information & Knowledge Management 13, no. 03 (2014): 1450028. http://dx.doi.org/10.1142/s0219649214500282.

Full text
Abstract:
Source code plagiarism is easy to commit but difficult to catch. Many approaches have been proposed in the literature to automate its detection; however there is little consensus on what works best. In this paper, we propose two new measures for determining the accuracy of a given technique and describe an approach to convert code files into strings which can then be compared for similarity in order to detect plagiarism. We then compare several string comparison techniques, heavily utilised in the area of biological sequence alignment, and compare their performance on a large collection of stu
APA, Harvard, Vancouver, ISO, and other styles
37

Escobar, Marco A., José R. Guzmán Sepúlveda, Jorge R. Parra Michel, and Rafael Guzmán Cabrera. "A proposal to measure the similarity between retinal vessel segmentations images." Nova Scientia 11, no. 22 (2019): 224–45. http://dx.doi.org/10.21640/ns.v11i22.1872.

Full text
Abstract:
Introduction: We propose a novel approach for the assessment of the similarity of retinal vessel segmentation images that is based on linking the standard performance metrics of a segmentation algorithm, with the actual structural properties of the images through the fractal dimension.Method: We apply our methodology to compare the vascularity extracted by automatic segmentation against manually segmented images.Results: We demonstrate that the strong correlation between the standard metrics and fractal dimension is preserved regardless of the size of the subimages analyzed.Discussion or Concl
APA, Harvard, Vancouver, ISO, and other styles
38

Yang, Jie, Wei Zhou, and Shuai Li. "Similarity measure for multi-granularity rough approximations of vague sets." Journal of Intelligent & Fuzzy Systems 40, no. 1 (2021): 1609–21. http://dx.doi.org/10.3233/jifs-200611.

Full text
Abstract:
Vague sets are a further extension of fuzzy sets. In rough set theory, target concept can be characterized by different rough approximation spaces when it is a vague concept. The uncertainty measure of vague sets in rough approximation spaces is an important issue. If the uncertainty measure is not accurate enough, different rough approximation spaces of a vague concept may possess the same result, which makes it impossible to distinguish these approximation spaces for charactering a vague concept strictly. In this paper, this problem will be solved from the perspective of similarity. Firstly,
APA, Harvard, Vancouver, ISO, and other styles
39

Botto, C., A. Escalante, M. Arango, and L. Yarzabal. "Morphological differences between Venezuelan and African microfilariae of Onchocerca volvulus." Journal of Helminthology 62, no. 4 (1988): 345–51. http://dx.doi.org/10.1017/s0022149x00011755.

Full text
Abstract:
AbstractComparative morphological and biometric characteristics of microfilariae of Onchocerca gutturosa and O. volvulus from different geographical areas (Upper Orinoco, Venezuela; Togo; Liberia) were assessed. “Stepwise” discriminant analysis and Mahalanobis estimators were applied to measure distance between populations. The results indicate a strong similarity between the two strains from the Upper Orinoco (Venezuela) and the Togo strain, as well as a clear separation between these strains and that of O. gutturosa. The Liberian strain was easily distinguishable from microfilariae from Togo
APA, Harvard, Vancouver, ISO, and other styles
40

Tanskanen, Antti O., and Anna Rotkirch. "Sibling similarity and relationship quality in Finland." Acta Sociologica 62, no. 4 (2018): 440–56. http://dx.doi.org/10.1177/0001699318777042.

Full text
Abstract:
Siblings form the strongest horizontal family tie, which often involves life-long emotional closeness and various forms of support. Similarity is often assumed to strengthen sibling relations, but existing evidence is scarce and mixed. Using data from the Generational Transmissions in Finland surveys collected in 2012, we employ both total and sibling fixed-effect regressions and examine whether sibling similarity is associated with relationship quality in two family generations: an older generation born in 1945–1950, and the generation of their children, born in 1962–1993. We study sibling si
APA, Harvard, Vancouver, ISO, and other styles
41

Tuan, Tran Manh, Luong Thi Hong Lan, Shuo-Yan Chou, et al. "M-CFIS-R: Mamdani Complex Fuzzy Inference System with Rule Reduction Using Complex Fuzzy Measures in Granular Computing." Mathematics 8, no. 5 (2020): 707. http://dx.doi.org/10.3390/math8050707.

Full text
Abstract:
Complex fuzzy theory has strong practical background in many important applications, especially in decision-making support systems. Recently, the Mamdani Complex Fuzzy Inference System (M-CFIS) has been introduced as an effective tool for handling events that are not restricted to only values of a given time point but also include all values within certain time intervals (i.e., the phase term). In such decision-making problems, the complex fuzzy theory allows us to observe both the amplitude and phase values of an event, thus resulting in better performance. However, one of the limitations of
APA, Harvard, Vancouver, ISO, and other styles
42

Harvey, Andrew S., and Clarke Wilson. "Evolution of Daily Activity Patterns from 1971 to 1981: A Study of the Halifax Activity Panel Survey." Canadian Studies in Population 28, no. 2 (2001): 459. http://dx.doi.org/10.25336/p6bc8x.

Full text
Abstract:
Episode sequences from diaries are the richest source of information about daily activities of individuals and households available to social scientists. Their use has been advocated as an approach to urban planning that incorporates explicit consideration of the demands made by daily life on the built environment. The paper examines sequences of daily activities and activities augmented by data on their settings (including location and the presence of other people) to measure change in daily behaviour from 1971 to 1981. Diaries were supplied by respondents to the Halifax panel study carried o
APA, Harvard, Vancouver, ISO, and other styles
43

Abdul-Jabbar, Safa, and Loay George. "A Comparative Study for String Metrics and the Feasibility of Joining them as Combined Text Similarity Measures." ARO-The Scientific Journal of Koya University 5, no. 2 (2017): 6–18. http://dx.doi.org/10.14500/aro.10180.

Full text
APA, Harvard, Vancouver, ISO, and other styles
44

Winter, Felix, Nysret Musliu, and Peter Stuckey. "Explaining Propagators for String Edit Distance Constraints." Proceedings of the AAAI Conference on Artificial Intelligence 34, no. 02 (2020): 1676–83. http://dx.doi.org/10.1609/aaai.v34i02.5530.

Full text
Abstract:
The computation of string similarity measures has been thoroughly studied in the scientific literature and has applications in a wide variety of different areas. One of the most widely used measures is the so called string edit distance which captures the number of required edit operations to transform a string into another given string. Although polynomial time algorithms are known for calculating the edit distance between two strings, there also exist NP-hard problems from practical applications like scheduling or computational biology that constrain the minimum edit distance between arrays
APA, Harvard, Vancouver, ISO, and other styles
45

Hanmandlu, Madasu, and Anirban Das. "Content-based Image Retrieval by Information Theoretic Measure." Defence Science Journal 61, no. 5 (2011): 415. http://dx.doi.org/10.14429/dsj.61.1177.

Full text
Abstract:
<p>Content-based image retrieval focuses on intuitive and efficient methods for retrieving images from databases based on the content of the images. A new entropy function that serves as a measure of information content in an image termed as 'an information theoretic measure' is devised in this paper. Among the various query paradigms, 'query by example' (QBE) is adopted to set a query image for retrieval from a large image database. In this paper, colour and texture features are extracted using the new entropy function and the dominant colour is considered as a visual feature for a part
APA, Harvard, Vancouver, ISO, and other styles
46

Maslov, V. "Research of freak wave effect on a floating object in seakeeping tank." Transactions of the Krylov State Research Centre 3, no. 397 (2021): 65–74. http://dx.doi.org/10.24937/2542-2324-2021-3-397-65-74.

Full text
Abstract:
Object and purpose of research. This paper describes physical modeling of interaction process of abnormal wave (freak wave) with a marine floating structure in a seakeeping tank of the Krylov State Research Center. Freak wave is extremely dangerous because of the difference from wind waves by an unusually steep front slope and a gentle trough. Freak wave appears suddenly and collapses rapidly. Research of effect process features is necessary for understanding and analysis of the object behavior at extreme sea conditions. As experiment results it was necessary to obtain empirical data of sea ob
APA, Harvard, Vancouver, ISO, and other styles
47

Egghe, L., and C. Michel. "Construction of weak and strong similarity measures for ordered sets of documents using fuzzy set techniques." Information Processing & Management 39, no. 5 (2003): 771–807. http://dx.doi.org/10.1016/s0306-4573(02)00027-4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
48

Kaivapalu, Annekatrin, and Maisa Martin. "Perceived similarity between written Estonian and Finnish: Strings of letters or morphological units?" Nordic Journal of Linguistics 40, no. 2 (2017): 149–74. http://dx.doi.org/10.1017/s0332586517000142.

Full text
Abstract:
The distance or similarity between two languages can be objective or actual, i.e. discoverable by the tools and methods of linguists, or perceived by users of the languages. In this article two methods, the Levenshtein Distance (LD), which purports to measure the objective distance, and the Index of Perceived Similarity (IPS), which quantifies language users’ perceptions, are compared. The data are the quantitative results of a test measuring conscious perceptions of similarity between Estonian and Finnish inflectional morphology by Finnish and Estonian native speakers (‘Finns’ and ‘Estonians’
APA, Harvard, Vancouver, ISO, and other styles
49

Bjerrum, Esben, and Boris Sattarov. "Improving Chemical Autoencoder Latent Space and Molecular De Novo Generation Diversity with Heteroencoders." Biomolecules 8, no. 4 (2018): 131. http://dx.doi.org/10.3390/biom8040131.

Full text
Abstract:
Chemical autoencoders are attractive models as they combine chemical space navigation with possibilities for de novo molecule generation in areas of interest. This enables them to produce focused chemical libraries around a single lead compound for employment early in a drug discovery project. Here, it is shown that the choice of chemical representation, such as strings from the simplified molecular-input line-entry system (SMILES), has a large influence on the properties of the latent space. It is further explored to what extent translating between different chemical representations influence
APA, Harvard, Vancouver, ISO, and other styles
50

Dorji, Yonten, Peter Annighöfer, Christian Ammer, and Dominik Seidel. "Response of Beech (Fagus sylvatica L.) Trees to Competition—New Insights from Using Fractal Analysis." Remote Sensing 11, no. 22 (2019): 2656. http://dx.doi.org/10.3390/rs11222656.

Full text
Abstract:
Individual tree architecture and the composition of tree species play a vital role for many ecosystem functions and services provided by a forest, such as timber value, habitat diversity, and ecosystem resilience. However, knowledge is limited when it comes to understanding how tree architecture changes in response to competition. Using 3D-laser scanning data from the German Biodiversity Exploratories, we investigated the detailed three-dimensional architecture of 24 beech (Fagus sylvatica L.) trees that grew under different levels of competition pressure. We created detailed quantitative stru
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!