期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

一种基于结构的重要邮箱用户发现方法 被引量：1

Important email account discovering method based on structure
下载PDF
导出
摘要 多数发现邮件重要用户的方法都借助邮件的内容信息作为语义来帮助理解,论文提出了一种基于结构的重要邮件用户发现方法。该方法借鉴网页中链接分析算法的思想计算邮件地址的重要度。在安然邮件语料库上验证了该方法,得到较好的实验结果。 A method of discovering important e-mail accounts based on structure is proposed in this paper,in spite of most existed methods using e-mail content as the semantic meaning to help understand.Referring to the idea of web link analysis algorithms PageRank and HITS,a method which evaluates the importance of e-mail address in e-mail graph is proposed,and also can evaluate the importance of e-mail account.The methods are verified on the Enron E-mail Dataset,and the experiment results are better than some existent methods.
作者 熊金 刘悦 许洪波
机构地区 中国科学院计算技术研究所 中国科学院研究生院
出处 《计算机工程与应用》 CSCD 北大核心 2007年第13期143-145,共3页 Computer Engineering and Applications
基金 国家重点基础研究发展规划(973)(the National Grand Fundamental Research 973 Program of China under Grant No.2004CB318109) 计算技术研究所知识创新科研课题(No.20056570)。
关键词 EA拓扑图 链接分析算法 重要邮箱用户 安然邮件语料库 EA graph link analysis algorithm important e-mail account enron e-mail dataset
分类号 TP311 [自动化与计算机技术—计算机软件与理论]
  • 相关文献

参考文献9

  • 1Golbeck J,Hendler J.Reputation network analysis for email filtering[C]//Proc of the Conference on Email and Anti-Spam(CEAS),Mountain View,CA,USA,July 2004.
  • 2Newman M.Who is the best connected scientist? a study of scientific coauthorship networks[M]//Ben-Naim E,Frauenfelder H,Toroczkai Z.Complex Networks.[S.l.] : Springer, 2004 : 337-370.
  • 3White S,Smyth P.Algorithms for estimating relative importance in networks[C]//ACM SIGKDD International Conference on Knowledge Discovery and Data Mining,2003:266-275.
  • 4Page L, Brin S,Motwani R,et al.The pagerank citation ranking:bringing order to the web[R].Technical Report,Stanford,1998.
  • 5Kleinberg J.Authoritative sources in a hyperlinked environment[J].Journal of ACM,1999.
  • 6Sherry J,Adibi J.Discovering important nodes through graph entropy:the case of enron email database[C]//ACM SIGKDD International Conference on Knowledge Discovery and Data Mining,2005.
  • 7Borgatti S.Identifying sets of key players in a network.Computational, Mathematical and Organizational Theory, 2005.
  • 8Chirita P A,Diederich J,Nejdl W.MailRank:using ranking for spam detection.CIKM, 2005.
  • 9Sherry J.http ://www.isi.edu/-adibi/Enron/Enron.htm.

同被引文献8

  • 1Golbeck J, Hendler J. Reputation network analysis for email filtering[ C ]//Proc of the Conference on Email and Anti-Spam ( CEAS). 2004:69 - 79.
  • 2Newman M. Who is the best connected scientist? A study of scientific co-authorship networks [ M ]. Berlin. Springer, 2004 : 337 - 370.
  • 3Shetty J, Adibi J. Discovering important nodes through graph entropy : the case of enron email database [ C ]// ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 2005:74 -81.
  • 4Stephen P Borgatti. Identifying sets of key players in a network [ J]. Computational Mathematical and Organizational Theory, 2006(12) : 21 -34.
  • 5Jiawei Han, Micheline Kember. Data Mining Concepts and Techniques [ M ]. Beijing: China Machine Press, 2001 : 240 - 243.
  • 6Agrawal R, Srikant R. Fast algorithms for mining association rules in large databases [ R ]. Research Report RJ 9839, IBM Almaden Research Center, San Jose, CA, 1994.
  • 7Han J, Pei J, Yin Y. Mining frequent patterns without candidate generation [ C ]// Proceedings of 2000 ACMSIGMOD Intl. Conf. on Management of Data. 2000:1 -12.
  • 8Shetty J. Enron_Employee_Status [ EB/OL]. [ 2007-09- 10 ]. http ://www. Isi. edu/- adibi/Enron/Enron. htm.

引证文献1

二级引证文献1

计算机工程与应用
2007年 第13期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部