In the context of big data, many large-scale knowledge graphs have emerged to effectively organize the explosive growth of web data on the Internet. To select suitable knowledge graphs for use from many knowledge grap...In the context of big data, many large-scale knowledge graphs have emerged to effectively organize the explosive growth of web data on the Internet. To select suitable knowledge graphs for use from many knowledge graphs, quality assessment is particularly important. As an important thing of quality assessment, completeness assessment generally refers to the ratio of the current data volume to the total data volume.When evaluating the completeness of a knowledge graph, it is often necessary to refine the completeness dimension by setting different completeness metrics to produce more complete and understandable evaluation results for the knowledge graph.However, lack of awareness of requirements is the most problematic quality issue. In the actual evaluation process, the existing completeness metrics need to consider the actual application. Therefore, to accurately recommend suitable knowledge graphs to many users, it is particularly important to develop relevant measurement metrics and formulate measurement schemes for completeness. In this paper, we will first clarify the concept of completeness, establish each metric of completeness, and finally design a measurement proposal for the completeness of knowledge graphs.展开更多
In this paper, the structure characteristics of open complex giant systems are concretely analysed in depth, thus the view and its significance to support the meta synthesis engineering with manifold knowledge models...In this paper, the structure characteristics of open complex giant systems are concretely analysed in depth, thus the view and its significance to support the meta synthesis engineering with manifold knowledge models are clarified. Furthermore, the knowledge based multifaceted modeling methodology for open complex giant systems is emphatically studied. The major points are as follows: (1) nonlinear mechanism and general information partition law; (2) from the symmetry and similarity to the acquisition of construction knowledge; (3) structures for hierarchical and nonhierarchical organizations; (4) the integration of manifold knowledge models; (5) the methodology of knowledge based multifaceted modeling.展开更多
In granular computing granular structures represent knowledge on universe,in this paper several important granular structures are considered.In a general granular structure the notions of interior point, accumulation ...In granular computing granular structures represent knowledge on universe,in this paper several important granular structures are considered.In a general granular structure the notions of interior point, accumulation point and boundary point etc are proposed,by use of these notions and referring to topological method,the lower and upper approximations of a subset of universe are defined such that they are one kind of generalization of the existing approximations based on some special granular structure.Basic properties of new rough set approximations are investigated.Furthermore,granular structures on universe are characterized by the lower and upper approximation operators.展开更多
基金supported by the National Key Laboratory for Comp lex Systems Simulation Foundation (6142006190301)。
文摘In the context of big data, many large-scale knowledge graphs have emerged to effectively organize the explosive growth of web data on the Internet. To select suitable knowledge graphs for use from many knowledge graphs, quality assessment is particularly important. As an important thing of quality assessment, completeness assessment generally refers to the ratio of the current data volume to the total data volume.When evaluating the completeness of a knowledge graph, it is often necessary to refine the completeness dimension by setting different completeness metrics to produce more complete and understandable evaluation results for the knowledge graph.However, lack of awareness of requirements is the most problematic quality issue. In the actual evaluation process, the existing completeness metrics need to consider the actual application. Therefore, to accurately recommend suitable knowledge graphs to many users, it is particularly important to develop relevant measurement metrics and formulate measurement schemes for completeness. In this paper, we will first clarify the concept of completeness, establish each metric of completeness, and finally design a measurement proposal for the completeness of knowledge graphs.
文摘In this paper, the structure characteristics of open complex giant systems are concretely analysed in depth, thus the view and its significance to support the meta synthesis engineering with manifold knowledge models are clarified. Furthermore, the knowledge based multifaceted modeling methodology for open complex giant systems is emphatically studied. The major points are as follows: (1) nonlinear mechanism and general information partition law; (2) from the symmetry and similarity to the acquisition of construction knowledge; (3) structures for hierarchical and nonhierarchical organizations; (4) the integration of manifold knowledge models; (5) the methodology of knowledge based multifaceted modeling.
基金supported by grants from the National Natural Science Foundation of China(Nos.11071284 and 61075120)the Natural Science Foundation of Zhejiang Province in China(No.Y107262).
文摘In granular computing granular structures represent knowledge on universe,in this paper several important granular structures are considered.In a general granular structure the notions of interior point, accumulation point and boundary point etc are proposed,by use of these notions and referring to topological method,the lower and upper approximations of a subset of universe are defined such that they are one kind of generalization of the existing approximations based on some special granular structure.Basic properties of new rough set approximations are investigated.Furthermore,granular structures on universe are characterized by the lower and upper approximation operators.
