检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:李云[1] 程伟[1] 陈崚[1] 谢翠华[1] 蔡俊杰[1]
机构地区:[1]扬州大学计算机科学与技术系,江苏扬州225009
出 处:《计算机应用与软件》2006年第8期3-5,共3页Computer Applications and Software
基 金:国家自然科学基金(No.60275022);国家科技攻关计划项目(2003BA614A-14)。
摘 要:作为形式概念分析的主要工具,概念格已在知识发现、软件工程等诸多领域取得广泛的应用。但是由于概念格自身的完备性,构造复杂性一直是困扰其进一步发展的一大难题。利用高性能并行计算机的计算与存储能力来构造和存储是解决这一问题的有效途径。首先介绍外延独立的同域概念格相关概念及其合并运算,在此基础上提出了一种基于MPI(M essage Passing Interface)消息传递机制的概念格并行构造算法。分析表明,该算法是高效、可行的。Qua one of the key tools of formal concept analysis, concept lattice has been widely used in many fields such as knowledge discovery,software engineering et al. Since the completeness of concept lattice,the complexity of building concept lattice has always been a big problem restricting its further development. One of the effective ways to solve this problem is taking advantage of high performance computer with good capacity of calculation and storage. This paper introduces some relevant concepts of extention-independent same field lattices and the union operation and proposes a parallel building algorithm of concept lattice based on MPI( message passing interface). The example indicates that this algorithm is efficient.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222