Fetching the paper…
Reading the bibliography…
Constructing taxonomies from citation graphs is essential for organizing scientific knowledge, facilitating literature reviews, and identifying emerging research trends.
Nettaxo: Automated topic taxonomy construction from text-rich network. In Proceedings of the web conference 2020 . 1908–1919
Jingbo Shang, Xinyang Zhang, Liyuan Liu, Sha Li, and Jiawei Han. 2020 · 1919
Earlier work this paper cites.
Automatic acquisition of hyponyms from large text corpora. In COLING 1992 volume 2: The 14th international conference on computational linguistics
Marti A Hearst. 1992 · 1992
Earlier work this paper cites.
Graph clustering and minimum cut trees
Gary William Flake, Robert E Tarjan, and Kostas Tsioutsiouliklis. 2004 · 2004
Earlier work this paper cites.
Automatically labeling semantic classes. In Proceedings of the Human Language Technology Conference of the North American Chapter of the Association for Computational Linguistics: HLT-NAACL 2004 . 321–328
Patrick Pantel and Deepak Ravichandran. 2004 · 2004
Earlier work this paper cites.
Espresso: Leveraging generic patterns for automatically harvesting semantic relations. In Proceedings of the 21st international conference on computational linguistics and 44th annual meeting of the Association for Computational Linguistics . 113–120
Patrick Pantel and Marco Pennacchiotti. 2006 · 2006
Earlier work this paper cites.
Semantic taxonomy induction from heterogenous evidence. In Proceedings of the 21st international conference on computational linguistics and 44th annual meeting of the association for computational linguistics . 801–808
Rion Snow, Dan Jurafsky, and Andrew Y Ng. 2006 · 2006
Earlier work this paper cites.
Combining linguistic and statistical analysis to extract relations from web documents. In Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining . 712–717
Fabian M Suchanek, Georgiana Ifrim, and Gerhard Weikum. 2006 · 2006
Earlier work this paper cites.
The semantic growbag algorithm: Automatically deriving categorization systems. In Research and Advanced Technology for Digital Libraries: 11th European Conference, ECDL 2007, Budapest, Hungary, September 16-21, 2007. Proceedings 11 . Springer, 1–13
Jörg Diederich and Wolf-Tilo Balke. 2007 · 2007
Earlier work this paper cites.
Yago: a core of semantic knowledge. In Proceedings of the 16th international conference on World Wide Web . 697–706
Fabian M Suchanek, Gjergji Kasneci, and Gerhard Weikum. 2007 · 2007
Earlier work this paper cites.
The probabilistic relevance framework: BM25 and beyond
Stephen Robertson, Hugo Zaragoza, et al · 2009
Earlier work this paper cites.
Probabilistic topic models for learning terminological ontologies
Wei Wang, Payam Mamaani Barnaghi, and Andrzej Bargiela. 2009 · 2009
Earlier work this paper cites.
A semi-supervised method to learn and construct taxonomies using the web. In Proceedings of the 2010 conference on empirical methods in natural language processing . 1110–1118
Zornitsa Kozareva and Eduard Hovy. 2010 · 2010
Earlier work this paper cites.
Knowledge-rich word sense disambiguation rivaling supervised systems. In Proceedings of the 48th annual meeting of the association for computational linguistics . 1522–1531
Simone Paolo Ponzetto and Roberto Navigli. 2010 · 2010
Earlier work this paper cites.
Fully-dynamic hierarchical graph clustering using cut trees. In Workshop on Algorithms and Data Structures . Springer, 338–349
Christof Doll, Tanja Hartmann, and Dorothea Wagner. 2011 · 2011
Earlier work this paper cites.
Taxonomy induction based on a collaboratively built knowledge repository
Simone Paolo Ponzetto and Michael Strube. 2011 · 2011
Earlier work this paper cites.
Taxolearn: A semantic approach to domain taxonomy learning. In 2012 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology , Vol. 1. IEEE, 58–65
Emmanuelle-Anna Dietz, Damir Vandic, and Flavius Frasincar. 2012 · 2012
Earlier work this paper cites.
Automatic taxonomy construction from keywords. In Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining . 1433–1441
Xueqing Liu, Yangqiu Song, Shixia Liu, and Haixun Wang. 2012 · 2012
Earlier work this paper cites.
Domain taxonomy learning from text: The subsumption method versus hierarchical clustering
Jeroen De Knijff, Flavius Frasincar, and Frederik Hogenboom. 2013 · 2013
Cited alongside, same era.
Learning concept hierarchies from textual resources for ontologies construction
Ana B Rios-Alvarado, Ivan Lopez-Arevalo, and Victor J Sosa-Sosa. 2013 · 2013
Cited alongside, same era.
Ontolearn reloaded: A graph-based algorithm for taxonomy induction
Paola Velardi, Stefano Faralli, and Roberto Navigli. 2013 · 2013
Cited alongside, same era.
DenGraph-HO: a density-based hierarchical graph clustering algorithm
Nico Schlitter, Tanja Falkowski, and Jörg Lässig. 2014 · 2014
Cited alongside, same era.
A fast and memory-efficient hierarchical graph clustering algorithm. In International Conference on Neural Information Processing . Springer, 247–254
László Szilágyi, Sándor Miklós Szilágyi, and Béat Hirsbrunner. 2014 · 2014
Cited alongside, same era.
Matrix completion with hierarchical graph side information
Adel Elmahdy, Junhyung Ahn, Changho Suh, and Soheil Mohajer. 2020 · 2020
Later among the works it cites.
Adapterfusion: Non-destructive task composition for transfer learning
Jonas Pfeiffer, Aishwarya Kamath, Andreas Rücklé, Kyunghyun Cho, and Iryna Gurevych. 2020 · 2020
Later among the works it cites.
Masked label prediction: Unified message passing model for semi-supervised classification
Yunsheng Shi, Zhengjie Huang, Shikun Feng, Hui Zhong, Wenjin Wang, and Yu Sun. 2020 · 2020
Later among the works it cites.
Lora: Low-rank adaptation of large language models
Edward J Hu, Yelong Shen, Phillip Wallis, Zeyuan Allen-Zhu, Yuanzhi Li, Shean Wang, Lu Wang, and Weizhu Chen. 2021 · 2021
Later among the works it cites.
The Power of Scale for Parameter-Efficient Prompt Tuning. In Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing . 3045–3059
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Taxofinder: A graph-based approach for taxonomy learning
Yong-Bin Kang, Pari Delir Haghigh, and Frada Burstein. 2015 · 2015
Cited alongside, same era.
Parallel modularity-based community detection on large-scale graphs. In 2015 IEEE International Conference on Cluster Computing . IEEE, 1–10
Jianping Zeng and Hongfeng Yu. 2015 · 2015
Cited alongside, same era.
Semi-supervised classification with graph convolutional networks
Thomas N Kipf and Max Welling. 2016 · 2016
Cited alongside, same era.
Petar Veličković, Guillem Cucurull, Arantxa Casanova, Adriana Romero, Pietro Lio, and Yoshua Bengio. 2017 · 2017
Cited alongside, same era.
Hierarchical Graph Clustering using Node Pair Sampling. In MLG 2018-14th International Workshop on Mining and Learning with Graphs
Thomas Bonald, Bertrand Charpentier, Alexis Galland, and Alexandre Hollocou. 2018 · 2018
Cited alongside, same era.
Automatic Taxonomy Construction for Eye Colors Data without Using Context Information. In 2018 IEEE Third International Conference on Data Science in Cyberspace (DSC) . IEEE, 837–841
Jing Qiu, Yaqi Si, and Zhihong Tian. 2018 · 2018
Cited alongside, same era.
A Web-scale system for scientific knowledge exploration. In Proceedings of ACL 2018, System Demonstrations . 87–92
Zhihong Shen, Hao Ma, and Kuansan Wang. 2018a · 2018
Cited alongside, same era.
Brian Lester, Rami Al-Rfou, and Noah Constant. 2021 · 2021
Later among the works it cites.
Prefix-Tuning: Optimizing Continuous Prompts for Generation. In Proceedings of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (Volume 1: Long Papers) . 4582–4597
Xiang Lisa Li and Percy Liang. 2021 · 2021
Later among the works it cites.
Taxonomy extraction using knowledge graph embeddings and hierarchical clustering. In Proceedings of the 36th Annual ACM Symposium on Applied Computing . 836–844
Félix Martel and Amal Zouaq. 2021 · 2021
Later among the works it cites.
Graphllm: Boosting graph reasoning ability of large language model
Ziwei Chai, Tianjie Zhang, Liang Wu, Kaiqiao Han, Xiaohai Hu, Xuanwen Huang, and Yang Yang. 2023 · 2023
Later among the works it cites.
Parameter-efficient fine-tuning of large-scale pre-trained language models
Ning Ding, Yujia Qin, Guang Yang, Fuchao Wei, Zonghan Yang, Yusheng Su, Shengding Hu, Yulin Chen, Chi-Min Chan, Weize Chen, et al · 2023
Later among the works it cites.
Pre-train, prompt, and predict: A systematic survey of prompting methods in natural language processing
Pengfei Liu, Weizhe Yuan, Jinlan Fu, Zhengbao Jiang, Hiroaki Hayashi, and Graham Neubig. 2023 · 2023
Later among the works it cites.
Parameter-efficient fine-tuning for large models: A comprehensive survey
Zeyu Han, Chao Gao, Jinyang Liu, Sai Qian Zhang, et al · 2024
Closest in time.
Can we soft prompt LLMs for graph learning tasks?. In Companion Proceedings of the ACM on Web Conference 2024 . 481–484
Zheyuan Liu, Xiaoxin He, Yijun Tian, and Nitesh V Chawla. 2024 · 2024
Closest in time.
Let your graph do the talking: Encoding structured data for llms
Bryan Perozzi, Bahare Fatemi, Dustin Zelle, Anton Tsitsulin, Mehran Kazemi, Rami Al-Rfou, and Jonathan Halcrow. 2024 · 2024
Closest in time.
AutoSurvey: Large Language Models Can Automatically Write Surveys
Yidong Wang, Qi Guo, Wenjin Yao, Hongbo Zhang, Xin Zhang, Zhen Wu, Meishan Zhang, Xinyu Dai, Min Zhang, Qingsong Wen, et al · 2024
Closest in time.
Towards Lifelong Learning of Large Language Models: A Survey
Junhao Zheng, Shengjie Qiu, Chengming Shi, and Qianli Ma. 2024 · 2024
Closest in time.
End-to-End Supervised Hierarchical Graph Clustering for Speaker Diarization
Prachi Singh and Sriram Ganapathy. 2025 · 2025
Closest in time.