The collection of concepts in a document set can be represented by a geometric structure called simplicial complex of combinatorial topology where each keyword is represented as a vertex and the relation between keywords as simplex. A simplex which consists of more than one keyword is a high-frequency keywordset. These keywords occur close to each other within a document which also occur frequently within a set of documents. The high frequent occurrence of these keywords shows relations between keywords. These relations carry concepts. The relations of these keywords can be captured by association rule mining and represented as simplices. The collection of all these simplices, represents the structure of concepts within a document set. Based on this topology, documents are clustered and the collection of simplices can serve as document index.
{"title":"Concept Mining using Association Rules and Combinatorial Topology","authors":"Albert Sutojo","doi":"10.1109/GrC.2007.154","DOIUrl":"https://doi.org/10.1109/GrC.2007.154","url":null,"abstract":"The collection of concepts in a document set can be represented by a geometric structure called simplicial complex of combinatorial topology where each keyword is represented as a vertex and the relation between keywords as simplex. A simplex which consists of more than one keyword is a high-frequency keywordset. These keywords occur close to each other within a document which also occur frequently within a set of documents. The high frequent occurrence of these keywords shows relations between keywords. These relations carry concepts. The relations of these keywords can be captured by association rule mining and represented as simplices. The collection of all these simplices, represents the structure of concepts within a document set. Based on this topology, documents are clustered and the collection of simplices can serve as document index.","PeriodicalId":259430,"journal":{"name":"2007 IEEE International Conference on Granular Computing (GRC 2007)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132931573","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The notion of a rough set was originally proposed by Pawlak (1982). Later on, there is a fast growing interest in this theory. In this paper we present a more general approach to the generalization of rough sets. Specifically, generalized formulation has been studied by using a binary relation on two universes without any restriction on the cardinality. The algebraic properties of generalized rough sets are given, and the extension principle for crisp sets is explained as the upper approximations of rough sets. The relationship between the extension principle for fuzzy sets and the upper approximations of fuzzy rough sets is investigated.
{"title":"Rough Sets and Zadeh's Extension Principles","authors":"Guilong Liu, Xiaoli Song, Xiaoxia Zhao","doi":"10.1109/GrC.2007.19","DOIUrl":"https://doi.org/10.1109/GrC.2007.19","url":null,"abstract":"The notion of a rough set was originally proposed by Pawlak (1982). Later on, there is a fast growing interest in this theory. In this paper we present a more general approach to the generalization of rough sets. Specifically, generalized formulation has been studied by using a binary relation on two universes without any restriction on the cardinality. The algebraic properties of generalized rough sets are given, and the extension principle for crisp sets is explained as the upper approximations of rough sets. The relationship between the extension principle for fuzzy sets and the upper approximations of fuzzy rough sets is investigated.","PeriodicalId":259430,"journal":{"name":"2007 IEEE International Conference on Granular Computing (GRC 2007)","volume":"379 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133399278","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The measurement of Mel spectrum distortion is a kind of warped frequency spectrum distortion measure. Using Mel frequency scale can reflect sufficiently the nonlinear perceptive characteristic of human hearings to frequency and amplitude. It can also reflect the frequency analysis and spectrum synthesis characteristics when human hear complex sounds. Aiming at speech recognition of isolated words, an improved algorithm for normal LPC cpestrum feature is put forward in this paper. That is, LPC cpestrum (LPCC) is changed nonlinear by Mel scale according to auditory characteristic, and the LPC Mel cepstrum coefficient (LPCMCC) is used as feature parameter. The speech recognition of isolated words is carried on through using RBF neural network. The experimental results show that LPCMCC feature parameter is better than LPCC feature parameter in SNRs and recognition rate.
{"title":"A Speech Recognition Method of Isolated Words Based on Modified LPC Cepstrum","authors":"Xueying Zhang, Yueling Guo, Xuemei Hou","doi":"10.1109/GrC.2007.96","DOIUrl":"https://doi.org/10.1109/GrC.2007.96","url":null,"abstract":"The measurement of Mel spectrum distortion is a kind of warped frequency spectrum distortion measure. Using Mel frequency scale can reflect sufficiently the nonlinear perceptive characteristic of human hearings to frequency and amplitude. It can also reflect the frequency analysis and spectrum synthesis characteristics when human hear complex sounds. Aiming at speech recognition of isolated words, an improved algorithm for normal LPC cpestrum feature is put forward in this paper. That is, LPC cpestrum (LPCC) is changed nonlinear by Mel scale according to auditory characteristic, and the LPC Mel cepstrum coefficient (LPCMCC) is used as feature parameter. The speech recognition of isolated words is carried on through using RBF neural network. The experimental results show that LPCMCC feature parameter is better than LPCC feature parameter in SNRs and recognition rate.","PeriodicalId":259430,"journal":{"name":"2007 IEEE International Conference on Granular Computing (GRC 2007)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133962589","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Organizational memory in today's business world forms basis for organizational learning, which is the ability of an organization to gain insight and understanding from experience through experimentation, observation, analysis, and a willingness to examine both successes and failures. This basically requires consideration of different aspects of knowledge that may reside on top of a conventional information management system. Of them, representation, retrieval and production issues of meta patterns constitute to the main theme of this article. Particularly we are interested in a formal approach to handle rough concepts. We utilize rough classifiers to propose a preliminary framework based on minimal term sets with p-norms to extract meta patterns. We describe a relational rule induction approach, which is called rila. Experimental results are provided on the mutagenesis, and the KDD Cup 2001 genes data sets.
在当今的商业世界中，组织记忆构成了组织学习的基础，组织学习是指一个组织通过实验、观察、分析以及对成功和失败进行检验的意愿，从经验中获得洞察力和理解的能力。这基本上需要考虑可能驻留在传统信息管理系统之上的知识的不同方面。其中，元模式的表示、检索和生成问题构成了本文的主题。我们特别感兴趣的是处理粗糙概念的正式方法。我们利用粗糙分类器提出了一个基于p-范数最小项集的初步框架来提取元模式。我们描述了一种关系规则归纳方法，称为rila。提供了诱变和KDD Cup 2001基因数据集的实验结果。
{"title":"Production and Retrieval of Rough Classes in Multi Relations","authors":"M. Tolun, H. Sever, Abdulkadir Gorur","doi":"10.1109/GrC.2007.56","DOIUrl":"https://doi.org/10.1109/GrC.2007.56","url":null,"abstract":"Organizational memory in today's business world forms basis for organizational learning, which is the ability of an organization to gain insight and understanding from experience through experimentation, observation, analysis, and a willingness to examine both successes and failures. This basically requires consideration of different aspects of knowledge that may reside on top of a conventional information management system. Of them, representation, retrieval and production issues of meta patterns constitute to the main theme of this article. Particularly we are interested in a formal approach to handle rough concepts. We utilize rough classifiers to propose a preliminary framework based on minimal term sets with p-norms to extract meta patterns. We describe a relational rule induction approach, which is called rila. Experimental results are provided on the mutagenesis, and the KDD Cup 2001 genes data sets.","PeriodicalId":259430,"journal":{"name":"2007 IEEE International Conference on Granular Computing (GRC 2007)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122377662","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
2600 years ago, YinYang was born in the ancient China with the theme "Taiji (one matter) produces YinYang; YinYang produces four forms; the four forms lead to eight diagrams; and the eight diagrams can have 64 direct combinations." This theme can be called YinYang 1-2-4-8-64. An equilibrium-based scientific decoding of YinYangl-2-4-8-64 is presented which states "Equilibrium (the one matter) has two poles (YinYang); the two poles can be mapped to a bipolar lattice with four bipolar truth values (four forms); the four values lead to eight bipolar dynamic operators (eight diagrams); and the eight operators can have 64=82 direct biological or neurobiological or any dynamic combinations. " The scientific decoding results in a bipolar dynamic logic (BDL) that satisfies four pairs of dual dynamic DeMorgan's laws and a YinYang bipolar universal modus ponens. Bipolar granular neurobiological computing with BDL is introduced.
{"title":"A Scientific Decoding of YinYang1-2-4-8-64 for Equilibrium-Based Granular Computing","authors":"Wen-Ran Zhang, J. Zhan","doi":"10.1109/GrC.2007.24","DOIUrl":"https://doi.org/10.1109/GrC.2007.24","url":null,"abstract":"2600 years ago, YinYang was born in the ancient China with the theme \"Taiji (one matter) produces YinYang; YinYang produces four forms; the four forms lead to eight diagrams; and the eight diagrams can have 64 direct combinations.\" This theme can be called YinYang 1-2-4-8-64. An equilibrium-based scientific decoding of YinYangl-2-4-8-64 is presented which states \"Equilibrium (the one matter) has two poles (YinYang); the two poles can be mapped to a bipolar lattice with four bipolar truth values (four forms); the four values lead to eight bipolar dynamic operators (eight diagrams); and the eight operators can have 64=82 direct biological or neurobiological or any dynamic combinations. \" The scientific decoding results in a bipolar dynamic logic (BDL) that satisfies four pairs of dual dynamic DeMorgan's laws and a YinYang bipolar universal modus ponens. Bipolar granular neurobiological computing with BDL is introduced.","PeriodicalId":259430,"journal":{"name":"2007 IEEE International Conference on Granular Computing (GRC 2007)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127918679","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
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.
{"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":"https://doi.org/10.1109/GRC.2007.39","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.0,"publicationDate":"2007-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114795759","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The purpose of workflow mining is to build proper model based on event-based logs and to support the analysis and design of workflow models. The workflow mining technology had become a hot research field among computer application from the late 1990's. Firstly, the definition and research significance of the workflow mining are presented. Then, we made an overview of the current workflow mining technologies including the origin of workflow mining, the mining of the workflow models, the mining of the workflow performance and the improvement in workflow models based on the workflow mining technology. Finally, the facing challenge and the development direction of workflow mining are presented.
{"title":"Overview of Workflow Mining Technology","authors":"Chunqin Gu, Huiyou Chang, Yang Yi","doi":"10.1109/GrC.2007.86","DOIUrl":"https://doi.org/10.1109/GrC.2007.86","url":null,"abstract":"The purpose of workflow mining is to build proper model based on event-based logs and to support the analysis and design of workflow models. The workflow mining technology had become a hot research field among computer application from the late 1990's. Firstly, the definition and research significance of the workflow mining are presented. Then, we made an overview of the current workflow mining technologies including the origin of workflow mining, the mining of the workflow models, the mining of the workflow performance and the improvement in workflow models based on the workflow mining technology. Finally, the facing challenge and the development direction of workflow mining are presented.","PeriodicalId":259430,"journal":{"name":"2007 IEEE International Conference on Granular Computing (GRC 2007)","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125467174","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Chang Liu, Hui Wang, S. McClean, Jun Liu, Shengli Wu
Natural language processing (NLP) techniques are believed to have the potential to aid information retrieval (IR) in terms of retrieval accuracy. In this paper we report a proof of concept study on a new approach to NLP-based IR that we propose. Documents and queries are represented as syntactic parse trees, which are generated by a natural language parser. Based on this tree structured representation of documents and queries, the matching between a document and a query is executed on their tree representations, with tree comparison as the key operation. An IR experiment is designed to test if this approach is feasible. Experimental results show that this approach is promising and has the potential to outperform the standard bag of words approach to information retrieval, especially in response to long queries.
{"title":"Syntactic Information Retrieval","authors":"Chang Liu, Hui Wang, S. McClean, Jun Liu, Shengli Wu","doi":"10.1109/GrC.2007.113","DOIUrl":"https://doi.org/10.1109/GrC.2007.113","url":null,"abstract":"Natural language processing (NLP) techniques are believed to have the potential to aid information retrieval (IR) in terms of retrieval accuracy. In this paper we report a proof of concept study on a new approach to NLP-based IR that we propose. Documents and queries are represented as syntactic parse trees, which are generated by a natural language parser. Based on this tree structured representation of documents and queries, the matching between a document and a query is executed on their tree representations, with tree comparison as the key operation. An IR experiment is designed to test if this approach is feasible. Experimental results show that this approach is promising and has the potential to outperform the standard bag of words approach to information retrieval, especially in response to long queries.","PeriodicalId":259430,"journal":{"name":"2007 IEEE International Conference on Granular Computing (GRC 2007)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125571939","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper, a new method, named granular dynamic time warping is proposed. This method is based on the granular approach of information granulation and has the characteristics of dynamic time warping approach. Thus it can be used to cluster time series with different lengths on the granular level. To cluster time series, this method first builds the corresponding granular time series, and then does the clustering on the granular time series. With this method, higher efficiency will be achieved in clustering time series, which is a goal pursued in clustering of large amount of time series. We also illustrate the prior performance of the new method with experiments.
{"title":"Clustering Time Series with Granular Dynamic Time Warping Method","authors":"Fusheng Yu, Keqiang Dong, Fei Chen, Yongke Jiang, Wenyi Zeng","doi":"10.1109/GrC.2007.34","DOIUrl":"https://doi.org/10.1109/GrC.2007.34","url":null,"abstract":"In this paper, a new method, named granular dynamic time warping is proposed. This method is based on the granular approach of information granulation and has the characteristics of dynamic time warping approach. Thus it can be used to cluster time series with different lengths on the granular level. To cluster time series, this method first builds the corresponding granular time series, and then does the clustering on the granular time series. With this method, higher efficiency will be achieved in clustering time series, which is a goal pursued in clustering of large amount of time series. We also illustrate the prior performance of the new method with experiments.","PeriodicalId":259430,"journal":{"name":"2007 IEEE International Conference on Granular Computing (GRC 2007)","volume":"24 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125929196","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Xiayu Zhang, Yongquan Yu, Baixing Chen, Feng Ye, Tan Xingxing
Load balancing is a classical problem and a research hotspot of Web intelligence. DNS load balancing is the pioneer load balancing technology. But the existing DNS dynamic load balancing strategies have shortages. This paper puts forward a new load balancing method, which is to connect extension theory with load balancing. Extension engineering method is initially proposed by Prof. Cai Wen. It has been successfully used in various applications. In this paper, we use the operation of matter-element theory, extension set, and dependent function in extension theory as well as the membership degree of fuzzy math to set up an extension-based dynamic load balancing model of heterogeneous server cluster. It is proved by experiment that the load balancing strategy is more effective, dynamic, steady-going and in real time by using this new model.
{"title":"An Extension-Based Dynamic Load Balancing Model of Heterogeneous Server Cluster","authors":"Xiayu Zhang, Yongquan Yu, Baixing Chen, Feng Ye, Tan Xingxing","doi":"10.1109/GrC.2007.67","DOIUrl":"https://doi.org/10.1109/GrC.2007.67","url":null,"abstract":"Load balancing is a classical problem and a research hotspot of Web intelligence. DNS load balancing is the pioneer load balancing technology. But the existing DNS dynamic load balancing strategies have shortages. This paper puts forward a new load balancing method, which is to connect extension theory with load balancing. Extension engineering method is initially proposed by Prof. Cai Wen. It has been successfully used in various applications. In this paper, we use the operation of matter-element theory, extension set, and dependent function in extension theory as well as the membership degree of fuzzy math to set up an extension-based dynamic load balancing model of heterogeneous server cluster. It is proved by experiment that the load balancing strategy is more effective, dynamic, steady-going and in real time by using this new model.","PeriodicalId":259430,"journal":{"name":"2007 IEEE International Conference on Granular Computing (GRC 2007)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125810133","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：