Home / Advanced Search

  • Title/Keywords

  • Author/Affliations

  • Journal

  • Article Type

  • Start Year

  • End Year

Update SearchingClear
  • Articles
  • Online
Search Results (5)
  • Open Access

    ARTICLE

    A Joint Entity Relation Extraction Model Based on Relation Semantic Template Automatically Constructed

    Wei Liu, Meijuan Yin*, Jialong Zhang, Lunchong Cui

    CMC-Computers, Materials & Continua, Vol.78, No.1, pp. 975-997, 2024, DOI:10.32604/cmc.2023.046475

    Abstract The joint entity relation extraction model which integrates the semantic information of relation is favored by relevant researchers because of its effectiveness in solving the overlapping of entities, and the method of defining the semantic template of relation manually is particularly prominent in the extraction effect because it can obtain the deep semantic information of relation. However, this method has some problems, such as relying on expert experience and poor portability. Inspired by the rule-based entity relation extraction method, this paper proposes a joint entity relation extraction model based on a relation semantic template automatically constructed, which is abbreviated as… More >

  • Open Access

    ARTICLE

    An Efficient Way to Parse Logs Automatically for Multiline Events

    Mingguang Yu1,2, Xia Zhang1,2,*

    Computer Systems Science and Engineering, Vol.46, No.3, pp. 2975-2994, 2023, DOI:10.32604/csse.2023.037505

    Abstract

    In order to obtain information or discover knowledge from system logs, the first step is to perform log parsing, whereby unstructured raw logs can be transformed into a sequence of structured events. Although comprehensive studies on log parsing have been conducted in recent years, most assume that one event object corresponds to a single-line message. However, in a growing number of scenarios, one event object spans multiple lines in the log, for which parsing methods toward single-line events are not applicable. In order to address this problem, this paper proposes an automated log parsing method for multiline events (LPME). LPME… More >

  • Open Access

    ARTICLE

    Friends Classification of Ego Network Based on Combined Features

    Jing Jiaa, Tinghuai Mab, Fan Xinga, William Faraha, Donghai Guana,c

    Intelligent Automation & Soft Computing, Vol.24, No.4, pp. 819-827, 2018, DOI:10.1080/10798587.2017.1355656

    Abstract Ego networks consist of a user and his/her friends and depending on the number of friends a user has, makes them cumbersome to deal with. Social Networks allow users to manually categorize their “circle of friends”, but in today’s social networks due to the unlimited number of friends a user has, it is imperative to find a suitable method to automatically administrate these friends. Manually categorizing friends means that the user has to regularly check and update his circle of friends whenever the friends list grows. This may be time consuming for users and the results may not be accurate… More >

  • Open Access

    ARTICLE

    Methods to Automatically Build Point Distribution Models for Objects like Hand Palms and Faces Represented in Images

    Maria João M. Vasconcelos1, João Manuel R. S. Tavares1

    CMES-Computer Modeling in Engineering & Sciences, Vol.36, No.3, pp. 213-242, 2008, DOI:10.3970/cmes.2008.036.213

    Abstract In this work we developed methods to automatically extract significant points of objects like hand palms and faces represented in images that can be used to build Point Distribution Models automatically. These models are further used to segment the modelled objects in new images, through the use of Active Shape Models or Active Appearance Models. These models showed to be efficient in the segmentation of objects, but had as drawback the fact that the labelling of the landmark points was usually manually made and consequently time consuming. Thus, in this paper we describe some methods capable to extract significant points… More >

  • Open Access

    ARTICLE

    Fuzzy C-Means Algorithm Automatically Determining Optimal Number of Clusters

    Ruikang Xing1,*, Chenghai Li1

    CMC-Computers, Materials & Continua, Vol.60, No.2, pp. 767-780, 2019, DOI:10.32604/cmc.2019.04500

    Abstract In clustering analysis, the key to deciding clustering quality is to determine the optimal number of clusters. At present, most clustering algorithms need to give the number of clusters in advance for clustering analysis of the samples. How to gain the correct optimal number of clusters has been an important topic of clustering validation study. By studying and analyzing the FCM algorithm in this study, an accurate and efficient algorithm used to confirm the optimal number of clusters is proposed for the defects of traditional FCM algorithm. For time and clustering accuracy problems of FCM algorithm and relevant algorithms automatically… More >

Displaying 1-10 on page 1 of 5. Per Page