Home / Advanced Search

  • Title/Keywords

  • Author/Affliations

  • Journal

  • Article Type

  • Start Year

  • End Year

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

    ARTICLE

    LKMT: Linguistics Knowledge-Driven Multi-Task Neural Machine Translation for Urdu and English

    Muhammad Naeem Ul Hassan1,2, Zhengtao Yu1,2,*, Jian Wang1,2, Ying Li1,2, Shengxiang Gao1,2, Shuwan Yang1,2, Cunli Mao1,2

    CMC-Computers, Materials & Continua, Vol.81, No.1, pp. 951-969, 2024, DOI:10.32604/cmc.2024.054673 - 15 October 2024

    Abstract Thanks to the strong representation capability of pre-trained language models, supervised machine translation models have achieved outstanding performance. However, the performances of these models drop sharply when the scale of the parallel training corpus is limited. Considering the pre-trained language model has a strong ability for monolingual representation, it is the key challenge for machine translation to construct the in-depth relationship between the source and target language by injecting the lexical and syntactic information into pre-trained language models. To alleviate the dependence on the parallel corpus, we propose a Linguistics Knowledge-Driven Multi-Task (LKMT) approach to… More >

  • Open Access

    ARTICLE

    Knowledge-Driven Possibilistic Clustering with Automatic Cluster Elimination

    Xianghui Hu1, Yiming Tang2,3, Witold Pedrycz3,4, Jiuchuan Jiang5,*, Yichuan Jiang1,*

    CMC-Computers, Materials & Continua, Vol.80, No.3, pp. 4917-4945, 2024, DOI:10.32604/cmc.2024.054775 - 12 September 2024

    Abstract Traditional Fuzzy C-Means (FCM) and Possibilistic C-Means (PCM) clustering algorithms are data-driven, and their objective function minimization process is based on the available numeric data. Recently, knowledge hints have been introduced to form knowledge-driven clustering algorithms, which reveal a data structure that considers not only the relationships between data but also the compatibility with knowledge hints. However, these algorithms cannot produce the optimal number of clusters by the clustering algorithm itself; they require the assistance of evaluation indices. Moreover, knowledge hints are usually used as part of the data structure (directly replacing some clustering centers),… More >

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