颗粒计算在扩展犯罪侦查系统中的应用

2007 IEEE International Conference on Granular Computing (GRC 2007) Pub Date : 2007-11-02 DOI:10.1109/GRC.2007.39

Chen Yunhua, Yu Yongquan, Zeng Bi, Wang Minghui

{"title":"颗粒计算在扩展犯罪侦查系统中的应用","authors":"Chen Yunhua, Yu Yongquan, Zeng Bi, Wang Minghui","doi":"10.1109/GRC.2007.39","DOIUrl":null,"url":null,"abstract":"The aim of granular computing is to obtain feasible approximate solutions satisfied enough with least complexity. The logic reasoning process using extension method actually implies the ideal of granular computing. This paper uses the relation-element as the measure of granulation and applies granular computing to the reasoning process of the extension criminal reconnaissance system to reduce the complexity of the extension inference.","PeriodicalId":259430,"journal":{"name":"2007 IEEE International Conference on Granular Computing (GRC 2007)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Application of Granular Computing in Extension Criminal Reconnaissance System\",\"authors\":\"Chen Yunhua, Yu Yongquan, Zeng Bi, Wang Minghui\",\"doi\":\"10.1109/GRC.2007.39\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The aim of granular computing is to obtain feasible approximate solutions satisfied enough with least complexity. The logic reasoning process using extension method actually implies the ideal of granular computing. This paper uses the relation-element as the measure of granulation and applies granular computing to the reasoning process of the extension criminal reconnaissance system to reduce the complexity of the extension inference.\",\"PeriodicalId\":259430,\"journal\":{\"name\":\"2007 IEEE International Conference on Granular Computing (GRC 2007)\",\"volume\":\"32 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-11-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 IEEE International Conference on Granular Computing (GRC 2007)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GRC.2007.39\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 IEEE International Conference on Granular Computing (GRC 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GRC.2007.39","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

粒度计算的目标是以最小的复杂度获得可行的近似解。采用可拓方法的逻辑推理过程实际上隐含了粒度计算的理想。本文采用关系元素作为粒度度量，将颗粒计算应用到可拓犯罪侦查系统的推理过程中，以降低可拓推理的复杂性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Application of Granular Computing in Extension Criminal Reconnaissance System

The aim of granular computing is to obtain feasible approximate solutions satisfied enough with least complexity. The logic reasoning process using extension method actually implies the ideal of granular computing. This paper uses the relation-element as the measure of granulation and applies granular computing to the reasoning process of the extension criminal reconnaissance system to reduce the complexity of the extension inference.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2007 IEEE International Conference on Granular Computing (GRC 2007)

自引率

0.00%

发文量