loading content..

Kateryna Kaplun

Research Areas

Technology
White Collar Crime
Cyber-crime

Bio

Kateryna Kaplun is a third year PhD Student in the School of Criminal Justice at Rutgers University – Newark. She received her BA in Justice Studies and BS in Mathematics in 2017 and her MS in Statistics in 2018 from Montclair State University. Her research interests include cybercrime, surveillance, technology, white-collar crime, and mixed methods analyses. She is currently interested in the intersection of technology and gender, focusing on cyberstalking and cyberharassment statutes in the United States.


Publication

Lageson, S. and Kaplun, K. (2021). “Public Accusation on the Internet.” In Media and Law: Between Free Speech and Censorship, Sociology of Crime, Law, and Deviance, Volume 26. Deflem, Mathieu and Derek M.D. Silva, eds. Bingley, UK: Emerald Publishing.

Leberknight, C., Kaplun, K., & Feldman, A. (2018). Controversy and sentiment: An exploratory study. Proceedings of the 10th Hellenic Conference on Artificial Intelligence, Patras, Greece.
https://www.researchwithnj.com/en/publications/controversy-and-sentiment-an-exploratory-study

Kaplun, K., Leberknight, C., &Feldman, A. (2018). A comparison of Lexicons for detecting controversy. Proceedings of Natural Language Processing meets Journalism, LREC Workshop, Miyazaki, Japan.
https://cris.fbk.eu/retrieve/handle/11582/314299/24118/book_of_proceedings.pdf;jsessionid=CA6088EA9B4DC550E18D4CC2B942E93B.suir-fbk-prod-01

Kaplun, K. (2018). Classifying controversiality in article data. (Master Thesis). Montclair, NJ. Advisor: Dr. Christopher Leberknight.
https://digitalcommons.montclair.edu/etd/133/

Kaplun, K., &  Li, A. (2018). Mathematical modeling of likeliness of customers’ buying. (Abstract). Proceedings of the 2018 Joint Mathematics Meetings, San Diego, California.

Kaplun, K., & Li, A. (2017). Randic connectivity indices for decagonal Graphs. Proceedings of the 2017 MAA Mathfest, Chicago, Illinois.

Kaplun, K., & Li, A. (2017). Randic connectivity indices for decagonal graphs. ” (Abstract). Proceedings of the 2017 Joint Mathematics Meetings, Atlanta, Georgia