1,721,325 research outputs found

    A semi-automatic data integration process of heterogeneous databases

    No full text
    One of the most difficult issues today, is the integration of data from various sources. Thus, it arises the need of automatic Data Integration (DI) methods. However, in the literature there are fully automatic or semi-automatic DI techniques, but they require the involvement of IT-experts with specific domain skills. In this paper we present a novel DI methodology for which it is not required the involvement of IT-experts; in this methodology syntactically/semantically similar entities present in the sources are merged, by exploiting an information retrieval technique, a clustering method and a trained neural net-work. Although the suggested process is completely automated, we planned some interactions with the Company Manager, a figure who is not required to have IT-skills, but whose only contribution will be to define limits and tolerance thresholds during the DI process, based on the interests of the company. The validity of the proposed approach showed an integration accuracy between 99% - 100% .(c) 2023 The Author(s). Published by Elsevier B.V. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/

    Sketched symbol recognition using Latent-Dynamic Conditional Random Fields and distance-based clustering

    No full text
    In this paper we propose a two-stage method for recognizing sketched symbols that combine the use of a discriminative model, for labeling symbol strokes and a distance-based clustering algorithm, for grouping the labels belonging to the same symbol. In the first stage, we employ Latent-Dynamic Conditional Random Field (LDCRF), a discriminative model able to analyze the features of unsegmented sequences of strokes by taking into account spatio-temporal information, and to classify the symbol parts by considering contextual information. In the second stage, the labels obtained from LDCRF are grouped into symbol labels by using a distance-based clustering algorithm which takes into account the geometric relationships among strokes. The effectiveness of our method has been evaluated on the domain of electric circuit diagrams achieving accuracy values varying between 81.3% and 91.0%

    Identifying Similar Pages of Web Applications using a Competitive Clustering Algorithm

    No full text
    We present an approach based on Winner Takes All (WTA), a competitive clustering algorithm, to support the comprehension of static and dynamic Web applications during Web application reengineering. This approach adopts a process that first computes the distance between Web pages and then identifies and groups similar pages using the considered clustering algorithm. We present an instance of application of the clustering process to identify similar pages at the structural level. The page structure is encoded into a string of HTML tags and then the distance between Web pages at the structural level is computed using the Levenshtein string edit distance algorithm. A prototype to automate the clustering process has been implemented that can be extended to other instances of the process, such as the identification of groups of similar pages at content level. The approach and the tool have been evaluated in two case studies. The results have shown that the WTA clustering algorithm suggests heuristics to easily identify the best partition of Web pages into clusters among the possible partitions

    Iconic languages: Towards end-user programming of mobile applications

    No full text
    After tracing the steps that led to the current generation of iconic languages starting from the original idea of S.K. Chang, we describe an iconic language, named MicroApp, for modeling pervasive mobile applications directly on the mobile device. MicroApp exploits generalized icons for composing mobile applications: services are represented by icons and are composed of adopting colors for representing data-flow. We also qualitatively evaluate the visual environment that implements this iconic language

    An Extended Relational Data Model for Multimedia Databases

    No full text
    We have extended the canonical relational data model to enable the management of multimedia objects. In an attempt to provide a smooth paradigm shift to multimedia information system development, we have enhanced the relational data model framework with techniques for modeling, storing and manipulating multimedia data. In particular, we have provided a graphical conceptual model for structuring a multimedia document and mapping rules for translating it into an extended relational data schema. Extensions have regarded the management of foreign keys, active components, mechanisms for the management of spatial and temporal relations, and finally functions for handling multimedia presentations. As a consequence, we have also provided extensions to the SQL language to handle these new mechanisms

    Synchronization of queries and views upon schema evolutions: A survey

    Full text link
    One of the problems arising upon the evolution of a database schema is that some queries and views defined on the previous schema version might no longer work properly. Thus, evolving a database schema entails the redefinition of queries and views to adapt them to the new schema. Although this problem has been mainly raised in the context of traditional information systems, solutions to it are also advocated in other database-related areas, such as Data Integration, Web Data Integration, and Data Warehouses. The problem is a critical one, since industrial organizations often need to adapt their databases and data warehouses to frequent changes in the real world. In this article, we provide a survey of existing approaches and tools to the problem of adapting queries and views upon a database schema evolution; we also propose a classification framework to enable a uniform comparison method among many heterogeneous approaches and tools
    corecore