Sequential Rank Aggregation Method

Yu Ling Lin, Salem Chakhar, Rui Yang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Rank aggregation is a fundamental technique of different application domains. In this paper, we propose a new rank aggregation method. This method models the rank aggregation problem as an assignment problem and solves it by integer programming, where the objective function is set to minimize the sum of the squared Euclidean Distance between each initial ranking and the aggregated ranking. To avoid the computational limitation in working with large datasets, a sequential aggregation approach has been adopted. This approach proceeds sequentially in several steps. In each step, only two rankings are aggregated. It thus reduces the computational limitation of the proposed method. An illustration of the proposed method using datasets of green car adoption in Taiwan is presented in this paper. The results show that the proposed method can solve the rank aggregation problem effectively and efficiently.

Original languageEnglish
Title of host publicationProceedings - 2018 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2018
PublisherIEEE
Pages3194-3200
Number of pages7
ISBN (Electronic)9781538666500
DOIs
Publication statusPublished - 16 Jan 2019
Event2018 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2018 - Miyazaki, Japan
Duration: 7 Oct 201810 Oct 2018

Conference

Conference2018 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2018
CountryJapan
CityMiyazaki
Period7/10/1810/10/18

Keywords

  • distance measure
  • optimization
  • rank aggregation
  • ranking function

ASJC Scopus subject areas

  • Information Systems
  • Information Systems and Management
  • Health Informatics
  • Artificial Intelligence
  • Computer Networks and Communications
  • Human-Computer Interaction

Cite this

Lin, Y. L., Chakhar, S., & Yang, R. (2019). Sequential Rank Aggregation Method. In Proceedings - 2018 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2018 (pp. 3194-3200). [8616538] IEEE. https://doi.org/10.1109/SMC.2018.00541

Sequential Rank Aggregation Method. / Lin, Yu Ling; Chakhar, Salem; Yang, Rui.

Proceedings - 2018 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2018. IEEE, 2019. p. 3194-3200 8616538.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Lin, YL, Chakhar, S & Yang, R 2019, Sequential Rank Aggregation Method. in Proceedings - 2018 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2018., 8616538, IEEE, pp. 3194-3200, 2018 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2018, Miyazaki, Japan, 7/10/18. https://doi.org/10.1109/SMC.2018.00541
Lin YL, Chakhar S, Yang R. Sequential Rank Aggregation Method. In Proceedings - 2018 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2018. IEEE. 2019. p. 3194-3200. 8616538 https://doi.org/10.1109/SMC.2018.00541
Lin, Yu Ling ; Chakhar, Salem ; Yang, Rui. / Sequential Rank Aggregation Method. Proceedings - 2018 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2018. IEEE, 2019. pp. 3194-3200
@inproceedings{326ba64854854c1f87c1580a4fd9c50d,
title = "Sequential Rank Aggregation Method",
abstract = "Rank aggregation is a fundamental technique of different application domains. In this paper, we propose a new rank aggregation method. This method models the rank aggregation problem as an assignment problem and solves it by integer programming, where the objective function is set to minimize the sum of the squared Euclidean Distance between each initial ranking and the aggregated ranking. To avoid the computational limitation in working with large datasets, a sequential aggregation approach has been adopted. This approach proceeds sequentially in several steps. In each step, only two rankings are aggregated. It thus reduces the computational limitation of the proposed method. An illustration of the proposed method using datasets of green car adoption in Taiwan is presented in this paper. The results show that the proposed method can solve the rank aggregation problem effectively and efficiently.",
keywords = "distance measure, optimization, rank aggregation, ranking function",
author = "Lin, {Yu Ling} and Salem Chakhar and Rui Yang",
year = "2019",
month = "1",
day = "16",
doi = "10.1109/SMC.2018.00541",
language = "English",
pages = "3194--3200",
booktitle = "Proceedings - 2018 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2018",
publisher = "IEEE",
address = "USA United States",

}

TY - GEN

T1 - Sequential Rank Aggregation Method

AU - Lin, Yu Ling

AU - Chakhar, Salem

AU - Yang, Rui

PY - 2019/1/16

Y1 - 2019/1/16

N2 - Rank aggregation is a fundamental technique of different application domains. In this paper, we propose a new rank aggregation method. This method models the rank aggregation problem as an assignment problem and solves it by integer programming, where the objective function is set to minimize the sum of the squared Euclidean Distance between each initial ranking and the aggregated ranking. To avoid the computational limitation in working with large datasets, a sequential aggregation approach has been adopted. This approach proceeds sequentially in several steps. In each step, only two rankings are aggregated. It thus reduces the computational limitation of the proposed method. An illustration of the proposed method using datasets of green car adoption in Taiwan is presented in this paper. The results show that the proposed method can solve the rank aggregation problem effectively and efficiently.

AB - Rank aggregation is a fundamental technique of different application domains. In this paper, we propose a new rank aggregation method. This method models the rank aggregation problem as an assignment problem and solves it by integer programming, where the objective function is set to minimize the sum of the squared Euclidean Distance between each initial ranking and the aggregated ranking. To avoid the computational limitation in working with large datasets, a sequential aggregation approach has been adopted. This approach proceeds sequentially in several steps. In each step, only two rankings are aggregated. It thus reduces the computational limitation of the proposed method. An illustration of the proposed method using datasets of green car adoption in Taiwan is presented in this paper. The results show that the proposed method can solve the rank aggregation problem effectively and efficiently.

KW - distance measure

KW - optimization

KW - rank aggregation

KW - ranking function

UR - http://www.scopus.com/inward/record.url?scp=85062223914&partnerID=8YFLogxK

U2 - 10.1109/SMC.2018.00541

DO - 10.1109/SMC.2018.00541

M3 - Conference contribution

SP - 3194

EP - 3200

BT - Proceedings - 2018 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2018

PB - IEEE

ER -