NDLI: Parallel rank aggregation for theWorld Wide Web

Content Provider	IEEE Xplore Digital Library
Author	Sufyan Beg, M.M.
Copyright Year	2004
Description	Author affiliation: Dept. of Comput. Eng., AMU, Aligarh, India (Sufyan Beg, M.M.)
Abstract	Rank aggregation is the problem of generating a "consensus" ranking for a given set of rankings. When applied to the Web, this finds applications in meta-searching, spam fighting and word association techniques. The rank aggregation obtained by optimizing the Spearman footrule distance is called footrule optimal aggregation (FOA), and it also satisfies the Condorcet property. We find in literature a polynomial time algorithm to compute the FOA for full lists. However, when dealing with the results from various search engines, the lists are almost invariably always the partial ones. The FOA for partial lists is NP-hard. This NP-hard nature of partial footrule optimal aggregation problem (PFOA) motivates us to apply genetic algorithm (GA) for the PFOA problem. The GA based technique may take long to compute, but we propose to decide upon the number of generations of GA based on the time limit allowed by the user. Moreover, the inherent parallelism of GA is also utilized to speed up the processing. For GA based rank aggregation, we depart from having the pool of chromosomes represented in binary to those represented in decimal itself. We achieve crossover by carrying out multiplication of permutations. For mutation, the to-be-mutated digit is exchanged with any other randomly selected digit in that very permutation. For experimental procedure falls in line with the ones found in literature. The results for rank aggregation using genetic algorithm are much better, as compared to the ones obtained using the classical Borda's method of rank aggregation.
Sponsorship	Faculty of Eng., Univ. of Melbourne IEEE Madras Section, Chennai
Starting Page	385
Ending Page	390
File Size	566899
Page Count	6
File Format	PDF
ISBN	0780382439
DOI	10.1109/ICISIP.2004.1287688
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2004-01-04
Publisher Place	India
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Concurrent computing Databases Genetic mutations Web pages Search engines Parallel processing Web sites Application software Biological cells Genetic algorithms
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in