NDLI: Voting algorithm in the play Julius Caesar

Content Provider	IEEE Xplore Digital Library
Author	Lotker, Zvi
Copyright Year	2015
Description	Author affiliation: Department of Communication Systems Engineering, Ben-Gurion University of the Negev, Israel. and Dept. of Computer Science Univ. Paris Diderot France (Lotker, Zvi)
Abstract	This paper suggests a voting algorithm for predicting people's choices. Usually, once a new algorithm is offered, one needs to prove the soundness of the algorithm, i.e., showing that the algorithm does the thing it is set up to do. But in the case of election prediction algorithms it's not clear how to prove their soundness. This paper offers a way to deal with this problem by analysing the social networks of plays, following Shakespeare dictum: "all the world is a stage, and all the men and women merely players", As you like it, act I scene VII. The advantage of this approach is clear. The story of Julius Caesar is part of our collective memory. We learn the leading characters views and opinions throughout the play. For example, we know that Brutus was against Caesar, while Antony supported Caesar, and opposed Brutus. By generating the social graph from a play, the problems of soundness is solved, which makes the process more scientific. The voting algorithm needs anchors for each party. The anchors are the characters/nodes whose opinions are clear and known. In the case of the play Julius Caesar, the anchors are Brutus and Cassius for the conspirators and Antony and Octavius for the supporters of Caesar. After the anchors were identified the voting algorithm uses simple random walks, to divide the network of characters into two parties. Now it is possible to examine the output of the voting algorithm and see that indeed the algorithm works correctly.
Starting Page	848
Ending Page	855
File Size	3098165
Page Count	8
File Format	PDF
ISBN	9781450338547
DOI	10.1145/2808797.2810064
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2015-08-25
Publisher Place	France
Access Restriction	Subscribed
Rights Holder	Association for Computing Machinery, Inc. (ACM)
Subject Keyword	Algorithm design and analysis Privacy Social network services Heuristic algorithms Nominations and elections Prediction algorithms Classification 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

Voting algorithm in the play Julius Caesar

Rank Aggregation Algorithms Based on Voting Model for Metasearch

A bi-directional election algorithm based on ring topology

Edge Anonymity in Social Network Graphs

iDBMM: A Novel Algorithm to Model Dynamic Behavior in Large Evolving Graphs

A Distributed Link Prediction Algorithm Based on Clustering in Dynamic Social Networks

Core Network Based Multi-label Classification in Large-Scale Social Network Environments

Improved Ant Colony Algorithm for Finding the Maximum Clique in Social Network

Link prediction algorithm for co-authorship networks using Neural Network

Voting algorithm in the play Julius Caesar

Similar Documents

Voting algorithm in the play Julius Caesar

Rank Aggregation Algorithms Based on Voting Model for Metasearch

A bi-directional election algorithm based on ring topology

Edge Anonymity in Social Network Graphs

iDBMM: A Novel Algorithm to Model Dynamic Behavior in Large Evolving Graphs

A Distributed Link Prediction Algorithm Based on Clustering in Dynamic Social Networks

Core Network Based Multi-label Classification in Large-Scale Social Network Environments

Improved Ant Colony Algorithm for Finding the Maximum Clique in Social Network

Link prediction algorithm for co-authorship networks using Neural Network

Voting algorithm in the play Julius Caesar