Neural Computing and Applications

, Volume 31, Supplement 1, pp 77–92 | Cite as

An efficient top-k ranking method for service selection based on ε-ADMOPSO algorithm

  • Wei YuEmail author
  • Shijun Li
  • Xiaoyue Tang
  • Kai Wang
S.I. : Machine Learning Applications for Self-Organized Wireless Networks


One of the main concerns in rank aggregation tasks for metasearch service is how to retrieve and aggregate the large-scale candidate search results efficiently. Much work has been done to implement metasearch service engines with different rank aggregation algorithms. However, the performance of these metasearch engines can hardly be improved. In this paper, we transform the top-k ranking task into a multi-objective programming problem when user preferences are considered along with user queries. We build an improved discrete multi-objective programming model to make the aggregate rankings satisfy user queries and user preferences both, and then propose a user preferences-based rank aggregation algorithm accordingly. Based on discrete particle swarm optimization algorithm, we improve the encoding scheme, the initialization methods, the position and velocity definition, the integrating updating process, the turbulence operator, and the external archive updating and leader selection strategy to make sure the candidate results that fit the user’s preferences can be located quickly and accurately in a large-scale discrete solution space. We have our proposed algorithm tested on three different benchmark datasets: a public dataset, the real-world datasets and the synthetic simulation datasets. The experimental results demonstrate the efficacy and convergence efficiency of the proposed algorithm over the baseline rank aggregation methods especially when dealing with large amount of candidate results. And when the set of candidate results is of normal size, the proposed algorithm is proved to perform not worse than the baseline methods.


Top-k ranking IOT metasearch User preference Multi-objective optimization problem Particle swarm optimization 



This research is based upon work supported in part by the National Natural Science Foundation of China (Nos. 61502350, 61272109). The authors would like to thank the support of the Database and Information Retrieval Laboratory and the Department of Computer Science of Binghamton University of SUNY. And we would like to thank China Scholarship Council. The views and conclusions contained herein are those of the authors and should not be interpreted as necessarily representing the official policies or endorsements, either expressed or implied, of any of the above organizations or any person connected with them.


  1. 1.
    Desarkar MS, Sarkar S, Mitra P (2016) Preference relations based unsupervised rank aggregation for metasearch. Expert Syst Appl 49:86–98CrossRefGoogle Scholar
  2. 2.
    Ozdemiray AM, Altingovde IS (2015) Explicit search result diversification using score and rank aggregation methods. J Assoc Inf Sci Technol 66(6):1212–1228CrossRefGoogle Scholar
  3. 3.
    Ali R, Naim I (2015) User feedback based metasearching using neural network. Int J Mach Learn Cybern 6(2):265–275CrossRefGoogle Scholar
  4. 4.
    Li L, Xu G, Zhang Y, Kitsuregawa M (2011) Random walk based rank aggregation to improving web search. Knowl Based Syst 24(7):943–951CrossRefGoogle Scholar
  5. 5.
    Keyhanipour AH, Moshiri B, Kazemian M, Piroozmand M, Lucas C (2007) Aggregation of web search engines based on users’ preferences in WebFusion. Knowl Based Syst 20(4):321–328CrossRefGoogle Scholar
  6. 6.
    Amin GR, Emrouznejad A, Sadeghi H (2012) Metasearch information fusion using linear programming. Rairo Oper Res 46(04):289–303MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Meng W, Wu Z, Yu C, Li Z (2001) A highly scalable and effective method for metasearch. ACM Trans Inf Syst (TOIS) 19(3):310–335CrossRefGoogle Scholar
  8. 8.
    Amin GR, Emrouznejad A (2011) Optimizing search engines results using linear programming. Expert Syst Appl 38(9):11534–11537CrossRefGoogle Scholar
  9. 9.
    Dwork C, Kumar R, Naor M, Sivakumar D (2001) Rank aggregation methods for the web. ACM, pp 613–622Google Scholar
  10. 10.
    Coppersmith D, Fleischer LK, Rurda A (2010) Ordering by weighted number of wins gives a good ranking for weighted tournaments. ACM Trans Algorithms (TALG) 6(3):55MathSciNetzbMATHGoogle Scholar
  11. 11.
    Montague M, Aslam JA (2002) Condorcet fusion for improved retrieval. CIKM, pp 538–548Google Scholar
  12. 12.
    Wu S, Li J, Zeng X, Bi Y (2014) Adaptive data fusion methods in information retrieval. J Assoc Inf Sci Technol 65(10):2048–2061CrossRefGoogle Scholar
  13. 13.
    Klementiev A, Roth D, Small K, Titov I (2009) Unsupervised rank aggregation with domain-specific expertise. IJCAI, pp 1101–1106Google Scholar
  14. 14.
    Qin T, Geng X, Liu TY (2010) A new probabilistic model for rank aggregation. In: Advances in neural information processing systems, pp 1948–1956Google Scholar
  15. 15.
    Wang Y, Huang Y, Pang X, Lu M, Xie M, Liu J (2013) Supervised rank aggregation based on query similarity for document retrieval. Soft Comput 17(3):421–429CrossRefGoogle Scholar
  16. 16.
    Chen Y, Hofmann K (2015) Online learning to rank: absolute vs. relative. In: WWW companion, pp 19–20Google Scholar
  17. 17.
    Keyhanipour AH, Moshiri B, Rahgozar M (2015) CF-rank: learning to rank by classifier fusion on click-through data. Expert Syst Appl 42(22):8597–8608CrossRefGoogle Scholar
  18. 18.
    Attiya G, Hamam Y (2006) Task allocation for maximizing reliability of distributed systems: a simulated annealing approach. J Parallel Distrib Comput 66(10):1259–1266CrossRefzbMATHGoogle Scholar
  19. 19.
    Falzon G, Li M (2012) Enhancing genetic algorithms for dependent job scheduling in grid computing environments. J Supercomput 62(1):290–314CrossRefGoogle Scholar
  20. 20.
    Moradi P, Rostami M (2015) Integration of graph clustering with ant colony optimization for feature selection. Knowl Based Syst 84:144–161CrossRefGoogle Scholar
  21. 21.
    Carrasco R, Pham A, Gallego M, Gortázar F, Martí R, Duarte A (2015) Tabu search for the max–mean dispersion problem. Knowl Based Syst 85:256–264CrossRefGoogle Scholar
  22. 22.
    Wang L, Geng H, Liu P, Lu K, Kolodziej J, Ranjan R, Zomaya AY (2015) Particle swarm optimization based dictionary learning for remote sensing big data. Knowl Based Syst 79:43–50CrossRefGoogle Scholar
  23. 23.
    Kennedy J, Eberhart RC (1997) A discrete binary version of the particle swarm algorithm. In: IEEE international conference on systems, man and cybernetics, vol 5, pp 4104–4108Google Scholar
  24. 24.
    Sha DY, Hsu CY (2006) A hybrid particle swarm optimization for job shop scheduling problem. Comput Ind Eng 51(4):791–808CrossRefGoogle Scholar
  25. 25.
    Mitrović M, Tadić B (2009) Spectral and dynamical properties in classes of sparse networks with mesoscopic inhomogeneities. Phys Rev E 80(2):026123CrossRefGoogle Scholar
  26. 26.
    Chen WN, Zhang J, Chung HS, Zhong WL, Wu WG, Shi YH (2010) A novel set-based particle swarm optimization method for discrete optimization problems. IEEE Trans Evol Comput 14(2):278–300CrossRefGoogle Scholar
  27. 27.
    Liu H, Abraham A, Hassanien AE (2010) Scheduling jobs on computational grids using a fuzzy particle swarm optimization algorithm. Future Gener Comput Syst 26(8):1336–1343CrossRefGoogle Scholar
  28. 28.
    Izakian H, Ladani BT, Zamanifar K, Abraham A (2009) A novel particle swarm optimization approach for grid job scheduling. ICSTM, pp 100–109Google Scholar
  29. 29.
    Wei Y, Shijun L (2018) Recommender systems based on multiple social networks correlation. Future Gener Comput Syst 87:312–327CrossRefGoogle Scholar
  30. 30.
    Zhao Y, Shen B (2016) Empirical study of user preferences based on rating data of movies. PloS one. 11(1):e0146541CrossRefGoogle Scholar
  31. 31.
    Nejat A, Mirzabeygi P, Panahi MS (2014) Airfoil shape optimization using improved multiobjective territorial particle swarm algorithm with the objective of improving stall characteristics. Struct Multidiscip Optim 49(6):953–967MathSciNetCrossRefGoogle Scholar
  32. 32.
    De-la-Torre M, Granger E, Sabourin R, Gorodnichy DO (2015) An adaptive ensemble-based system for face recognition in person re-identification. Mach Vis Appl 26(6):741–773CrossRefGoogle Scholar
  33. 33.
    Ahmadi A (2016) Memory-based adaptive partitioning (MAP) of search space for the enhancement of convergence in Pareto-based multi-objective evolutionary algorithms. Appl Soft Comput 41:400–417CrossRefGoogle Scholar
  34. 34.
    Yahui H, Shijun L, Wei Y, Sha Y, Lin G, Kai W, Qiqing F (2015) Recognizing the same commodity entities in big data. J Comput Res Dev 52(8):1794–1805Google Scholar
  35. 35.
    Mostaghim S, Teich J (2003) Strategies for finding good local guides in multi-objective particle swarm optimization (MOPSO). In: Swarm intelligence symposium, SIS, pp 26–33Google Scholar
  36. 36.
    Villalobos-Arias MA, Pulido GT, Coello CA (2005) A proposal to use stripes to maintain diversity in a multi-objective particle swarm optimizer. In: Swarm intelligence symposium, SIS, pp 22–29Google Scholar
  37. 37.
    Serrano W, Gelenbe E (2018) The random neural network in a neurocomputing application for web search. Neurocomputing 280(1):123–134CrossRefGoogle Scholar
  38. 38.
    Desarkar MS, Sarkar S, Mitra P (2016) Preference relations based unsupervised rank aggregation for metasearch. Expert Syst Appl 49:86–98CrossRefGoogle Scholar
  39. 39.
    Kirlik G, Sayın S (2015) Computing the nadir point for multiobjective discrete optimization problems. J Glob Optim 62(1):79–99MathSciNetCrossRefzbMATHGoogle Scholar
  40. 40.
    Kaur M, Kadam S (2018) A novel multi-objective bacteria foraging optimization algorithm (MOBFOA) for multi-objective scheduling. Appl Soft Comput 66:183–195CrossRefGoogle Scholar
  41. 41.
    Buzaglo S, Etzion T (2015) Bounds on the size of permutation codes with the Kendall-metric. IEEE Trans Inf Theory 61(6):3241–3250MathSciNetCrossRefzbMATHGoogle Scholar
  42. 42.
    Clémençon S, Jakubowicz J (2010) Kantorovich distances between rankings with applications to rank aggregation. ECML-PKDD, pp 248–263Google Scholar
  43. 43.
    Tavana M, Li Z, Mobin M, Komaki M, Teymourian E (2016) Multi-objective control chart design optimization using NSGA-III and MOPSO enhanced with DEA and TOPSIS. Expert Syst Appl 50:17–39CrossRefGoogle Scholar
  44. 44.
    Zitzler E, Thiele L (1999) Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach. IEEE Trans Evol Comput 3(4):257–271CrossRefGoogle Scholar
  45. 45.
    Wei Y, Shijun L (2018) Research on financial data analysis based on data mining algorithm. In: Concurrency and computation: practice and experienceGoogle Scholar

Copyright information

© The Natural Computing Applications Forum 2018

Authors and Affiliations

  1. 1.Computer SchoolWuhan UniversityWuhanChina
  2. 2.School Mathematics and Computer ScienceWuhan Polytechnic UniversityWuhanChina
  3. 3.Department of Computer ScienceBinghamton University of SUNYBinghamtonUSA

Personalised recommendations