检索结果-南通市图书馆

Shape Recognition and Retrieval Based on edit distance and Dynamic Programming

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Tsinghua Science and Technology 2009年第6期14卷 739-745页

作者：潘鸿飞梁栋唐俊王年李薇 Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Anhui University

An important aim in pattern recognition is to cluster the given shapes. This paper presents a shape recognition and retrieval algorithm. The algorithm first extracts the skeletal features using the medial axis transform. Then, the features are transformed into a string of symbols with the similarity among those symbols computed based on the edit distance. Finally, the shapes are identified using dynamic programming. Two public datasets are analyzed to demonstrate that the present approach is better than previous approaches.

关键词： skeletal features medial axis transform edit distance dynamic programming

FrepJoin:an efficient partition-based algorithm for edit similarity join

在线全文

学校读者我要写书评

暂无评论

Frontiers of Information Technology & Electronic Engineering 2017年第10期18卷 1499-1510页

作者： Ji-zhou LUO Sheng-fei SHI Hong-zhi WANG Jian-zhong LI School of Computer Science and Technology Harbin Institute of Technology Guangdong Key Laboratory of Popular High Performance Computers Key Laboratory of Service Computing and Application

String similarity join(SSJ) is essential for many applications where near-duplicate objects need to be found. This paper targets SSJ with edit distance constraints. The existing algorithms usually adopt the filter-andrefine framework. They cannot catch the dissimilarity between string subsets, and do not fully exploit the statistics such as the frequencies of characters. We investigate to develop a partition-based algorithm by using such *** frequency vectors are used to partition datasets into data chunks with dissimilarity between them being caught easily. A novel algorithm is designed to accelerate SSJ via the partitioned data. A new filter is proposed to leverage the statistics to avoid computing edit distances for a noticeable proportion of candidate pairs which survive the existing filters. Our algorithm outperforms alternative methods notably on real datasets.

关键词： String similarity join edit distance Filter and refine Data partition Combined frequency vectors

A Generalization of Haussler's Convolution Kernel——Mapping Kernel and Its Application to Tree Kernels

在线全文

学校读者我要写书评

暂无评论

Journal of Computer Science & Technology 2010年第5期25卷 1040-1054页

作者： Kilho Shin Tetsuji Kuboyama Graduate School of Applied Informatics University of HyogoKobeJapan Carnegie Mellon CyLab PittsburghU.S.A Computer Center Gakushuin UniversityTokyoJapan

Haussler＇s convolution kernel provides an effective framework for engineering positive semidefinite kernels, and has a wide range of *** the other hand,the mapping kernel that we introduce in this paper is its natural generalization,and will enlarge the range of application *** main theorem with respect to positive semidefiniteness of the mapping kernel（1） implies Haussler＇s theorem as a corollary,（2） exhibits an easy-to-check necessary and sufficient condition for mapping kernels to be positive semidefinite,and（3） formalizes the mapping kernel so that significant flexibility is provided in engineering new *** an evidence of the effectiveness of our results,we present a framework to engineer tree *** tree is a data structure widely used in many applications,and tree kernels provide an effective method to analyze tree-type ***,not only is the framework important as an example but also as a practical research *** description of the framework accompanies a survey of the tree kernels in the literature,where we see that 18 out of the 19 surveyed tree kernels of different types are instances of the mapping kernel,and examples of novel interesting tree kernels.

关键词： kernel convolution kernel tree edit distance

BSAlign:A Library for Nucleotide Sequence Alignment

在线全文

学校读者我要写书评

暂无评论

Genomics, Proteomics & Bioinformatics 2024年第2期22卷 135-142页

作者： Haojing Shao Jue Ruan Shenzhen Branch Guangdong Laboratory of Lingnan Modern AgricultureGenome Analysis Laboratory of the Ministry of Agriculture and Rural AffairsAgricultural Genomics Institute at ShenzhenChinese Academy of Agricultural SciencesShenzhen 518120China

Increasing the accuracy of the nucleotide sequence alignment is an essential issue in genomics *** classic dynamic programming(DP)algorithms(e.g.,Smith–Waterman and Needleman–Wunsch)guarantee to produce the optimal result,their time complexity hinders the application of large-scale sequence *** optimization efforts that aim to accelerate the alignment process generally come from three perspectives:redesigning data structures[e.g.,diagonal or striped Single Instruction Multiple Data(SIMD)implementations],increasing the number of parallelisms in SIMD operations(e.g.,difference recurrence relation),or reducing search space(e.g.,banded DP).However,no methods combine all these three aspects to build an ultra-fast *** this study,we developed a Banded Striped Aligner(BSAlign)library that delivers accurate alignment results at an ultra-fast speed by knitting a series of novel methods together to take advantage of all of the aforementioned three perspectives with highlights such as active F-loop in striped vectorization and striped move in banded *** applied our new acceleration design on both regular and edit distance pairwise *** achieved 2-fold speed-up than other SIMD-based implementations for regular pairwise alignment,and 1.5-fold to 4-fold speed-up in edit distance-based implementations for long *** is implemented in C programing language and is available at https://***/ruanjue/bsalign.

关键词： Pairwise alignment edit distance Striped vectorization Banded dynamic programming F evaluation

Measuring Musical Rhythm Similarity: Further Experiments with the Many-to-Many Minimum-Weight Matching distance

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of Computer and Communications 2016年第15期4卷 117-125页

作者： Godfried T. Toussaint Seung Man Oh Computer Science Program New York University Abu Dhabi Abu Dhabi United Arab Emirates Freelance IT Developer Seoul Korea

Musical rhythms are represented as sequences of symbols. The sequences may be composed of binary symbols denoting either silent or monophonic sounded pulses, or ternary symbols denoting silent pulses and two types of sounded pulses made up of low-pitched (dum) and high-pitched (tak) sounds. Experiments are described that compare the effectiveness of the many-to-many minimum-weight matching between two sequences to serve as a measure of similarity that correlates well with human judgements of rhythm similarity. This measure is also compared to the often used edit distance and to the one-to-one minimum-weight matching. New results are reported from experiments performed with three widely different datasets of real- world and artificially generated musical rhythms (including Afro-Cuban rhythms), and compared with results previously reported with a dataset of Middle Eastern dum-tak rhythms.

关键词： Musical Rhythms Rhythm Similarity Measures Many-to-Many Minimum-Weight Matching edit distance One-to-One Minimum-Weight Matching Rhythm Perception Afro-Cuban Rhythms Middle Eastern Rhythms

An Efficient Scheme of Detecting Repackaged Android Applications

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

ZTE Communications 2016年第3期14卷 60-66页

作者： QIN Zhongyuan PAN Wanpeng XU Ying FENG Kerong YANG Zhongyun Southeast University Nanjing 211100 China ZTE Corporation Xi 'an 71014d China

The increasing popularity of Android devices gives birth to a large amount of feature-rich applications （or apps） in various Android markets. Since adversaries can easily repackage mali- cious code into benign apps and spread them, it is urgent to detect the repackaged apps to maintain healthy Android mar- kets. In this paper we propose an efficient detection scheme based on twice context triggered piecewise hash （T-CTPH）, in which CTPH process is called twice so as to generate two fin- gerprints for each app to detect the repackaged Android appli- cations. We also optimize the similarity calculation algorithm to improve the matching efficiency. Experimental results show that there are about 5% repackaged apps in pre- collected 6438 samples of 4 different types. The proposed scheme im- proves the detection accuracy of the repackaged apps and has positive and practical significance for the ecological system of the Android markets.

关键词： Android repackage similarity edit distance

A Topic-Specific Web Crawler with Web Page Hierarchy Based on HTML Dom-Tree

在线全文

学校读者我要写书评

暂无评论

A Topic-Specific Web Crawler with Web Page Hierarchy Based o...

2009 Asia-Pacific Conference on Information Processing

作者： Yuekui Yang Yajun Du Yufeng Hai Zhaoqiong Gao School of Mathematics & Computer Science Xihua University Chengdu Sichuan 610039 China

With Internet growing exponentially,data mining in the web becomes the main method to find relevant *** the amount of web sites and documents growing even faster and site contents getting updated more and more often,focused web crawler is becoming more and more *** the literature,how to order the unvisited URLs was studied deeply,they calculate the prediction score is based on the unvisited URLs’ ancestor,however the URLs in one web page is considered to have the same *** other words,they consider a web page has only one topic *** we find the different parts of a web page have their own topic information,while they all support one or several big topics,so the URLs in different paragraphs should be given different scores based on the hierarchy relationship among *** this paper,we parse every web page as a Dom-Tree,propose some rules in the tree aiming at extracting the relationship among different paragraphs,and then present a new topic-specific web crawler which calculates the unvisited URL’s prediction score based on the web page hierarchy and the text semantic *** consider three factors,firstly,we calculate the text similarity using vector space model（VSM） which consider the query or paragraph as a vector in which the terms are *** there are relations about terms’ sequences in a text paragraph;we try to using edit distance based on terms’ sequences to avoid ***,different paragraphs in a web page are contacted according to their hierarchy in a *** last we combine the three factors in our crawler’s strategy and present our model.

关键词： Focused web crawler Dom-Tree edit distance Semantic similarity

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

一种基于Word2Vector与编辑距离的句子相似度计算方法

2006年全国理论计算机科学学术年会

作者：张忠平燕山大学信息科学与工程学院计算机科学与工程系

＜正＞Although a good distance measure for XML documents is somewhat difficult to define since two documents are created from the same DTD, but we can define similarity measure since XML documents can be represented as trees with a tree edit distance. XML has become a standard of data translation and exchange on the Web. The development of XML brings more requirements for performance of XML query. Since XML documents can be represented as trees, based on traditional tree edit distance, it presents structural similarity measure for XML documents, which is based on edge constraint, path constraint, inclusive path constraint, and similarity measure based on costs. They extend scope for searching XML documents, and improve recall and precision for searching XML documents.

关键词： XML documents Similarity Constraint edit distance

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

电脑知识与技术（过刊） 2017年第2X期23卷 146-147页

作者：陆尹浩同济大学上海201800

随着各种问答系统的流行与聊天机器人的火热,对句子相似性的比较和处理越来越成为各类类似系统的核心部分。因此,研究并设计出一种好的句子相似性比较方法变得越来越关键。该文基于一种深度学习模型Word2Vector并且结合编辑距离算法提... 详细信息

随着各种问答系统的流行与聊天机器人的火热,对句子相似性的比较和处理越来越成为各类类似系统的核心部分。因此,研究并设计出一种好的句子相似性比较方法变得越来越关键。该文基于一种深度学习模型Word2Vector并且结合编辑距离算法提出了一种句子相似度计算方法,给出了具体的设计思路,并且通过实验验证了该方法的有效性,最后总结了该方法的优缺点。

关键词：句子相似度计算 Word2Vector 编辑距离 edit distance