Multi-link similar data mining and cleaning method based on Bayesian algorithm
by Kaiku Wang; Congkuan Huang; Yang Yang
International Journal of Information and Communication Technology (IJICT), Vol. 24, No. 2, 2024

Abstract: Aiming at the problem of low precision and large cleaning error in multi-link similar data mining, a multi-link similar data mining cleaning method based on Bayesian algorithm is proposed in this paper. On the basis of extracting multi-link data, the data is preprocessed and the similarity between the data is calculated. The data with high similarity is input into the Bayesian network, and the data cleaning process is completed according to the maximum likelihood value of the data. Experimental results show that the mining accuracy of the proposed method for similar data can reach 98.51%, and the cleaning error is about 1.22%, indicating that the proposed method can more effectively complete the mining and cleaning of similar data in multi-links.

Online publication date: Tue, 05-Mar-2024

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Information and Communication Technology (IJICT):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com