Variable Neighborhood Search and Tabu Search for the Web Service Selection Problem

Turajlić, Nina; Nešković, Siniša

doi:10.1016/j.endm.2012.10.024

Cited by 3 publications

(1 citation statement)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Yin and Guo proposed a new formulation for the website structure optimization (WSO) problem based on a comprehensive survey of existing works and practice considerations [7]. In [8], the greedy-add algorithm with backtracking was introduced for obtaining the initial solution, and a better solution is sought through VNS as well as tabu search. Dr. Chen et al presented a page clipping synthesis (PCS) search method to extract relevant paragraphs from other web search results [9].…”

Section: Related Workmentioning

confidence: 99%

An Efficient Web Usage Mining Approach Using Chaos Optimization and Particle Swarm Optimization Algorithm Based on Optimal Feedback Model

Dai

Wang

Shu

2013

Mathematical Problems in Engineering

View full text Add to dashboard Cite

The dynamic nature of information resources as well as the continuous changes in the information demands of the users has made it very difficult to provide effective methods for data mining and document ranking. This paper proposes an efficient particle swarm chaos optimization mining algorithm based on chaos optimization and particle swarm optimization by using feedback model of user to provide a listing of best-matching webpages for user. The proposed algorithm starts with an initial population of many particles moving around in aD-dimensional search space where each particle vector corresponds to a potential solution of the underlying problem, which is formed by subsets of webpages. Experimental results show that our approach significantly outperforms other algorithms in the aspects of response time, execution time, precision, and recall.

show abstract

Section: Related Workmentioning

confidence: 99%