Jen-Yuan Yeh^∗

Computer Systems Science and Engineering, Vol.33, No.1, pp. 41-52, 2018, DOI:10.32604/csse.2018.33.041

Abstract As a crucial task in information retrieval, ranking defines the preferential order among the retrieved documents for a given query. Supervised learning has recently been dedicated to automatically learning ranking models by incorporating various models into one effective model. This paper proposes a novel supervised learning method, in which instances are represented as bags of contexts of features, instead of bags of features. The method applies rank-order correlations to measure the correlation relationships between features. The feature vectors of instances, i.e., the 1st-order raw feature vectors, are then mapped into the feature correlation space via projection to derive the context-level… More >

Jun Sun¹, Yan Li¹, Yatian Shen^1,*, Wenke Ding¹, Xianjin Shi¹, Lei Zhang¹, Xiajiong Shen¹, Jing He²

Journal of Information Hiding and Privacy Protection, Vol.1, No.2, pp. 69-75, 2019, DOI:10.32604/jihpp.2019.06357

Abstract Relation extraction is an important task in NLP community. However, some models often fail in capturing Long-distance dependence on semantics, and the interaction between semantics of two entities is ignored. In this paper, we propose a novel neural network model for semantic relation classification called joint self-attention bi-LSTM (SA-Bi-LSTM) to model the internal structure of the sentence to obtain the importance of each word of the sentence without relying on additional information, and capture Long-distance dependence on semantics. We conduct experiments using the SemEval-2010 Task 8 dataset. Extensive experiments and the results demonstrated that the proposed method is effective against… More >

Libo Yin¹, Xiang Meng², Jianxun Li³, Jianguo Sun^2,*

CMC-Computers, Materials & Continua, Vol.60, No.1, pp. 275-285, 2019, DOI:10.32604/cmc.2019.05556

Abstract With the development of information technology including Internet technologies, the amount of textual information that people need to process daily is increasing. In order to automatically obtain valuable and user-informed information from massive amounts of textual data, many researchers have conducted in-depth research in the area of entity relation extraction. Based on the existing research of word vector and the method of entity relation extraction, this paper designs and implements an method based on support vector machine (SVM) for extracting English entity relationships from massive news texts. The method converts sentences in natural language into a form of numerical matrix… More >

Daojian Zeng^1,2, Yao Xiao^1,2, Jin Wang^2,*, Yuan Dai^1,2, Arun Kumar Sangaiah³

CMC-Computers, Materials & Continua, Vol.60, No.3, pp. 1251-1261, 2019, DOI:10.32604/cmc.2019.06100

Abstract Recently, many researchers have concentrated on distant supervision relation extraction (DSRE). DSRE has solved the problem of the lack of data for supervised learning, however, the data automatically labeled by DSRE has a serious problem, which is class imbalance. The data from the majority class obviously dominates the dataset, in this case, most neural network classifiers will have a strong bias towards the majority class, so they cannot correctly classify the minority class. Studies have shown that the degree of separability between classes greatly determines the performance of imbalanced data. Therefore, in this paper we propose a novel model, which… More >

Daojian Zeng^1,3, Yuan Dai^1,3, Feng Li^1,3, R. Simon Sherratt², Jin Wang^3,*

CMC-Computers, Materials & Continua, Vol.55, No.1, pp. 121-136, 2018, DOI:10.3970/cmc.2018.055.121

Abstract Recently, many researchers have concentrated on using neural networks to learn features for Distant Supervised Relation Extraction (DSRE). These approaches generally use a softmax classifier with cross-entropy loss, which inevitably brings the noise of artificial class NA into classification process. To address the shortcoming, the classifier with ranking loss is employed to DSRE. Uniformly randomly selecting a relation or heuristically selecting the highest score among all incorrect relations are two common methods for generating a negative class in the ranking loss function. However, the majority of the generated negative class can be easily discriminated from positive class and will contribute… More >