閱讀全文 | |
篇名 |
Robust Truth Discovery Scheme Based on Mean Shift Clustering Algorithm
|
---|---|
並列篇名 | Robust Truth Discovery Scheme Based on Mean Shift Clustering Algorithm |
作者 | Jingxue Chen、Jingkang Yang、Juan Huang、Yining Liu |
英文摘要 | 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. |
起訖頁 | 835-842 |
關鍵詞 | Truth discovery、Mean shift clustering algorithm、Aggregation、Data conflict |
刊名 | 網際網路技術學刊 |
期數 | 202107 (22:4期) |
出版單位 | 台灣學術網路管理委員會 |
DOI |
|
QR Code | |
該期刊 上一篇
| The Point Of Interest (POI) Recommendation for Mobile Digital Culture Heritage (M-DCH) Based on the Behavior Analysis using the Recurrent Neural Networks (RNN) and User-Collaborative Filtering |
該期刊 下一篇
| A Secured Data Storage Mechanism Using Baye’s Theorem and Matrix for Effective Data Communication in Cloud |