Identifying Key People in Chinese Literary Works Using e-Core Decomposition

The plots of many literary works are very complex, which hinders the readers’ comprehension of these literary works. Thus, to help readers’ comprehension of complex literary works, tools should be proposed to support their comprehension by presenting the most important information to readers. In the case of literary works, the most important information may be the most important people, also called the key people. Key people play an important role in promoting the development of the plot of literary works. Thus, identifying key people helps to simplify readers’ comprehension of literary works. The traditional way to comprehend literary works mainly depends on intensive reading, and no previous work has been done to explore the problem of key people identification in literary works. In this paper, we define the concept of key people and propose an approach, IPWC, to Identify key People in Chinese literary Works using $e$ -Core decomposition. First, it uses the Weighted People co-occurrence Network (WPN) to represent people and their coupling relationships, and the frequency of the relationship. Second, an $e$ -core decomposition is proposed and applied to decompose the WPN into shells and obtain the coreness of each people. Finally, all the people are sorted in a descending order according to their coreness, and the top-ranked people are the key people identified by our approach. The empirical experiments performed on a famous Chinese literary work, The History of the Three Kingdoms, show that WPN has small world and scale-free features. Furthermore, our approach is feasible and more effective than other compared approaches. Our approach can be used to build an automatic tool that can identify the key people for readers to aid their comprehension of a Chinese literary work.

[1]  Kathleen McKeown,et al.  Extracting Social Networks from Literary Fiction , 2010, ACL.

[2]  Albert-László Barabási,et al.  Error and attack tolerance of complex networks , 2000, Nature.

[3]  Wang Jia-liang Research on Hierarchy of Large-Scale Software Macro-Topology Base on k-core , 2010 .

[4]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[5]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[6]  Frank Schweitzer,et al.  A k-shell decomposition method for weighted networks , 2012, ArXiv.

[7]  Feng Xia,et al.  Academic social networks: Modeling, analysis, mining and applications , 2019, J. Netw. Comput. Appl..

[8]  Duanbing Chen,et al.  Vital nodes identification in complex networks , 2016, ArXiv.

[9]  Jan Baetens Conversations on Cognitive Cultural Studies: Literature, Language, and Aesthetics , 2015, Leonardo.

[10]  Ana L. C. Bazzan,et al.  Temporal Network Analysis of Literary Texts , 2016, Adv. Complex Syst..

[11]  Yi-Cheng Zhang,et al.  Bipartite network projection and personal recommendation. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[12]  Mihai Surdeanu,et al.  The Stanford CoreNLP Natural Language Processing Toolkit , 2014, ACL.

[13]  Lev Muchnik,et al.  Identifying influential spreaders in complex networks , 2010, 1001.5285.

[14]  Carl K. Chang,et al.  ElementRank: Ranking Java Software Classes and Packages using a Multilayer Complex Network-Based Approach , 2019 .

[15]  Antonette M. Logar,et al.  Sorting in linear time - variations on the bucket sort , 2004 .

[16]  Susan R. Goldman,et al.  Constructing interpretive inferences about literary text: The role of domain-specific knowledge , 2017, Learning and Instruction.

[17]  Weifeng Pan,et al.  Structure-aware Mashup service Clustering for cloud-based Internet of Things using genetic algorithm based clustering algorithm , 2018, Future Gener. Comput. Syst..

[18]  Jaroslaw Kwapien,et al.  Linguistic data mining with complex networks: a stylometric-oriented approach , 2018, Inf. Sci..

[19]  L. da F. Costa,et al.  Characterization of complex networks: A survey of measurements , 2005, cond-mat/0505185.