基于上下文相似度的聚类

IF 2.6 3区 数学 Q1 MATHEMATICS, INTERDISCIPLINARY APPLICATIONS
L. Kovács, T. Repasi, E. Baksa-Varga, P. Barabas
{"title":"基于上下文相似度的聚类","authors":"L. Kovács, T. Repasi, E. Baksa-Varga, P. Barabas","doi":"10.1109/CANS.2008.26","DOIUrl":null,"url":null,"abstract":"The discovery of word categories is an important step in statistical grammar induction systems. Word categories can be considered as clusters containing words with similar grammatical or semantic behavior. Having a metric space of words, the clustering algorithm will place similar words into the same cluster, whereas dissimilar ones are clustered into different groups. In this paper we propose an approximate word clustering method based on context similarity. The context of a word is defined here as the set of sentences containing the word. The similarity of two words is measured with the similarity of the corresponding context sets. For the calculation of the context-based distance of two words, a hierarchical agglomerative clustering algorithm has been developed, and is presented here.","PeriodicalId":50026,"journal":{"name":"Journal of Systems Science & Complexity","volume":"42 1","pages":"157-165"},"PeriodicalIF":2.6000,"publicationDate":"2008-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Clustering Based on Context Similarity\",\"authors\":\"L. Kovács, T. Repasi, E. Baksa-Varga, P. Barabas\",\"doi\":\"10.1109/CANS.2008.26\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The discovery of word categories is an important step in statistical grammar induction systems. Word categories can be considered as clusters containing words with similar grammatical or semantic behavior. Having a metric space of words, the clustering algorithm will place similar words into the same cluster, whereas dissimilar ones are clustered into different groups. In this paper we propose an approximate word clustering method based on context similarity. The context of a word is defined here as the set of sentences containing the word. The similarity of two words is measured with the similarity of the corresponding context sets. For the calculation of the context-based distance of two words, a hierarchical agglomerative clustering algorithm has been developed, and is presented here.\",\"PeriodicalId\":50026,\"journal\":{\"name\":\"Journal of Systems Science & Complexity\",\"volume\":\"42 1\",\"pages\":\"157-165\"},\"PeriodicalIF\":2.6000,\"publicationDate\":\"2008-11-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Systems Science & Complexity\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1109/CANS.2008.26\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Systems Science & Complexity","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1109/CANS.2008.26","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 3

摘要

词类的发现是统计语法归纳系统的一个重要步骤。词类可以被认为是包含具有相似语法或语义行为的词的聚类。有了单词的度量空间,聚类算法将相似的单词放在同一个聚类中,而不相似的单词聚类到不同的组中。本文提出了一种基于上下文相似度的近似聚类方法。一个词的上下文在这里被定义为包含这个词的一组句子。两个词的相似度是用对应上下文集的相似度来衡量的。为了计算基于上下文的两个词的距离,本文提出了一种分层聚类算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Clustering Based on Context Similarity
The discovery of word categories is an important step in statistical grammar induction systems. Word categories can be considered as clusters containing words with similar grammatical or semantic behavior. Having a metric space of words, the clustering algorithm will place similar words into the same cluster, whereas dissimilar ones are clustered into different groups. In this paper we propose an approximate word clustering method based on context similarity. The context of a word is defined here as the set of sentences containing the word. The similarity of two words is measured with the similarity of the corresponding context sets. For the calculation of the context-based distance of two words, a hierarchical agglomerative clustering algorithm has been developed, and is presented here.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Journal of Systems Science & Complexity
Journal of Systems Science & Complexity 数学-数学跨学科应用
CiteScore
3.80
自引率
9.50%
发文量
90
审稿时长
6-12 weeks
期刊介绍: The Journal of Systems Science and Complexity is dedicated to publishing high quality papers on mathematical theories, methodologies, and applications of systems science and complexity science. It encourages fundamental research into complex systems and complexity and fosters cross-disciplinary approaches to elucidate the common mathematical methods that arise in natural, artificial, and social systems. Topics covered are: complex systems, systems control, operations research for complex systems, economic and financial systems analysis, statistics and data science, computer mathematics, systems security, coding theory and crypto-systems, other topics related to systems science.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信