Pub Date : 2009-09-22DOI: 10.1109/GRC.2009.5255131
Zhengwei Guo, Jinan Zhang
METAR report was decoded by computer. The undecoded reports may be lost or misinterpreted. In this paper we describe a new approach for METAR report decoding based on Finite automata and regular expression. Following an introduction of the METAR report, we describe the pattern for METAR report and discourse how to decode an error report appropriately enough. This approach has been applied to civil aviation meteorological project, and has 44 airports in the country running.
{"title":"An approach for METAR report decode based on finite automata","authors":"Zhengwei Guo, Jinan Zhang","doi":"10.1109/GRC.2009.5255131","DOIUrl":"https://doi.org/10.1109/GRC.2009.5255131","url":null,"abstract":"METAR report was decoded by computer. The undecoded reports may be lost or misinterpreted. In this paper we describe a new approach for METAR report decoding based on Finite automata and regular expression. Following an introduction of the METAR report, we describe the pattern for METAR report and discourse how to decode an error report appropriately enough. This approach has been applied to civil aviation meteorological project, and has 44 airports in the country running.","PeriodicalId":388774,"journal":{"name":"2009 IEEE International Conference on Granular Computing","volume":"157 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133802797","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}
Pub Date : 2009-09-22DOI: 10.1109/GRC.2009.5255112
Baoqing Jiang, C. Han, Lingsheng Li
Lots of association rules may be generated in the process of association rules minging. It leads to users hard to find important information they needed. The maximal Boolean association rules have the advantages that these rules contain a small number and don't lose the rules' information. Thereby it increased the efficiency of the users' analysis about the rules and saved the storage space. Opened frequent itemsets and closed frequent itemsets can be used to mine the maximal Boolean association rules. In this paper, we analyse the property of maximal Boolean association rules and propose an algorithm of mining opened frequent itemset. Finally, we verify this algorithm by an example.
{"title":"Mining opened frequent itemsets to generate maximal Boolean association rules","authors":"Baoqing Jiang, C. Han, Lingsheng Li","doi":"10.1109/GRC.2009.5255112","DOIUrl":"https://doi.org/10.1109/GRC.2009.5255112","url":null,"abstract":"Lots of association rules may be generated in the process of association rules minging. It leads to users hard to find important information they needed. The maximal Boolean association rules have the advantages that these rules contain a small number and don't lose the rules' information. Thereby it increased the efficiency of the users' analysis about the rules and saved the storage space. Opened frequent itemsets and closed frequent itemsets can be used to mine the maximal Boolean association rules. In this paper, we analyse the property of maximal Boolean association rules and propose an algorithm of mining opened frequent itemset. Finally, we verify this algorithm by an example.","PeriodicalId":388774,"journal":{"name":"2009 IEEE International Conference on Granular Computing","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117251940","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}
Pub Date : 2009-09-22DOI: 10.1109/GRC.2009.5255057
Wei Wang, Q. Zheng, Jun Liu, Yingying Chen, Pengfei Tang
Knowledge element relation recognition is to mine intrinsic and hidden relations, i.e., preorder, analogy and illustration from knowledge element set, which can be used in knowledge organization and knowledge navigation system. This paper focuses on what information is employed to recognize knowledge element relations. First, a formal definition of knowledge element and the types of relation are given. Next, an algorithm for knowledge element sort is proposed to gain the sequence number of knowledge element. Then, information of term, type, distance, knowledge element relation level and document level is selected to represent candidate relation instances. Evaluation on the four data sets related to “computer” discipline, using Support Vector Machines, shows that term, type and distance features contribute to most of the performance improvement, and incorporation of all features can achieve excellent performance of relation recognition, whose F1 Micro-averaged measure is above 83%.
{"title":"Exploiting various information for knowledge element relation recognition","authors":"Wei Wang, Q. Zheng, Jun Liu, Yingying Chen, Pengfei Tang","doi":"10.1109/GRC.2009.5255057","DOIUrl":"https://doi.org/10.1109/GRC.2009.5255057","url":null,"abstract":"Knowledge element relation recognition is to mine intrinsic and hidden relations, i.e., preorder, analogy and illustration from knowledge element set, which can be used in knowledge organization and knowledge navigation system. This paper focuses on what information is employed to recognize knowledge element relations. First, a formal definition of knowledge element and the types of relation are given. Next, an algorithm for knowledge element sort is proposed to gain the sequence number of knowledge element. Then, information of term, type, distance, knowledge element relation level and document level is selected to represent candidate relation instances. Evaluation on the four data sets related to “computer” discipline, using Support Vector Machines, shows that term, type and distance features contribute to most of the performance improvement, and incorporation of all features can achieve excellent performance of relation recognition, whose F1 Micro-averaged measure is above 83%.","PeriodicalId":388774,"journal":{"name":"2009 IEEE International Conference on Granular Computing","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126173558","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}
Pub Date : 2009-09-22DOI: 10.1109/GRC.2009.5255022
Xuehai Yuan, Hongxing Li
In the paper, by the use of the neighborhood relations between fuzzy points and fuzzy relations, the concept of (β̅,α̅)-fuzzy equivalent relation is presented. Firstly, we derived that the acceptable non-trivial concepts obtained in this manner are the (∈, ∈)-fuzzy equivalent relation, (∈, ∈∨q)-fuzzy equivalent relation and (∈̅, ∈̅ ∨q)-fuzzy equivalent relation. Secondly, we generalized that the (∈, ∈)-fuzzy equivalent relation, the (∈, ∈q)-fuzzy equivalent relation and the (∈̅, ∈̅ ∨q̅)-fuzzy equivalent relation to the (λ, µ]-fuzzy equivalent relation. We proved that R is a (λ, µ]-fuzzy equivalent relation if and only if, for any t ∈ (λ, µ], the cut relation Rt is a equivalent relation.
{"title":"Generalized fuzzy equivalent relations","authors":"Xuehai Yuan, Hongxing Li","doi":"10.1109/GRC.2009.5255022","DOIUrl":"https://doi.org/10.1109/GRC.2009.5255022","url":null,"abstract":"In the paper, by the use of the neighborhood relations between fuzzy points and fuzzy relations, the concept of (β̅,α̅)-fuzzy equivalent relation is presented. Firstly, we derived that the acceptable non-trivial concepts obtained in this manner are the (∈, ∈)-fuzzy equivalent relation, (∈, ∈∨q)-fuzzy equivalent relation and (∈̅, ∈̅ ∨q)-fuzzy equivalent relation. Secondly, we generalized that the (∈, ∈)-fuzzy equivalent relation, the (∈, ∈q)-fuzzy equivalent relation and the (∈̅, ∈̅ ∨q̅)-fuzzy equivalent relation to the (λ, µ]-fuzzy equivalent relation. We proved that R is a (λ, µ]-fuzzy equivalent relation if and only if, for any t ∈ (λ, µ], the cut relation R<inf>t</inf> is a equivalent relation.","PeriodicalId":388774,"journal":{"name":"2009 IEEE International Conference on Granular Computing","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116681310","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}
Pub Date : 2009-09-22DOI: 10.1109/GRC.2009.5255162
Jingnian Chen, Shujun Fu, Taorong Qiu
By deleting irrelevant or redundant attributes of a data set, selective classifiers can effectively improve the accuracy and efficiency of classification. Though many selective classifiers have been proposed, most of them deal with complete data. Yet actual data sets are often incomplete and have many redundant or irrelevant attributes. So constructing selective classifiers for incomplete data is important. With former work and Information gain ratio, a hybrid selective classifier for incomplete data, denoted as GBSD, is presented. Experiment results on twelve benchmark incomplete data sets show that GBSD can effectively improve the accuracy and efficiency of classification while enormously reducing the number of attributes.
{"title":"Gain-ratio-Based Selective classifiers for incomplete data","authors":"Jingnian Chen, Shujun Fu, Taorong Qiu","doi":"10.1109/GRC.2009.5255162","DOIUrl":"https://doi.org/10.1109/GRC.2009.5255162","url":null,"abstract":"By deleting irrelevant or redundant attributes of a data set, selective classifiers can effectively improve the accuracy and efficiency of classification. Though many selective classifiers have been proposed, most of them deal with complete data. Yet actual data sets are often incomplete and have many redundant or irrelevant attributes. So constructing selective classifiers for incomplete data is important. With former work and Information gain ratio, a hybrid selective classifier for incomplete data, denoted as GBSD, is presented. Experiment results on twelve benchmark incomplete data sets show that GBSD can effectively improve the accuracy and efficiency of classification while enormously reducing the number of attributes.","PeriodicalId":388774,"journal":{"name":"2009 IEEE International Conference on Granular Computing","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125129730","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}
Delay Tolerant Network (DTN) is an intermittently connected mobile wireless network in which the connectivity between nodes changes frequently due to nodes' movement. Recently, there have been a lot of researches working on this area. However, to the best of our knowledge, no work has addressed on the DTN routing which focuses on the heterogeneous network environment in the literature. In this work, we propose a prediction based routing protocol for the heterogeneous delay tolerant networks wherein edge servers are distributed over the borders of the different network domains. A location prediction algorithm based on the user online logs to intelligently estimate the most possible future location of the destination, if the destination is currently unavailable. Then an edge server selection algorithm based on fuzzy logic system is exploited to select the close-by intermediate node on the path to the destination so that the messages can be saved temporarily for the destination after the location of the destination is predicted. The experimental results exhibit that the proposed routing protocol can efficiently deliver the message under limited buffer space, comparing with two representative delay tolerant network routing protocols in the literature. The scalability of the proposed work is also confirmed in the simulations.
{"title":"A fuzzy logic-based routing for Delay-Tolerant heterogeneous Networks","authors":"Chenn-Jung Huang, Hung-Yen Shen, Jia-Jian Liao, Kai-Wen Hu, Dian-Xiu Yang, Chun-Hua Chen, Yi-Ta Chuang","doi":"10.1109/GRC.2009.5255119","DOIUrl":"https://doi.org/10.1109/GRC.2009.5255119","url":null,"abstract":"Delay Tolerant Network (DTN) is an intermittently connected mobile wireless network in which the connectivity between nodes changes frequently due to nodes' movement. Recently, there have been a lot of researches working on this area. However, to the best of our knowledge, no work has addressed on the DTN routing which focuses on the heterogeneous network environment in the literature. In this work, we propose a prediction based routing protocol for the heterogeneous delay tolerant networks wherein edge servers are distributed over the borders of the different network domains. A location prediction algorithm based on the user online logs to intelligently estimate the most possible future location of the destination, if the destination is currently unavailable. Then an edge server selection algorithm based on fuzzy logic system is exploited to select the close-by intermediate node on the path to the destination so that the messages can be saved temporarily for the destination after the location of the destination is predicted. The experimental results exhibit that the proposed routing protocol can efficiently deliver the message under limited buffer space, comparing with two representative delay tolerant network routing protocols in the literature. The scalability of the proposed work is also confirmed in the simulations.","PeriodicalId":388774,"journal":{"name":"2009 IEEE International Conference on Granular Computing","volume":"350 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131560021","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}
Pub Date : 2009-09-22DOI: 10.1109/GRC.2009.5255171
S. Miyamoto
Bags alias multisets have been known to be a fundamental tool for information system models. Hence bags have been studied for a long time by famous computer scientists. Fuzzy bags have originally been proposed by Yager, and several researches about their applications have been done. Miyamoto established fundamental operations of fuzzy bags, and proposed generalized bags that include real-valued bags and fuzzy bags at the same time. Nevertheless, real usefulness of bag theory should be shown by studying complements, s-norms of bags, and bag relations. In the first part, we consider real-valued bags. After briefly reviewing basic relations and operations of classical bags, we introduce two types of complementation operations, and then introduce s-norms and t-norms of bags. A key idea is to use the infinite point into the domain of membership values. Fundamental properties such as duality of s-norms and t-norms are shown. As a result, an s-norm of a Minkowski type and its dual t-norm are derived. Another useful tool is bag relations. We define three types of compositions of max-s, max-t, and min-s operations for bag relations and prove that the compositions can be handled like matrix calculations. We moreover mention applications of bag relations to networks and data analysis, and suggest possible applications of bags to decision making using convex functions. In the second part, we study a class of generalized bags that are smallest extension of real-valued bags and fuzzy bags. It is proved that the generalized bags are in a sense equivalent to fuzzy number-valued bags. Using alpha-cuts, many operations of real-valued bags except a complementation are generalized to the corresponding operations of generalized bags, and fundamental properties are proved.
{"title":"Generalized bags and their relations: An alternative model for fuzzy set theory and applications","authors":"S. Miyamoto","doi":"10.1109/GRC.2009.5255171","DOIUrl":"https://doi.org/10.1109/GRC.2009.5255171","url":null,"abstract":"Bags alias multisets have been known to be a fundamental tool for information system models. Hence bags have been studied for a long time by famous computer scientists. Fuzzy bags have originally been proposed by Yager, and several researches about their applications have been done. Miyamoto established fundamental operations of fuzzy bags, and proposed generalized bags that include real-valued bags and fuzzy bags at the same time. Nevertheless, real usefulness of bag theory should be shown by studying complements, s-norms of bags, and bag relations. In the first part, we consider real-valued bags. After briefly reviewing basic relations and operations of classical bags, we introduce two types of complementation operations, and then introduce s-norms and t-norms of bags. A key idea is to use the infinite point into the domain of membership values. Fundamental properties such as duality of s-norms and t-norms are shown. As a result, an s-norm of a Minkowski type and its dual t-norm are derived. Another useful tool is bag relations. We define three types of compositions of max-s, max-t, and min-s operations for bag relations and prove that the compositions can be handled like matrix calculations. We moreover mention applications of bag relations to networks and data analysis, and suggest possible applications of bags to decision making using convex functions. In the second part, we study a class of generalized bags that are smallest extension of real-valued bags and fuzzy bags. It is proved that the generalized bags are in a sense equivalent to fuzzy number-valued bags. Using alpha-cuts, many operations of real-valued bags except a complementation are generalized to the corresponding operations of generalized bags, and fundamental properties are proved.","PeriodicalId":388774,"journal":{"name":"2009 IEEE International Conference on Granular Computing","volume":"128 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115166423","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}
Pub Date : 2009-09-22DOI: 10.1109/GRC.2009.5255099
Shengwei Li, Lingsheng Li, C. Han
Closed frequent itemsets provide a minimal representation of the itemset without losing their support information and they can greatly reduce the number of patterns. So how to obtain all the closed frequent itemsets effectively is of good importance. This paper constructs a FP-Tree according the matrix which only scans the database once. Also we design an algorithm to mine closed frequent itemsets which use the structure of the FP-Tree. We construct a link for every single node in the FP-Tree, and then give the closed frequent itemsets and the pruning of the link. This algorithm is an algorithm which only scans the database once, also it avoids the defect about patterns tree based on terms and can mine the closed frequent items efficiently.
{"title":"Mining closed frequent itemset based on FP-Tree","authors":"Shengwei Li, Lingsheng Li, C. Han","doi":"10.1109/GRC.2009.5255099","DOIUrl":"https://doi.org/10.1109/GRC.2009.5255099","url":null,"abstract":"Closed frequent itemsets provide a minimal representation of the itemset without losing their support information and they can greatly reduce the number of patterns. So how to obtain all the closed frequent itemsets effectively is of good importance. This paper constructs a FP-Tree according the matrix which only scans the database once. Also we design an algorithm to mine closed frequent itemsets which use the structure of the FP-Tree. We construct a link for every single node in the FP-Tree, and then give the closed frequent itemsets and the pruning of the link. This algorithm is an algorithm which only scans the database once, also it avoids the defect about patterns tree based on terms and can mine the closed frequent items efficiently.","PeriodicalId":388774,"journal":{"name":"2009 IEEE International Conference on Granular Computing","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132651589","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}
Pub Date : 2009-09-22DOI: 10.1109/GRC.2009.5255036
Lin Yan, Qing Liu
Granular resolution and granular reasoning are important research results on granular computing. The relationship between them is an interesting topic, which is studied in this paper. The investigations show that a G-resovlent sequence, the representation of granular resolution, is a sufficient condition for granular reasoning. Moreover, further research ideas have been raised, which are aimed at getting the necessary and sufficient condition for granular reasoning. These build a bridge between granular resolution and granular reasoning.
{"title":"Granular resolution and granular reasoning","authors":"Lin Yan, Qing Liu","doi":"10.1109/GRC.2009.5255036","DOIUrl":"https://doi.org/10.1109/GRC.2009.5255036","url":null,"abstract":"Granular resolution and granular reasoning are important research results on granular computing. The relationship between them is an interesting topic, which is studied in this paper. The investigations show that a G-resovlent sequence, the representation of granular resolution, is a sufficient condition for granular reasoning. Moreover, further research ideas have been raised, which are aimed at getting the necessary and sufficient condition for granular reasoning. These build a bridge between granular resolution and granular reasoning.","PeriodicalId":388774,"journal":{"name":"2009 IEEE International Conference on Granular Computing","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132694921","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}
Pub Date : 2009-09-22DOI: 10.1109/GRC.2009.5255076
Fei Peng, Guangjun Xie, Tianhao Wu
This paper applies a standard genetic algorithm to the optimization of the quantum circuits. We propose a new coding scheme, which encodes quantum gates as integers and stores circuit topology information in the position of the integers. The design of the corresponding fitness function and genetic operators are also discussed. The quantum teleportation circuit, a typical quantum computation process, is chosen as our optimization target. Finally, the experiment results are discussed, and an optimized teleportation circuit has been obtained.
{"title":"Optimizing quantum teleportation circuit using genetic algorithm","authors":"Fei Peng, Guangjun Xie, Tianhao Wu","doi":"10.1109/GRC.2009.5255076","DOIUrl":"https://doi.org/10.1109/GRC.2009.5255076","url":null,"abstract":"This paper applies a standard genetic algorithm to the optimization of the quantum circuits. We propose a new coding scheme, which encodes quantum gates as integers and stores circuit topology information in the position of the integers. The design of the corresponding fitness function and genetic operators are also discussed. The quantum teleportation circuit, a typical quantum computation process, is chosen as our optimization target. Finally, the experiment results are discussed, and an optimized teleportation circuit has been obtained.","PeriodicalId":388774,"journal":{"name":"2009 IEEE International Conference on Granular Computing","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134030515","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
扫码关注我们
求助内容：
应助结果提醒方式：