[1]张三峰,吴国新.P2P系统分布式LSI的构建和更新[J].东南大学学报(自然科学版),2006,36(1):39-42.[doi:10.3969/j.issn.1001-0505.2006.01.008]
 Zhang Sanfeng,Wu Guoxin.On building and updating distributed LSI for P2P systems[J].Journal of Southeast University (Natural Science Edition),2006,36(1):39-42.[doi:10.3969/j.issn.1001-0505.2006.01.008]
点击复制

P2P系统分布式LSI的构建和更新()
分享到:

《东南大学学报(自然科学版)》[ISSN:1001-0505/CN:32-1178/N]

卷:
36
期数:
2006年第1期
页码:
39-42
栏目:
计算机科学与工程
出版日期:
2006-01-20

文章信息/Info

Title:
On building and updating distributed LSI for P2P systems
作者:
张三峰 吴国新
东南大学计算机科学与工程系, 南京 210096
Author(s):
Zhang Sanfeng Wu Guoxin
Department of Computer Science and Engineering, Southeast University, Nanjing 210096, China
关键词:
奇异值分解 更新算法 隐语义索引 peer-to-peer
Keywords:
singular value decomposition updating problem latent semantic indexing peer-to-peer
分类号:
TP393
DOI:
10.3969/j.issn.1001-0505.2006.01.008
摘要:
从P2P系统自组织和动态性特点出发,提出分布式环境下隐语义索引(LSI)构建和更新的P2P网络模型,设计适合P2P系统文档矩阵的降维表示(RDR)合并算法,结合信号和噪声子空间模型从理论上分析RDR合并算法的有效性及算法需要满足的前提条件; 使用Matlab 6.5针对标准文集测试RDR合并算法对查询精度的影响.理论分析和数字实验证明,该算法能够解决P2P系统中分布式LSI的构建和更新问题,能在可容忍的查询精度影响范围内,以较低的网络开销和计算量分布式地构建、更新隐语义索引.
Abstract:
Taking P2P’s(peer-to-peer)characters such as self-organizing, anonymous and dynamic into account, this paper proposes a model for building and updating distributed LSI(latent semantic indexing)and an algorithm for merging reduced-dimension-representation(RDR)s which is suitable for P2P systems. Using the subspace model in signal and noise field, a theoretical justification for RDR-Merging and the precondition of the algorithm are provided. A test based on standard document set MED(medlars collection)was conducted in Matlab 6.5 to explore the error brought by RDR-Merging algorithm. Theoretical analysis and numerical experiments both show that our building and updating algorithm for distributed LSI can reduce communication overhead and computation cost of SVD(singular value decomposition)effectively while keeping fair query precision.

参考文献/References:

[1] Berry M, Drmac Z,Jessup E.Matrices,vector spaces,and information retrieval [J]. SIAM Review,1999,41(2):335-362.
[2] Berry M,Dumais S T,O’Brien G W.Using linear algebra for intelligent information retrieval [J].SIAM Review,1995,37(4):573-595.
[3] Tang C,Xu Z,Dwarkadas S.Peer-to-peer information retrieval using self-organizing semantic overlay networks [C] //Proc of Applications,Technologies,Architectures,and Protocols for Computer Comm(SIGCOMM’03).New York:ACM Press,2003:175-186.
[4] Tang C,Xu Z,Dwarkadas S.On scaling latent semantic indexing for sarge peer-to-peer systems [C] // Proceedings of the 27th Annual International Conference on Research and Development in Information Retrieval.New York:ACM Press,2004:112-121.
[5] Shen Hengtao,Shu Yanfeng,Yu Bei.Efficient semantic-based content search in P2P network [J].IEEE Transactions on Knowledge and Data Engineering Archive,2004,16(7):813 - 826.
[6] Zha Hongyuan,Simon H.On updating problems in latent semantic indexing [J]. SIAM Journal of Scientific Computing,1999,21(2):782-791.
[7] Cornell.Cornell smart system [EB/OL].ftp://ftp.cs.cornell.edu/pub/smart.1998/2005-05.
[8] Zeimpekis Dimitrios.TMG[EB/OL].(2005-05)[2005-05].http://scgroup.hpclab.ceid.upatras.gr/scgroup/Projects/TMG/.
[9] Berry M. SVDPACKC [EB/OL].(2004-12-01)[2005-05].http://www.netlib.org/svdpack/.

相似文献/References:

[1]王海军,许飞云.基于非负Tucker 3分解的稀疏分量分析在故障信号提取中的应用[J].东南大学学报(自然科学版),2013,43(4):758.[doi:10.3969/j.issn.1001-0505.2013.04.016]
 Wang Haijun,Xu Feiyun.Sparse component analysis based on nonnegative Tucker 3 decomposition for fault signal extraction[J].Journal of Southeast University (Natural Science Edition),2013,43(1):758.[doi:10.3969/j.issn.1001-0505.2013.04.016]

备注/Memo

备注/Memo:
作者简介: 张三峰(1979—),男,博士生; 吴国新(联系人),男, 博士, 教授, 博士生导师,gwu@seu.edu.cn.
更新日期/Last Update: 2006-01-20