Digital Library[ Search Result ]
Ensemble of Sentence Interaction and Graph Based Models for Document Pair Similarity Estimation
Seonghwan Choi, Donghyun Son, Hochang Lee
http://doi.org/10.5626/JOK.2021.48.11.1184
Deriving the similarity between two documents, such as, news articles, is one of the most important factors of clustering documents. Sequence similarity models, one of the existing deep-learning based approaches to document clustering, do not reflect the entire context of documents. To address this issue, this paper uses interaction-based and graph-based approaches to construct document pair similarity models suitable for news clustering. This paper proposes four interaction-based models that measures the similarity between two documents through the aggregation of similarity information in the interaction of sentences. The experimental results demonstrated that two out of these four proposed models outperformed SVM and HAN. Ablation studies were conducted on the graph-based model through experiments on the depth of the model’s neural network and its input features. Through error analysis and ensemble of models with an interaction and graph-based approach, this paper showed that these two approaches could be complementarity due to the differences in their prediction tendencies.
Graph Construction Based on Fast Low-Rank Representation in Graph-Based Semi-Supervised Learning
http://doi.org/10.5626/JOK.2018.45.1.15
Low-Rank Representation (LRR) based methods are widely used in many practical applications, such as face clustering and object detection, because they can guarantee high prediction accuracy when used to constructing graphs in graph – based semi-supervised learning. However, in order to solve the LRR problem, it is necessary to perform singular value decomposition on the square matrix of the number of data points for each iteration of the algorithm; hence the calculation is inefficient. To solve this problem, we propose an improved and faster LRR method based on the recently published Fast LRR (FaLRR) and suggests ways to introduce and optimize additional constraints on the underlying optimization goals in order to address the fact that the FaLRR is fast but actually poor in classification problems. Our experiments confirm that the proposed method finds a better solution than LRR does. We also propose Fast MLRR (FaMLRR), which shows better results when the goal of minimizing is added.
A Label Inference Algorithm Considering Vertex Importance in Semi-Supervised Learning
Byonghwa Oh, Jihoon Yang, Hyun-Jin Lee
Semi-supervised learning is an area in machine learning that employs both labeled and unlabeled data in order to train a model and has the potential to improve prediction performance compared to supervised learning. Graph-based semi-supervised learning has recently come into focus with two phases: graph construction, which converts the input data into a graph, and label inference, which predicts the appropriate labels for unlabeled data using the constructed graph. The inference is based on the smoothness assumption feature of semi-supervised learning. In this study, we propose an enhanced label inference algorithm by incorporating the importance of each vertex. In addition, we prove the convergence of the suggested algorithm and verify its excellence.
Search
Journal of KIISE
- ISSN : 2383-630X(Print)
- ISSN : 2383-6296(Electronic)
- KCI Accredited Journal
Editorial Office
- Tel. +82-2-588-9240
- Fax. +82-2-521-1352
- E-mail. chwoo@kiise.or.kr