Correlation consistency constrained matrix completion for web service tag refinement

With the permeation of web 2.0, large-scale web services with tags are easily available on websites. However, the noisy and incomplete correspondence between web services and tags impedes the tag related web service applications. To address this challenge, a Matrix Completion based Web Service Tag R...

Full description

Saved in:
Bibliographic Details
Published inNeural computing & applications Vol. 26; no. 1; pp. 101 - 110
Main Authors Chen, Lei, Yang, Geng, Chen, Zhengyu, Xiao, Fu, Shi, Jianyue
Format Journal Article
LanguageEnglish
Published London Springer London 01.01.2015
Subjects
Artificial Intelligence
Computational Biology/Bioinformatics
Computational Science and Engineering
Computer Science
Data Mining and Knowledge Discovery
Image Processing and Computer Vision
Original Article
Probability and Statistics in Computer Science
Operator splitting
Tag refinement
Correlation consistency
Web service
Matrix completion
Online AccessGet full text

Cover

More Information
Summary:With the permeation of web 2.0, large-scale web services with tags are easily available on websites. However, the noisy and incomplete correspondence between web services and tags impedes the tag related web service applications. To address this challenge, a Matrix Completion based Web Service Tag Refinement (MCWSTR) framework is proposed. Firstly, the MCWSTR framework naturally formulates the web service tag refinement problem as a Correlation Consistency Constrained Matrix Completion (C3MC) problem, which jointly model content correlation consistency and tag correlation consistency among web services and tags. Secondly, the MCWSTR framework employs an efficient Fixed Point Iterative algorithm based on Operator Splitting technique to solve the C3MC problem, Experimental results on the real-world web services collection show the encouraging performance of our proposed MCWSTR framework.
ISSN:0941-0643
1433-3058
DOI:10.1007/s00521-014-1704-z