%0 Journal Article %1 ASI:ASI20961 %A Koppel, Moshe %A Schler, Jonathan %A Argamon, Shlomo %D 2009 %I Wiley Subscription Services, Inc., A Wiley Company %J Journal of the American Society for Information Science and Technology %K authorIdentification computationMethods kddcup13 %N 1 %P 9--26 %R 10.1002/asi.20961 %T Computational methods in authorship attribution %U http://dx.doi.org/10.1002/asi.20961 %V 60 %X Statistical authorship attribution has a long history, culminating in the use of modern machine learning classification methods. Nevertheless, most of this work suffers from the limitation of assuming a small closed set of candidate authors and essentially unlimited training text for each. Real-life authorship attribution problems, however, typically fall short of this ideal. Thus, following detailed discussion of previous work, three scenarios are considered here for which solutions to the basic attribution problem are inadequate. In the first variant, the profiling problem, there is no candidate set at all; in this case, the challenge is to provide as much demographic or psychological information as possible about the author. In the second variant, the needle-in-a-haystack problem, there are many thousands of candidates for each of whom we might have a very limited writing sample. In the third variant, the verification problem, there is no closed candidate set but there is one suspect; in this case, the challenge is to determine if the suspect is or is not the author. For each variant, it is shown how machine learning methods can be adapted to handle the special challenges of that variant.

@article{ASI:ASI20961, abstract = {Statistical authorship attribution has a long history, culminating in the use of modern machine learning classification methods. Nevertheless, most of this work suffers from the limitation of assuming a small closed set of candidate authors and essentially unlimited training text for each. Real-life authorship attribution problems, however, typically fall short of this ideal. Thus, following detailed discussion of previous work, three scenarios are considered here for which solutions to the basic attribution problem are inadequate. In the first variant, the profiling problem, there is no candidate set at all; in this case, the challenge is to provide as much demographic or psychological information as possible about the author. In the second variant, the needle-in-a-haystack problem, there are many thousands of candidates for each of whom we might have a very limited writing sample. In the third variant, the verification problem, there is no closed candidate set but there is one suspect; in this case, the challenge is to determine if the suspect is or is not the author. For each variant, it is shown how machine learning methods can be adapted to handle the special challenges of that variant.}, added-at = {2013-04-18T16:38:46.000+0200}, author = {Koppel, Moshe and Schler, Jonathan and Argamon, Shlomo}, biburl = {https://www.bibsonomy.org/bibtex/275ade90bbd0b2f2d4685f91872435a1c/asmelash}, description = {Computational methods in authorship attribution - Koppel - 2008 - Journal of the American Society for Information Science and Technology - Wiley Online Library}, doi = {10.1002/asi.20961}, interhash = {61cf0501a113d337a6cb2f9d80c753bb}, intrahash = {75ade90bbd0b2f2d4685f91872435a1c}, issn = {1532-2890}, journal = {Journal of the American Society for Information Science and Technology}, keywords = {authorIdentification computationMethods kddcup13}, number = 1, pages = {9--26}, publisher = {Wiley Subscription Services, Inc., A Wiley Company}, timestamp = {2013-04-18T16:38:46.000+0200}, title = {Computational methods in authorship attribution}, url = {http://dx.doi.org/10.1002/asi.20961}, volume = 60, year = 2009 }