{"title":"Identifying the most significant genes from gene expression profiles for sample classification","authors":"H. Al-Mubaid, Noushin Ghaffari","doi":"10.1109/GRC.2006.1635887","DOIUrl":"https://doi.org/10.1109/GRC.2006.1635887","url":null,"abstract":"The gene expression data generated by the Microarray technology for thousands of genes simultaneously provide huge amounts of biomedical data in forms of gene expression profiles. This generated gene data include complex variations of expression levels of thousands of gene in the classes of samples. The gene level variations allow for classifying and clustering the samples based on only a small subset of genes. In this work, we want to identify the most significant genes that demonstrate the highest capabilities of discrimination between the classes of samples. We present a new gene selection technique for extracting the most significant genes from the huge gene/feature space in a given gene expression dataset. Our method is based on computing the discriminating capability of each gene, and classifying the data according to only those most significant genes that have highest discriminating capabilities. We also adapted from text categorization and information retrieval five feature selection techniques into the gene selection task to compare with our method. We evaluated the method using four well-known gene expression datasets. The experimental results showed that our method produces impressive and competitive results in terms of classification performance with few selected genes compared with the existing techniques.","PeriodicalId":400997,"journal":{"name":"2006 IEEE International Conference on Granular Computing","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127044245","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}
{"title":"A cutting plane algorithm for multiclass kernel discriminations","authors":"Tien-Fang Kuo, Yasutoshi Yajima","doi":"10.1109/GRC.2006.1635787","DOIUrl":"https://doi.org/10.1109/GRC.2006.1635787","url":null,"abstract":"The problem of multiclass discrimination consists in classifying patterns into a set of finite classes. Usually, a multiclass problem is decomposed into multiple binary ones and the results of the binary problems are integrated for multiclass discrimination. These discriminators, however, could result in multi-classified and/or unclassified points. Therefore, we need some tie breaking mechanisms to handle the conflict. There exist several approaches which generate all discrimi- nators in one optimization problem. In this paper, we consider the formulation introduced by Crammer and Singer (3). They introduce a quadratic programming problem with a very large number of variables which is hard to optimize. Using a cutting plane procedure, we propose a new algorithm which solves the problem in a finite number of iterations. The results of experiments on five datasets show that the proposed method achieves higher classification performance than the traditional methods by using binary algorithms.","PeriodicalId":400997,"journal":{"name":"2006 IEEE International Conference on Granular Computing","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127179850","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}
{"title":"Flooding isolated region reassignment","authors":"S. Makki, David A. Heitbrink, Xiaohua Jia","doi":"10.1109/GRC.2006.1635815","DOIUrl":"https://doi.org/10.1109/GRC.2006.1635815","url":null,"abstract":"Fuzzy C-Means (FCM) clustering is a popular technique used in image segmentation and pattern recognition. However one of the main problems with FCM clustering is the lack of spatial context. That is FCM often fails with irregularly shaped clusters. This can lead to the creation of isolated regions; isolated regions are those regions that are not connected with the main body of the clusters. We propose a post-processing technique whereby these misclassified regions are identified and reassigned to their proper clusters.","PeriodicalId":400997,"journal":{"name":"2006 IEEE International Conference on Granular Computing","volume":"130 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133361520","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}
{"title":"Dependence space of concept lattices based on rough set","authors":"Jianmin Ma, Wenxiu Zhang, Xia Wang","doi":"10.1109/GRC.2006.1635783","DOIUrl":"https://doi.org/10.1109/GRC.2006.1635783","url":null,"abstract":"Rough set theory and Formal concept analysis have much in common, in terms of both goals and methodologies. The combination of rough set theory and formal concept analysis provides new approaches for data analysis. The notions of the object oriented concepts and the attribute oriented concepts are formed by introduced formal concept and formal concept lattice into rough set theory. In this paper, the dependence spaces are constructed according to these two concept lattices. Applying to the congruences on the dependence space, the equivalent classes of the set of attributes can be got and then a closed set is also obtained. And a new approach is discussed by using the closed set to construct formal concepts.","PeriodicalId":400997,"journal":{"name":"2006 IEEE International Conference on Granular Computing","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115339658","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}
Guantao Chen, Hai Deng, Yufeng Gui, Yi Pan, Xue Wang
{"title":"Cysteine separations profiles on protein secondary structure infer disulfide connectivity","authors":"Guantao Chen, Hai Deng, Yufeng Gui, Yi Pan, Xue Wang","doi":"10.1109/GRC.2006.1635889","DOIUrl":"https://doi.org/10.1109/GRC.2006.1635889","url":null,"abstract":"Disulfide connectivity prediction from one chain of protein helps determine protein tertiary structure. The more accuracy of prediction it reaches the more precise three dimensional structures we can obtain through computational methods. Previous methods only use local sequence or secondary structure information or global sequence information or combination of the above descriptors to predict the disulfide bond pattern. Instead of using those descriptors, we take an alternative descriptor of global secondary structure to make prediction, and the highest performance among all pattern-wise methods is obtained. Cysteine separation profiles on protein secondary structure have been used to predict the disulfide connectivity of proteins. The cysteine separation profiles on secondary structure(CSPSS) represent a vector encoded from the sepeartions between any two consecutive cysteine-corresponding positions in a predicted protein secondary structure sequence. Through comparisons of their CSPSS, the disulfide connectivity of a test protein is inferred from a template set. In 4-fold of SP39, any two proteins from different groups share less than 30% sequence identity. The result shows a prediction accuracy (54%), which proves again a disulfide bond pattern is highly related to protein secondary structure.","PeriodicalId":400997,"journal":{"name":"2006 IEEE International Conference on Granular Computing","volume":"140 18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124336258","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}
{"title":"XHMG: Content-Based Web HyperMedia Modeling and Retrieval System","authors":"I. Radev","doi":"10.1109/GRC.2006.1635895","DOIUrl":"https://doi.org/10.1109/GRC.2006.1635895","url":null,"abstract":"Many studies concentrate on developing attractive Web applications, but very few discuss the fundamental problems of modeling, integration and retrieval of Web hypermedia data from heterogeneous data sources based on its content and semantics. The main focus of this paper is the modeling facilities in the XHMG system for content-based representation, integration and retrieval of heterogeneous Web data. The paper shows the basic XHMG structural instruments for Web and Web page content representation. The most important application of this approach is handling and integrating the hypermedia information in the Web based on its content and meaning. The research in this paper will have a potentially large impact on the technologies used in information sources for e-business, e-advertising, e-commerce, e-government, e-learning, portals, digital libraries, Web search engines, online catalogs.","PeriodicalId":400997,"journal":{"name":"2006 IEEE International Conference on Granular Computing","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121369853","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}
{"title":"A granular computing view on function approximation","authors":"Xiao-Jun Zeng, J. Keane","doi":"10.1109/GRC.2006.1635789","DOIUrl":"https://doi.org/10.1109/GRC.2006.1635789","url":null,"abstract":"This paper investigates function approximation problem from a granular computing point of view and proposes a new granular based approximation scheme. It is proved that the proposed scheme has the universal approximation property and then is generally applicable for wide applications. Compared with the widely used approximation schemes such as fuzzy systems and neural networks, the proposed approximation scheme has several interesting and useful features such as a global view to achieve the comprehensive understanding about the behaviors of functions or systems being approximated, as good interpretability and transparency as fuzzy systems but much more powerful in overcoming the curse of dimensionality, and much more flexible and effective in incremental learning. Index Terms—Granular computing, function approximation, interval analysis, fuzzy systems, neural networks.","PeriodicalId":400997,"journal":{"name":"2006 IEEE International Conference on Granular Computing","volume":"763 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116131789","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}
{"title":"The entropy for rough fuzzy sets","authors":"Z. Chengyi, Wei Bencheng, Cheng Guohui, Fu Haiyan","doi":"10.1109/GRC.2006.1635802","DOIUrl":"https://doi.org/10.1109/GRC.2006.1635802","url":null,"abstract":"The entropy, fuzzy positive entropy and fuzzy negative entropy measure for rough fuzzy sets are proposed. Some properties of entropy measure for rough fuzzy sets are discussed. It is also shown that the proposed measure can be defined in terms of the ratio of rough fuzzy cardinalities.","PeriodicalId":400997,"journal":{"name":"2006 IEEE International Conference on Granular Computing","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123335739","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}
E. Shakshuki, S. Hussain, A. W. Matin, A. R. Matin
{"title":"Agent-based peer-to-peer layered architecture for data transfer in wireless sensor networks","authors":"E. Shakshuki, S. Hussain, A. W. Matin, A. R. Matin","doi":"10.1109/GRC.2006.1635847","DOIUrl":"https://doi.org/10.1109/GRC.2006.1635847","url":null,"abstract":"Recently, there has been a growing interest in the potential use of Wireless Sensor Networks (WSNs) in many applications such as smart environments, disaster management, combat field reconnaissance, and security surveillance. Therefore, to realize their potential, there is a need of an architecture that facilities the deployment of a network that is optimized in terms of energy, query and network configuration. This paper focuses on developing agent-based peer-to-peer layered system architecture for data transfer in WSNs. The architecture has three layers: application, database and network. At each layer, agents interact as peers; however, agents at base- station are computation intensive and agents at sensor nodes require very limited energy and computing resources. The application layer is the highest layer where peers exchange data requests and results. The database layer is the middle layer where peers exchange query execution plans and the query results. The network layer is the lowest layer where peers exchange the routing information and sensor data. The proposed system is implemented in Java and mica2 motes.","PeriodicalId":400997,"journal":{"name":"2006 IEEE International Conference on Granular Computing","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128274151","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}
Wang Yi, Liu Wenhui, Wang Tianzhu, Han Dongfeng, Meng Yu
{"title":"Collision detection for deforming linear objects using particle swarm optimization","authors":"Wang Yi, Liu Wenhui, Wang Tianzhu, Han Dongfeng, Meng Yu","doi":"10.1109/GRC.2006.1635841","DOIUrl":"https://doi.org/10.1109/GRC.2006.1635841","url":null,"abstract":"In this paper we investigate the application of particle swarm optimization in detecting collisions, including self- collisions, between deformable linear objects. This approach makes use of speciation technique to multi-local optimization in dynamic environment caused by deformation and reduces the computational needs by exploiting spatial relationships between the primitives and also frame-to-frame coherence to find solutions. Experimental results prove the efficiency and applicability of our approach.","PeriodicalId":400997,"journal":{"name":"2006 IEEE International Conference on Granular Computing","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127261858","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}