A Component Retrieval Tree Matching Algorithm Based on a Faceted Classification Scheme

Abstract An efficient scheme of component retrieval can significantly reduce the cost of software reuse. For this purpose, a method of successfully retrieving of specified components from the component repository is a crucial consideration. However, neither the retrieval efficiency, nor the query-matching rate of the traditional method, which is based on a faceted classification scheme, satisfies the requirements of component retrieval. In this paper a novel component retrieval method combining the features of the faceted classification scheme and the theory of tree matching is proposed. This method not only accurately retrieves components that match queries, but also considers any incomplete descriptions of the retrieval component to completely ensure the relaxation ability of the component retrieval. The experimental results show that the retrieval matching method proposed is highly efficient, and it retrieves feasibly and efficiently the components.

Download Full-text

Research on Component Retrieval Method Based on Faceted Classification Described

Applied Mechanics and Materials ◽

10.4028/www.scientific.net/amm.121-126.1727 ◽

2011 ◽

Vol 121-126 ◽

pp. 1727-1733

Author(s):

Yan Pei Liu ◽

Jian Ping Wang ◽

Jun Chen

Keyword(s):

Large Scale ◽

Search Method ◽

Component Technology ◽

Component Reuse ◽

Component Retrieval ◽

Retrieval Method ◽

Component Library ◽

Faceted Search ◽

Faceted Classification ◽

Component Representation

With the development of component technology and component library expansion, component representation and retrieval technology as the component library management two core technologies has become a research hotspot. According to the current widely used methods described and characteristics of components faceted classification, this paper starting from component reuse by different search methods，based on view search method、based on faceted search method、based on terms retrieval method three kinds of term component retrieval methods and the corresponding model of the five matches and two matching algorithms are proposed. Theoretical analysis and experimental results show that the three kinds of retrieval methods used in large-scale component library component retrieval, to meet the component reuse of various search requirements and the retrieval efficiency is feasible.

Download Full-text

Retrieval and Modelling of Software Evolution Process Component

Applied Mechanics and Materials ◽

10.4028/www.scientific.net/amm.241-244.2867 ◽

2012 ◽

Vol 241-244 ◽

pp. 2867-2871

Author(s):

Jing Lei Li

Keyword(s):

Software Evolution ◽

Evolution Process ◽

Software Systems ◽

Legacy Systems ◽

Formal Definition ◽

Component Retrieval ◽

Matching Algorithm ◽

Faceted Classification ◽

Process Component

As more and more successful software systems become legacy systems,the importance and popularity of software evolution increase[1]. In order to make the mature software systems as components, so that they can be re-assembled and maintenance as automobile parts. In this context, the software evolution process component formal definition is designed based on this background. And then define the component model. Based on the questions in component retrieval, faceted classification of the Components and the theory of tree matching algorithm is discussed and analyzed. The Retrieval of Software Evolution Process Component is designed with the theory of tree matching algorithm so as to support the software evolution process modelling.

Download Full-text

A dynamic memory of software designs

Artificial intelligence for engineering design analysis and manufacturing ◽

10.1017/s0890060400000743 ◽

1994 ◽

Vol 8 (2) ◽

pp. 163-176 ◽

Cited By ~ 1

Author(s):

Scott Henderson ◽

Sidney C. Bailin

Keyword(s):

Artificial Intelligence ◽

Software Engineering ◽

Software Reuse ◽

Concept Formation ◽

Experimental System ◽

Dynamic Memory ◽

Software Artifacts ◽

Retrieval Efficiency ◽

Conceptual Hierarchy ◽

Support Software

AbstractThis paper describes an application of artificial intelligence to support software reuse. We begin by discussing the characteristics of software engineering that establish dynamic reorganization as a requirement for a repository of software artifacts. We then present an experimental system that uses incremental concept formation as the basis for dynamic reorganization, and the conceptual hierarchy that was generated by the system for a set of 67 artifacts. The hierarchy is compared to a hierarchy produced manually by independent investigators, and the automatic hierarchy is evaluated in terms of retrieval efficiency and retrieval reliability. The paper ends with a discussion of three projects that share similar objectives with our work.

Download Full-text

Method for Retrieving Digital Agricultural Text Information Based on Local Matching

Symmetry ◽

10.3390/sym12071103 ◽

2020 ◽

Vol 12 (7) ◽

pp. 1103

Author(s):

Yue Song ◽

Minjuan Wang ◽

Wanlin Gao

Keyword(s):

Recall Rate ◽

Retrieval Method ◽

Retrieval Time ◽

Search Results ◽

Retrieval Efficiency ◽

Query Tree ◽

Text Information ◽

Relationship Of ◽

The Relationship ◽

Precision Rate

In order to improve the retrieval results of digital agricultural text information and improve the efficiency of retrieval, the method for searching digital agricultural text information based on local matching is proposed. The agricultural text tree and the query tree are constructed to generate the relationship of ancestor–descendant in the query and map it to the agricultural text. According to the retrieval method of the local matching, the vector retrieval method is used to calculate the digital agricultural text and submit the similarity between the queries. The similarity is sorted from large to small so that the agricultural text tree can output digital agricultural text information in turn. In the case of adding interference information, the recall rate and precision rate of the proposed method are above 99.5%; the average retrieval time is between 4s and 6s, and the average retrieval efficiency is above 99%. The proposed method is more efficient in information retrieval and can obtain comprehensive and accurate search results, which can be used for the rapid retrieval of digital agricultural text information.

Download Full-text

A Fast Retrieval Method Based on K-Means Clustering for Mechanical Product Design

Advanced Materials Research ◽

10.4028/www.scientific.net/amr.156-157.98 ◽

2010 ◽

Vol 156-157 ◽

pp. 98-101

Author(s):

Hui Jing ◽

Cong Li ◽

Mei Fa Huang ◽

Fu Yun Liu

Keyword(s):

Product Design ◽

Clustering Method ◽

Retrieval Method ◽

Retrieval Efficiency ◽

Mechanical Models ◽

Very High

Radius Angle Histogram (RAH) is useful method of retrieving 3D mechanical models. This method, however, not completely uses the information of radius angle histogram of the model. As a result, the retrieval precision is not very high enough. To improve the retrieval efficiency, K-means clustering method (KMM) is proposed in this paper. The radius angle histograms of the models are established first and then be served as inputs as KMM, respectively. By using KMM, the models can be classified and the results can be obtained. To validate the proposed method, an experiment is given. The results show that the retrieval precision of the proposed method is higher than that of single using RAH method.

Download Full-text

XML SCHEMA MATCHING

International Journal of Software Engineering and Knowledge Engineering ◽

10.1142/s0218194007003446 ◽

2007 ◽

Vol 17 (05) ◽

pp. 575-597 ◽

Cited By ~ 2

Author(s):

JIANGUO LU ◽

JU WANG ◽

SHENGRUI WANG

Keyword(s):

Data Integration ◽

Software Reuse ◽

Edit Distance ◽

Xml Schema ◽

Schema Matching ◽

Schema Evolution ◽

Tree Edit Distance ◽

Matching Problem ◽

Matching Algorithm ◽

Unordered Trees

XML Schema matching problem can be formulated as follows: given two XML Schemas, find the best mapping between the elements and attributes of the schemas, and the overall similarity between them. XML Schema matching is an important problem in data integration, schema evolution, and software reuse. This paper describes a matching system that can find accurate matches and scales to large XML Schemas with hundreds of nodes. In our system, XML Schemas are modeled as labeled and unordered trees, and the schema matching problem is turned into a tree matching problem. We proposed Approximate Common Structures in trees, and developed a tree matching algorithm based on this concept. Compared with the traditional tree edit-distance algorithm and other schema matching systems, our algorithm is faster and more suitable for large XML Schema matching.

Download Full-text

Information Management and Valuation

International Journal of Engineering Business Management ◽

10.5772/52800 ◽

2013 ◽

Vol 5 ◽

pp. 1 ◽

Cited By ~ 11

Author(s):

Sabah Al-Fedaghi

Keyword(s):

Flow Model ◽

Classification Scheme ◽

Cost Effective ◽

Business Value ◽

Information Value ◽

Organizational Level ◽

Information Assets ◽

Information Flow Model ◽

The Cost ◽

Lifecycle Management

The aim of information lifecycle management is to develop a cost-effective strategy for maintaining information assets, balancing the cost of maintaining information against business value. This paper contributes to development of theoretical information value based on a classification scheme that does not consider operational factors (e.g., storage, access). It concentrates on valuing information in terms of its type, organizational level and the extent of its effects. An information flow model provides the foundation for such categorisation.

Download Full-text