Robust Truth Discovery Scheme Based on Mean Shift Clustering Algorithm
Abstract
Data conflict is an inevitable problem in data collection due to the limitations in the real world. How to determine the most reliable data among many collected data is a problem worth studying. Truth discovery is a widely used resolution to integrate heterogeneous data. Existing truth discovery schemes mainly aggregate data from all sources to obtain the truth. However, it is intuitive that exceptional data should be excluded before aggregation, and how to identify exceptional data is also difficult. To tackle this problem, we use the mean shift clustering algorithm to remove exceptional data and obtain the truth value. Experiment results indicate our scheme performs well in various conditions.
Jingxue Chen, Jingkang Yang, Juan Huang, Yining Liu, "Robust Truth Discovery Scheme Based on Mean Shift Clustering Algorithm," Journal of Internet Technology, vol. 22, no. 4 , pp. 835-842, Jul. 2021.
Full Text:
PDFRefbacks
- There are currently no refbacks.
Published by Executive Committee, Taiwan Academic Network, Ministry of Education, Taipei, Taiwan, R.O.C
JIT Editorial Office, Office of Library and Information Services, National Dong Hwa University
No. 1, Sec. 2, Da Hsueh Rd., Shoufeng, Hualien 974301, Taiwan, R.O.C.
Tel: +886-3-931-7314 E-mail: jit.editorial@gmail.com