An effective and scalable framework for authorship attribution query processing
dc.contributor.author | Sarwar, R | |
dc.contributor.author | Yu, C | |
dc.contributor.author | Tungare, N | |
dc.contributor.author | Chitavisutthivong, K | |
dc.contributor.author | Sriratanawilai, S | |
dc.contributor.author | Xu, Y | |
dc.contributor.author | Chow, D | |
dc.contributor.author | Rakthanmanon, T | |
dc.contributor.author | Nutanong, S | |
dc.date.accessioned | 2020-10-12T10:14:26Z | |
dc.date.available | 2020-10-12T10:14:26Z | |
dc.date.issued | 2018-09-10 | |
dc.identifier.citation | Sarwar, R., Yu, C., Tungare, N., Chitavisutthivong, K., Sriratanawilai, S., Xu, Y., Chow, D., Rakthanmanon, T. and Nutanong,, S. (2018) An effective and scalable framework for authorship attribution query processing, IEEE Access, 6, pp. 50030-50048. | en |
dc.identifier.issn | 2169-3536 | en |
dc.identifier.doi | 10.1109/ACCESS.2018.2869198 | en |
dc.identifier.uri | http://hdl.handle.net/2436/623705 | |
dc.description | © 2018 The Authors. Published by IEEE. This is an open access article available under a Creative Commons licence. The published version can be accessed at the following link on the publisher’s website: https://ieeexplore.ieee.org/document/8457490 | en |
dc.description.abstract | Authorship attribution aims at identifying the original author of an anonymous text from a given set of candidate authors and has a wide range of applications. The main challenge in authorship attribution problem is that the real-world applications tend to have hundreds of authors, while each author may have a small number of text samples, e.g., 5-10 texts/author. As a result, building a predictive model that can accurately identify the author of an anonymous text is a challenging task. In fact, existing authorship attribution solutions based on long text focus on application scenarios, where the number of candidate authors is limited to 50. These solutions generally report a significant performance reduction as the number of authors increases. To overcome this challenge, we propose a novel data representation model that captures stylistic variations within each document, which transforms the problem of authorship attribution into a similarity search problem. Based on this data representation model, we also propose a similarity query processing technique that can effectively handle outliers. We assess the accuracy of our proposed method against the state-of-the-art authorship attribution methods using real-world data sets extracted from Project Gutenberg. Our data set contains 3000 novels from 500 authors. Experimental results from this paper show that our method significantly outperforms all competitors. Specifically, as for the closed-set and open-set authorship attribution problems, our method have achieved higher than 95% accuracy. | en |
dc.description.sponsorship | This work was supported by the CityU Project under Grant 7200387 and Grant 6000511. | en |
dc.format | application/pdf | en |
dc.language.iso | en | en |
dc.publisher | Institute of Electrical and Electronics Engineers (IEEE) | en |
dc.relation.url | https://ieeexplore.ieee.org/document/8457490 | en |
dc.subject | large scale database | en |
dc.subject | similarity search | en |
dc.subject | query processing | en |
dc.subject | stylometry | en |
dc.title | An effective and scalable framework for authorship attribution query processing | en |
dc.type | Journal article | en |
dc.identifier.eissn | 2169-3536 | |
dc.identifier.journal | IEEE Access | en |
dc.date.updated | 2020-10-07T17:10:58Z | |
dc.date.accepted | 2018-08-28 | |
rioxxterms.funder | CityU Project | en |
rioxxterms.identifier.project | 7200387 | en |
rioxxterms.identifier.project | 6000511 | en |
rioxxterms.version | VoR | en |
rioxxterms.licenseref.uri | https://creativecommons.org/licenses/by/4.0/ | en |
rioxxterms.licenseref.startdate | 2020-10-12 | en |
dc.source.volume | 6 | |
dc.source.beginpage | 50030 | |
dc.source.endpage | 50048 | |
dc.description.version | Published version | |
refterms.dateFCD | 2020-10-12T10:12:54Z | |
refterms.versionFCD | VoR | |
refterms.dateFOA | 2020-10-12T10:14:27Z |