首页> 外文学位 >Edge partitioning and finding community structure using spectral decomposition.
【24h】

Edge partitioning and finding community structure using spectral decomposition.

机译:边缘划分和使用光谱分解找到群落结构。

获取原文
获取原文并翻译 | 示例

摘要

Many systems take the form of networks, sets of nodes or vertices joined together in pairs by links or edges. These network structure can be found in diverse fields as engineering, social, economic, and biological systems. Due to the omnipresence of networks, many efforts have been made to uncover the organizing principles that govern the formation and the evolution of various complex networks. One of the important properties of the networks is that of community structure---nodes are often found to cluster into tightly-knit groups with a high density of within-group edges and lower density of between-group edges. This community structure of the networks performs an important role in the study of networks. We proposed a new method for detecting such community, using the spectral decomposition, and it overcomes shortcomings of the conventional spectral partitioning approaches such as min-cut, and max-cut. We show this method can be a powerful approach for finding the community structure in the networks. We apply this method to the computer generated networks and real-world networks and show the advantages of the proposed method. We analyze personal emails in the form of network data and proposed a new approach for classifying spam and non-spam emails based on graph theoretic approaches. The proposed algorithm can distinguish between unsolicited commercial emails, so called spam and non-spam emails using only the information in the email headers. We exploit the properties of social networks and spectral decomposition to implement our algorithm. In this study, we mainly used the community structure in social network to classify non-spam and proposed a new method for edge partition of networks. We tested our method on a users's mail box, and it classified 41% of all emails as spam or non-spam emails, with no error. And these results are obtained with only few subnetworks resulted from the proposed decomposition method. It requires no supervised training and solely based on the properties of networks, not on the contents of emails.
机译:许多系统采用网络,节点集或顶点集(通过链接或边成对连接)的形式。这些网络结构可以在工程,社会,经济和生物系统等各个领域中找到。由于网络无处不在,因此人们进行了许多努力来揭示支配各种复杂网络的形成和发展的组织原则。网络的重要属性之一是社区结构-经常发现节点以高密度的组内边缘和低密度的组间边缘聚集成紧密的组。网络的这种社区结构在网络的研究中起着重要的作用。我们提出了一种使用光谱分解来检测此类群落的新方法,它克服了常规光谱分割方法(如最小切割和最大切割)的缺点。我们展示了该方法可以作为在网络中查找社区结构的强大方法。我们将该方法应用于计算机生成的网络和真实世界的网络,并展示了该方法的优点。我们以网络数据形式分析个人电子邮件,并提出了一种基于图论方法的垃圾邮件和非垃圾邮件分类新方法。所提出的算法可以仅使用电子邮件标题中的信息来区分未经请求的商业电子邮件,即所谓的垃圾邮件和非垃圾邮件。我们利用社交网络的特性和频谱分解来实现我们的算法。本研究主要利用社交网络中的社区结构对非垃圾邮件进行分类,并提出了一种新的网络边缘划分方法。我们在用户邮箱上测试了我们的方法,该方法将所有电子邮件中的41%归类为垃圾邮件或非垃圾邮件,没有错误。所提出的分解方法仅用很少的子网即可获得这些结果。它不需要监督培训,仅基于网络的属性,而不是电子邮件的内容即可。

著录项

  • 作者

    Kim, Ung Sik.;

  • 作者单位

    University of Florida.;

  • 授予单位 University of Florida.;
  • 学科 Engineering Electronics and Electrical.
  • 学位 Ph.D.
  • 年度 2007
  • 页码 91 p.
  • 总页数 91
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类 无线电电子学、电信技术;
  • 关键词

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号