https://scholars.lib.ntu.edu.tw/handle/123456789/413176
標題: | Labeling categories and relationships in an evolving social network | 作者: | Lin M.-S. Chen H.-H. |
關鍵字: | Category labeling;Evolving social network;Relationships labeling | 公開日期: | 2008 | 卷: | 4956 LNCS | 起(迄)頁: | 77-88 | 來源出版物: | Lecture Notes in Computer Science | 摘要: | Modeling and naming general entity-entity relationships is challenging in construction of social networks. Given a seed denoting a person name, we utilize Google search engine, NER (Named Entity Recognizer) parser, and CODC (Co-Occurrence Double Check) formula to construct an evolving social network. For each entity pair in the network, we try to label their categories and relationships. Firstly, we utilize an open directory project (ODP) resource, which is the largest human-edited directory of the web, to build a directed graph, and then use three ranking algorithms, PageRank, HITS, and a Markov chain random process to extract potential categories defined in the ODP. These categories capture the major contexts of the designated named entities. Finally, we combine the ranks of these categories and tf*idf scores of noun phrases to extract relationships. In our experiments, total 6 evolving social networks with 618 pairs of named entities demonstrate that the Markov chain random process is better than the other two algorithms. ? 2008 Springer-Verlag Berlin Heidelberg. |
URI: | https://scholars.lib.ntu.edu.tw/handle/123456789/413176 | ISBN: | 9783540786450 | ISSN: | 03029743 | DOI: | 10.1007/978-3-540-78646-7_10 |
顯示於: | 資訊工程學系 |
在 IR 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。