Computer Science ›› 2017, Vol. 44 ›› Issue (12): 255-259.doi: 10.11896/j.issn.1002-137X.2017.12.046

Previous Articles     Next Articles

Feature Construction Method for Learning to Rank Based on Optimization of Matrix Factorization

YANG Xiao, CUI Chao-ran and WANG Shuai-qiang   

  • Online:2018-12-01 Published:2018-12-01

Abstract: Feature selection can improve ranking efficiency and accuracy.Current study mainly prefers selecting the most distinguishing feature set rather than feature construction,where the selection is mostly according to the significance of features and the similarity between features.Since the features are mostly induced manually,there are inevitably overlap and redundancy between them.In order to reduce the redundancy,matrix decomposition is used to generate new features set.An optimization algorithm was designed according to the effect of the feature matrix decomposed,and the gap between the decomposed feature matrix and the original matrix.Then a matrix decomposition based optimization for learning to rank,which named by MFRank,was proposed to take into account,the ranking result acquired by the features,which cannot be handled by matrix decomposition method such as singular value decomposition (SVD),etc.A stochastic projective sub-gradient algorithm was used in experiments to obtain the approximate optimal values for the optimization problems,and experimental result on MQ2008,which is an open test set,shows that the proposed MFRank algorithm can obtain comparative result as RankBoost,RankSVM-Struct which are the state-of-the-art algorithms.

Key words: Feature construction,Learning to rank,Matrix factorization,Optimization

[1] HUANG Z H,ZHANG J W,TIAN C Q,et al.Survey on Lear-ning-to-Rank Based Recommendation Algorithms [J].Journal of Software,2016,27(3):691-713.(in Chinese) 黄震华,张佳雯,田春岐,等.基于排序学习的推荐算法研究综述[J].软件学报,2016,7(3):691-713.
[2] GUO L,MA J,CHEN Z,et al.Learning to Recommend with Social Contextual Information from Implicit Feedback[J].Soft Computing,2015,19(5):1351-1362.
[3] LIU L,LU X,LIAO Y,et al.Improving Retrieval of PlaneGeometry Figure with Learning to Rank[J].Pattern Recognition Letters,2016,83(3):423-429.
[4] http://research.microsoft.com/en-us/projects/ mslr/ feature.aspx.
[5] PAN F,CONVERSE T,AHN D,et al.Greedy and Randomized Feature Selection for Web Search Ranking[C]∥Proceedings of 11th IEEE International Conference on Computer and Information Technology.Sydney:IEEE Press,2011:436-442.
[6] JRVELIN K,KEKLINEN J.Cumulated Gain-based Eva-luation of IR Techniques[J].ACM Transactions on Information Systems,2002,20(4):422-446.
[7] YATES R B,NETO B R.Modern Information Retrieval[M].New York:Addison Weskey,1999.
[8] GENG X,LIU T,QIN T.Feature Selection for Ranking[C]∥Sigir:International ACM SIGIR Conference on Research & Development in Information Retrieval.New York:ACM,2007:407-414.
[9] DANG V,CROFT W B.Feature Selection for Document Ran-king using Best First Search and Coordinate Ascent [C]∥Proceedings of SIGIR Workshop Feature Generation and Selection of Information Retrieval.2010:1-5.
[10] LI C,SHAO L,XU C S,et al.Feature selection under learning to rank model for multimedia retrieval[C]∥Proceedings of 2nd International Conference of Internet Multimedia Computer Ser-vice.2010:69-72.
[11] DA SILVA S R F,RIBEIRO M X,NETO J E S B,et al.Improving the Ranking Quality of Medical Image Retrieval using a Genetic Feature Selection Method[J].Decision Support System,2011,5(4):810-820.
[12] LAI H,PAN Y,TANG Y,et al.FSMRank:Feature Selection Algorithm for Learning to Rank[J].IEEE Transaction on Neural Networks and Learning Systems,2013,24(6):940-952.
[13] HUA G C,ZHANG M,KUANG D,et al.Feature AnalysisMethods for Learning to Rank[J].Computer Engineering and Applications,2011,47(17):122-127.(in Chinese) 花贵春,张敏,邝达,等.面向排序学习的特征分析的研究[J].计算机工程与应用,2011,47(17):122-127.
[14] LIN Y.Research of Learning to Rank in Information Retrieval[D].Dalian:Dalian University of Technology,2012.(in Chinese) 林原.信息检索中排序学习方法的研究[D].大连:大连理工大学,2012.
[15] WU C G,LIANG Y Y,SUN Y F,et al.On the Equivalence of SVD and PCA[J].Chinese Journal of Computers,2004,7(2):286-288.(in Chinese) 吴春国,梁艳养,孙延风,等.关于SVD与PCA等价性的研究[J].计算机学报,2004,7(2):286-288.
[16] ZHANG C.Research on Matrix Factorization Based Collaborative Filtering Recommendation Algorithms[D].Changchun:Jinlin University,2013.(in Chinese) 张川.基于矩阵分解的协同过滤推荐算法研究[D].长春:吉林大学,2013.
[17] HILLERMEIER C.Nonlinear Multiobjective Optimization[M].Birkhaüser Verlag,Kluwer Academic Publishers,2001.
[18] RENDLE S,FREUDENTHALER C,GANTNER Z,et al.Bayesian Personalized Ranking from Implicit Feedback[C]∥Proceedings of the Twenty-fifth Conference on Uncertainty in Artificial Intelligence.Arlington:AUAI Press,2009:452-461.
[19] QIN T,LIU T,XU J,et al.LETOR:A Benchmark Collectionfor Research on Learning to Rank for Information Retrieval[J].Information Retrieval Journal,2010,13(4):346-374.
[20] CAO Z,QIN T,LIU T,et al.Learning to Rank:From Pairwise Approach to Listwise Approach[C]∥Proceedings of 24th International Conference of Machine Learning.New York:ACM,2007:129-136.
[21] JOACHIMS T.Training Linear SVMs in Linear Time[C]∥Proceedings of 12th ACM SIGKDD International Conference of Knowledge Discovery Data Mining.New York:ACM,2006:217-226.
[22] FREUND Y,IYER R,SCHAPIRE R,et al.An Efficient Boosting Algorithm for Combining Preferences[J].Journal of Machine Learning Research,2003,4(11):933-969.
[23] XU J,LI H.AdaRank:A Boosting Algorithm for Information Retrieval[C]∥Proceedings of 30th Annual International ACM SIGIR Conference Research & Develop in Information Retrie-val.New York,ACM,2007:391-398.

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
[1] LEI Li-hui and WANG Jing. Parallelization of LTL Model Checking Based on Possibility Measure[J]. Computer Science, 2018, 45(4): 71 -75, 88 .
[2] XIA Qing-xun and ZHUANG Yi. Remote Attestation Mechanism Based on Locality Principle[J]. Computer Science, 2018, 45(4): 148 -151, 162 .
[3] LI Bai-shen, LI Ling-zhi, SUN Yong and ZHU Yan-qin. Intranet Defense Algorithm Based on Pseudo Boosting Decision Tree[J]. Computer Science, 2018, 45(4): 157 -162 .
[4] WANG Huan, ZHANG Yun-feng and ZHANG Yan. Rapid Decision Method for Repairing Sequence Based on CFDs[J]. Computer Science, 2018, 45(3): 311 -316 .
[5] SUN Qi, JIN Yan, HE Kun and XU Ling-xuan. Hybrid Evolutionary Algorithm for Solving Mixed Capacitated General Routing Problem[J]. Computer Science, 2018, 45(4): 76 -82 .
[6] ZHANG Jia-nan and XIAO Ming-yu. Approximation Algorithm for Weighted Mixed Domination Problem[J]. Computer Science, 2018, 45(4): 83 -88 .
[7] WU Jian-hui, HUANG Zhong-xiang, LI Wu, WU Jian-hui, PENG Xin and ZHANG Sheng. Robustness Optimization of Sequence Decision in Urban Road Construction[J]. Computer Science, 2018, 45(4): 89 -93 .
[8] LIU Qin. Study on Data Quality Based on Constraint in Computer Forensics[J]. Computer Science, 2018, 45(4): 169 -172 .
[9] ZHONG Fei and YANG Bin. License Plate Detection Based on Principal Component Analysis Network[J]. Computer Science, 2018, 45(3): 268 -273 .
[10] SHI Wen-jun, WU Ji-gang and LUO Yu-chun. Fast and Efficient Scheduling Algorithms for Mobile Cloud Offloading[J]. Computer Science, 2018, 45(4): 94 -99, 116 .