Document Co-citation Analysis using Concept Lattice
Received: 16 July 2023 | Revised: 23 August 2023 | Accepted: 27 August 2023 | Online: 18 September 2023
Corresponding author: Shikha Gupta
Abstract
Document Co-citation Analysis (DCA) is a method to identify and analyze the relationships between co-cited documents. In this paper, we attempt to use concept lattice for DCA. Concept lattice is a graph structure given in Formal Concept Analysis (FCA), a branch of mathematics based on the concept and its hierarchy. The experiments are conducted on an extensive repository of citations extracted from DBLP, ACM, MAG (Microsoft Academic Graph), and other sources, having a total of 5,354,309 papers and 48,227,950 citation relationships. In this paper, it is established that the concept lattice supports DCA and helps to identify a set of co-cited documents and their co-citation strength. It also provides navigation to reflect the subset-superset relationship of the co-citations. Further, the concept lattice helps identify the hierarchy among the documents and answers the most relevant queries related to DCA.
Keywords:
Document Co-citation Analysis (DCA), concept lattice, co-citation strength, citation datasetDownloads
References
Y. Ding, G. Chowdhury, and S. Foo, "Mapping the intellectual structure of information retrieval studies: an author co-citation analysis, 1987-1997," Journal of Information Science, vol. 25, no. 1, pp. 67–78, Feb. 1999.
H. Small, "Co-citation in the scientific literature: A new measure of the relationship between two documents," Journal of the American Society for Information Science, vol. 24, no. 4, pp. 265–269, 1973.
H. Small, "The synthesis of specialty narratives from co-citation clusters," Journal of the American Society for Information Science, vol. 37, no. 3, pp. 97–110, 1986.
H. Small, "Co-citation in the scientific literature: A new measure of the relationship between two documents," Journal of the American Society for Information Science, vol. 24, no. 4, pp. 265–269, 1973.
S. Khalid and S. Wu, "Supporting Scholarly Search by Query Expansion and Citation Analysis," Engineering, Technology & Applied Science Research, vol. 10, no. 4, pp. 6102–6108, Aug. 2020.
S. Khalid, S. Khusro, I. Ullah, and G. Dawson-Amoah, "On The Current State of Scholarly Retrieval Systems," Engineering, Technology & Applied Science Research, vol. 9, no. 1, pp. 3863–3870, Feb. 2019.
A. J. Singh and S. Ravikumar, "Newspaper Citation in Scholarly Publications: A Study on Financial Times Newspaper during 2001-2010 as reflected in Web of Science," Library Philosophy and Practice (e-journal), Feb. 2018, Art. no. 1630.
S. Khalid, S. Wu, and F. Zhang, "A multi-objective approach to determining the usefulness of papers in academic search," Data Technologies and Applications, vol. 55, no. 5, pp. 734–748, Jan. 2021.
X.-Y. Liu and B.-C. Chien, "Applying Citation Network Analysis on Recommendation of Research Paper Collection," in Proceedings of the 4th Multidisciplinary International Social Networks Conference, New York, NY, USA, Apr. 2017, pp. 1–6.
Z. A. Shaikh, "Keyword Detection Techniques: A Comprehensive Study," Engineering, Technology & Applied Science Research, vol. 8, no. 1, pp. 2590–2594, Feb. 2018.
M. Kaytoue, S. O. Kuznetsov, and A. Napoli, "Revisiting Numerical Pattern Mining with Formal Concept Analysis," in Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence, 2011, pp. 1342–1347.
U. Priss, S. Polovina, and R. Hill, Eds., Conceptual Structures: Knowledge Architectures for Smart Applications: 15th International Conference on Conceptual Structures, ICCS 2007, Sheffield, UK, July 22-27, 2007. Proceedings, vol. 4604. Berlin, Heidelberg, Germany: Springer, 2007.
B. Ganter and R. Wille, Formal Concept Analysis: Mathematical Foundations. Berlin, Heidelberg, Germany: Springer Science & Business Media, 2012.
Y. Bastide, N. Pasquier, R. Taouil, G. Stumme, and L. Lakhal, "Mining Minimal Non-redundant Association Rules Using Frequent Closed Itemsets," in Computational Logic — CL 2000, London, UK, 2000, pp. 972–986.
N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal, "Pruning closed itemset lattices for association rules," in BDA’1998 international conference on Advanced Databases, Hammamet, Tunisia, Oct. 1998, pp. 177–196.
"Citation Network Dataset: DBLP+Citation, ACM Citation network." https://www.aminer.org/citation.
"FCA Software." https://upriss.github.io/fca/fcasoftware.html.
M. J. Zaki, "CHARM Algorithm." Jul. 14, 2022, [Online]. Available: https://github.com/zakimjz/CHARM.
J. Tang, D. Zhang, and L. Yao, "Social Network Extraction of Academic Researchers," in Proceedings of the 2007 Seventh IEEE International Conference on Data Mining, USA, Jul. 2007, pp. 292–301.
J. Tang, J. Sun, C. Wang, and Z. Yang, "Social influence analysis in large-scale networks," in Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining, New York, NY, USA, Mar. 2009, pp. 807–816.
A. Sinha et al., "An Overview of Microsoft Academic Service (MAS) and Applications," in Proceedings of the 24th International Conference on World Wide Web, New York, NY, USA, Feb. 2015, pp. 243–246.
Downloads
How to Cite
License
Copyright (c) 2023 Anamika Gupta, Shikha Gupta, Mukul Bisht, Prestha Hooda, Md Salik
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors who publish with this journal agree to the following terms:
- Authors retain the copyright and grant the journal the right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) after its publication in ETASR with an acknowledgement of its initial publication in this journal.
