{"title":"Parameter Selection of Support Vector Regression Based on Particle Swarm Optimization","authors":"Hu Zhang, Min Wang, Xinhan Huang","doi":"10.1109/GrC.2010.121","DOIUrl":"https://doi.org/10.1109/GrC.2010.121","url":null,"abstract":"Parameters selection of support vector machine is the key issue that impacts its accurate performance. A method for support vector regression machine with basic particle swarm optimization (BPSO) algorithm is proposed in this paper. Furthermore, in order to improve the efficiency of the PSO algorithm, a linear decreasing strategy is used to dynamically change the weight. So, an improve PSO (IPSO) algorithm was also proposed in this paper. Then, two different models using BPSO and IPSO respectively were used to forecast the density of the acid-lead battery electrolyte. The experimental results indicate that both BPSO and IPSO have high prediction accuracy and efficiency. the time of the parametric searching by IPSO is obviously decreased to that of BPSO. The mean squared error (MSE) of the prediction model using BPSO is about 2.46684*10^(-4), Meanwhile, the MSE of the model using IPSO is only about 2.01948*10^(-4). So, the IPSO algorithm has more superior performance on convergence speed and global optimization.","PeriodicalId":439081,"journal":{"name":"2010 IEEE International Conference on Granular Computing","volume":"151 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123396664","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":"Descriptive Granularity","authors":"A. Wasilewska","doi":"10.1109/GrC.2010.117","DOIUrl":"https://doi.org/10.1109/GrC.2010.117","url":null,"abstract":"We present here a formal syntax and semantics for a notion of a descriptive granularity. We do so in terms of three abstract models: Descriptive, Semantic, and Granular. The descriptive model formalizes the syntactical concepts and properties of the data mining, or learning process. Semantic model formalizes its semantical properties. The Granular model establishes a relationship between the Descriptive and Semantic models in terms of a formal satisfaction relation.","PeriodicalId":439081,"journal":{"name":"2010 IEEE International Conference on Granular Computing","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123906029","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 Covering Upper Approximation by Subcovering","authors":"Shiping Wang, William Zhu, Peiyong Zhu","doi":"10.1109/GrC.2010.152","DOIUrl":"https://doi.org/10.1109/GrC.2010.152","url":null,"abstract":"Rough set theory is a useful tool for data mining to deal with the vagueness and granularity in information systems. The study of covering-based rough sets has made an interesting contribution to the classical rough set theory. Reduction is one of the fundamental and significant concepts in covering-based rough sets. This paper studies covering-based rough sets from the standpoint of the subcovering. We define a type of covering upper approximation operation through subcoverings and present basic properties for this operation. Then we explore the relationship between reducible elements in a covering, one of the core concepts in covering-based rough sets, and this type of operation. It is interesting that the covering upper approximation operation defined from this standpoint is the same as the fifth type of covering upper approximation operation.","PeriodicalId":439081,"journal":{"name":"2010 IEEE International Conference on Granular Computing","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125996000","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":"An Improved Parallel FFT Algorithm and Application in Grid Environment","authors":"Ming Chen, Yong Li, J. Zhang","doi":"10.1109/GrC.2010.137","DOIUrl":"https://doi.org/10.1109/GrC.2010.137","url":null,"abstract":"With the extensive applications of FFT in digital signal processing and image signal processing which needs a extensive application of large-scale computing, it Become more and more important to improve parallelism??? Efficient and Scalable parallel of FFT algorithm. This paper Improve the parallelism of the FFT algorithm based on the Six-Step FFT algorithm, And build up a framework Based on Grid, Through the calculation of the matrix assigned to the various nodes of grid computing and the use of hiding the transpose matrix mapping optimization strategy etc, it makes the parallel FFT algorithm high efficiency. In the end, the paper evaluates the performance of the improved FFT parallel algorithm.","PeriodicalId":439081,"journal":{"name":"2010 IEEE International Conference on Granular Computing","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124593262","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":"Assignment Reduct and its Calculation Method in Inconsistent Incomplete Decision System","authors":"Zuqiang Meng, Zhongzhi Shi, Hua Qin","doi":"10.1109/GrC.2010.118","DOIUrl":"https://doi.org/10.1109/GrC.2010.118","url":null,"abstract":"Attribute reduction is a basic issue in rough set theory. But related researches on reduction in inconsistent incomplete decision system (IIDS) are currently rarely reported. In this paper, the concept of assignment reduct is extended from inconsistent complete decision system (ICDS) to IIDS and then the property of assignment-core attribute is analysed, and finally a method to calculate assignment reduct is put forward by using the heritable trait of assignment reduct. Example analysis shows that the proposed method is effective. This work provides an effective solution for attribute reduction in IIDS.","PeriodicalId":439081,"journal":{"name":"2010 IEEE International Conference on Granular Computing","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128346221","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":"Similarity and Clustering of Footwear Prints","authors":"Yi Tang, S. Srihari, Harish Kasiviswanathan","doi":"10.1109/GrC.2010.175","DOIUrl":"https://doi.org/10.1109/GrC.2010.175","url":null,"abstract":"Research on footwear impression evidence has been gaining increasing importance in forensic science. Given a footwear impression at a crime scene, a key task is to find the closest match in a local/national database so as to determine footwear brand and model. This process is made faster if database prints are grouped into clusters of similar patterns. We describe a clustering approach based on common primitive patterns. Shape features consisting of lines, circles and ellipses are extracted from database prints using variations of the Hough transform. Then an attributed relational graph (ARG) is constructed for each known print, where each node is a primitive feature and each edge represents a spatial relationship between nodes. A footwear print distance (FPD) between ARGs is used as similarity measure. The FPD is computed between each known print and pre-determined patterns to form clusters. The use of the methodology is demonstrated with a large database of known prints.","PeriodicalId":439081,"journal":{"name":"2010 IEEE International Conference on Granular Computing","volume":"23 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129792585","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":"Information Granules of Statistical Dependence in Multiway Contingency Tables","authors":"S. Tsumoto, S. Hirano","doi":"10.1109/GrC.2010.94","DOIUrl":"https://doi.org/10.1109/GrC.2010.94","url":null,"abstract":"This paper focuses on residual analysis of statistical independence of multiple variables from the viewpoint of linear algebra. The results show that multidimensional residuals are represented as linear sum of determinants of $2 times 2$ submatrices, which can be viewed as information granules measuring the degree of statistical dependence.","PeriodicalId":439081,"journal":{"name":"2010 IEEE International Conference on Granular Computing","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127444682","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 Multi-agent System Based on Variable Neighborhood Model","authors":"S. Ubukata, Y. Kudo, T. Murai","doi":"10.1109/GrC.2010.142","DOIUrl":"https://doi.org/10.1109/GrC.2010.142","url":null,"abstract":"Agent control methods are generally required flexibility and robustness. As one of agent control methods to realize the flexibility, we proposed a variable neighborhood model in which an agent selects actions based on variable neighborhoods. In this paper, by extension, we formulate a framework of multi-agent system based on variable neighborhood model. We also discuss interactions among agents in the model.","PeriodicalId":439081,"journal":{"name":"2010 IEEE International Conference on Granular Computing","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125649599","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":"Microformats for Innovative Lexicons","authors":"Sunny Fugate, Jeffrey S. Ellen, S. Rubin","doi":"10.1109/GrC.2010.176","DOIUrl":"https://doi.org/10.1109/GrC.2010.176","url":null,"abstract":"A microformat is a set of design principles for including semantic information within standard X/HTML markup. Individual microformat entities are distributed yet share a common semantics. Each microformat is a granule of structured information containing a set of attributes. These information granules can be produced, distributed, aggregated, and consumed without reliance on centralized services. We describe the impact on the gathering, distribution, and analysis of concepts within our visual communication research. In this paper we present solutions for managing lexical consistency when microformat-structured information granules are distributed and maintained independently and asynchronously. Lexical groups and hierarchies leverage the resulting inconsistencies, utilizing term aggregation across visual and linguistic features to dynamically compose lexicons and to perform lexical analysis. We think of this as creating semantic and orthographic ’projections’ of the lexicon into different feature spaces. We show how to use this approach to construct situated lexicons which derive from shared context and social communities.","PeriodicalId":439081,"journal":{"name":"2010 IEEE International Conference on Granular Computing","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133011041","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":"Leveraging Cloud Computing in Geodatabase Management","authors":"A. Cary, Y. Yesha, M. Adjouadi, N. Rishe","doi":"10.1109/GrC.2010.163","DOIUrl":"https://doi.org/10.1109/GrC.2010.163","url":null,"abstract":"In this work, we leverage Cloud computing technologies in scaling out data management in geographical databases. In particular, we tackle the issue of data indexing in parallel. First, spatial data is partitioned and indexed in a Hadoop MapReduce cluster. Two main partitioning strategies are evaluated: a) A linear-complexity method based on Zorder values, and b) An iterative algorithm based on X-means clustering. The advantages and drawbacks of each method are weighted in with relation to query performance. Second, interactive queries are processed from a local site using the index data structures built in the Cloud. We perform an experimental study on a real dataset of 110 million spatial objects representing property parcels in the United States. Our results support Cloud computing as an effective technology to cope up with huge datasets and, in particular, MapReduce parallel programming model in easing parallel processing implementations.","PeriodicalId":439081,"journal":{"name":"2010 IEEE International Conference on Granular Computing","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126651717","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}