期刊文献+

改进的XML智能数据清洗策略

Improved XML Intelligence Data Cleaning Strategy
下载PDF
导出
摘要 针对XML数据的质量问题,以XML键为基础,借助多模板隐马尔可夫模型信息抽取策略与粒子群优化算法构建新的XML数据清洗方法。为了提高XML相似性数据并行检测效率,利用波函数对粒子群优化算法进行优化。仿真实验表明,与其他XML数据清洗算法相比,该方法的自适应学习能力强、人工参与程度低、计算量小,时间性能有94%左右的提升。 Aiming at the quality of XML data, this paper proposes a new XML data cleaning method based on XML key, the information of multiple templates Hidden Markov Model(HMM) draw-out strategy and Particle Swarm Optimization(PSO). For boosting the parallel detection efficiency of the XML similarity records, a wave function is used to give relevant improvements to PSO. Contrasted with other XML data cleaning algorithms, simulation experiments show that the optimized algorithm has powerful adaptive learning capability, lower labor cost, less calculation and better time rate around 94%.
出处 《计算机工程》 CAS CSCD 北大核心 2009年第4期66-68,71,共4页 Computer Engineering
基金 国家部委基础研究基金资助项目 2006年江苏省教育厅青年骨干教师计划基金资助项目
关键词 XML文档集 XML键 粒子群优化算法 数据清洗 隐马尔可夫模型 XML document set XML key Particle Swarm Optimization(PSO) data cleaning Hidden Markov ModeI(HMM)
  • 相关文献

参考文献8

二级参考文献58

  • 1XQuery: A query language for XML. W3C Working Draft 15February 2001, available: http://www. w3. org/TR/xquery/.
  • 2Tarjan. Three partition refinement algorithms. SIAM Journalon Computing, 1987, 16(6): 973-989.
  • 3Henzinger M R, Henzinger T A, Kopke P W. Computing sim-ulations on finite and infinite graphs. In: Proceedings of the36th Annual IEEE Symposium on Foundations of ComputerScience, Milwaukee, Wisconsin, 1995. 453-462.
  • 4Marian A, Abiteboul S, Cobena G, Mignet L. Change-centricmanagement of versions in an XML warehouse. In: Proceed-ings of the 27th International Conference on Very Large DataBases, Roma, Italy,2001. 581-590.
  • 5Goldman R, Widom J. Summarizing and searching sequential semistructured sources. Stanford University: Technical ReportTR20000312, 2000.
  • 6Zheng Shi-Hui, Zhou Ao-Ying et al. Structure-based approximate searching in XML data. Fudan University: Technical Report TR20010203,2001.
  • 7Wang J T-L, Shasha D etal. Structural matching and discovery in document databases. Sigmod Record, 1997, 26(2): 560-564.
  • 8Zhang K. A constrained editing distance between unordered labeled trees. Journal of Algorithmica, 1996, 15(3): 205-222.
  • 9Zhang K, Shasha D. On the editing distance between unordered labeled trees. Information Processing Letters, 1992, 42(3): 133-139.
  • 10Wang J T-L, Zhang K etal. Exact and approximate algorithmsfor unordered tree matching. IEEE Transactions on Systems,Man and Cybernetics, 1994, 24(4): 668-678.

共引文献318

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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