• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>High-performance computing and networking >Evidential Techniques in Parallel Database Mining
【24h】

Evidential Techniques in Parallel Database Mining

机译：并行数据库挖掘中的证据技术

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Realisation of the fact that stored masses of data contain more information than what is obvious has led to a great interest in the field of Database Mining in the last couple of years. While hardware requirements for storage of these masses of data have advanced rapidly with the demand as have software methodologies for storage, manipulation and reporting of the data, little progress has been made in methods for automatically analysing the data and extracting knowledge stored implicitly within the data. This process of "reading between the lines" is called Database Mining (DM).rnClearly, the process of DM is a difficult one. This is due to the fact that methods required to achieve the goal of discovering knowledge are complex and data intensive. In this paper we explain how high performance computing can play a vital role in DM and discuss the implementation of a specific algorithm, STRIP (Strong Rule Induction in Parallel) [ANAN94b, ANAN95] developed by the authors for the discovery of Strong or "almost exact" rules from databases. STRIP is the first algorithm to be implemented within a parallel framework for Database Mining based on Evidence Theory (EDM) [ANAN94a] developed by the authors.rnIn an earlier paper we discussed the different levels of parallelism within STRIP and demonstrated them using a transputer network [ANAN95]. In this paper we discuss the implementation of STRIP on a cluster of Silicon Graphics Workstations connected using an ATM network.
机译：在过去的几年中，人们意识到存储的海量数据包含的信息多于显而易见的事实，这引起了数据库挖掘领域的极大兴趣。尽管存储这些海量数据的硬件要求以及存储，操作和报告数据的软件方法的需求已迅速提高，但是在自动分析数据和提取隐式存储在数据中的知识的方法方面进展甚微。这种“两行之间读取”的过程称为数据库挖掘（DM）。很显然，DM的过程很困难。这是由于以下事实：实现发现知识目标所需的方法非常复杂且数据密集。在本文中，我们解释了高性能计算如何在DM中发挥至关重要的作用，并讨论了由作者为发现“强”或“几乎”而开发的特定算法STRIP（并行强规则归纳）[ANAN94b，ANAN95]的实现数据库中的“确切”规则。 STRIP是基于作者开发的证据理论（EDM）[ANAN94a]在并行数据库挖掘框架中实现的第一个算法。在较早的论文中，我们讨论了STRIP中不同级别的并行性，并使用晶片机网络对其进行了演示[ANAN95]。在本文中，我们讨论了在使用ATM网络连接的Silicon Graphics工作站集群上STRIP的实现。

著录项

  • 来源
  • 会议地点 Milan(IT);Milan(IT)
  • 作者

    S.S. Anand; D.A. Bell; J.G. Hughes; C.M. Shapcott;

  • 作者单位

    School of Information and Software Engineering, University of Ulster at Jordanstown Co. Antrim. Northern Ireland. BT37 0QB;

    School of Information and Software Engineering, University of Ulster at Jordanstown Co. Antrim. Northern Ireland. BT37 0QB;

    School of Information and Software Engineering, University of Ulster at Jordanstown Co. Antrim. Northern Ireland. BT37 0QB;

    School of Information and Software Engineering, University of Ulster at Jordanstown Co. Antrim. Northern Ireland. BT37 0QB;

  • 会议组织
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类 TQ4;
  • 关键词

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号