{"title":"A New Clustering Method Based on Weighted Kernel K-Means for Non-linear Data","authors":"A. Rasouli, M. A. Maarof, M. Shamsi","doi":"10.1109/SoCPaR.2009.17","DOIUrl":"https://doi.org/10.1109/SoCPaR.2009.17","url":null,"abstract":"Clustering is the process of gathering objects into groups based on their feature’s similarity. In this paper, we concentrate on Weighted Kernel K-Means method for its capability to manage nonlinear separability and high dimensionality in the data. A new slight modification of WKM algorithm has been proposed and tested on real Rice data. The results show that the accuracy of proposed algorithm is higher than other famous clustering algorithm and ensures that the WKM is a good solution for real world problems.","PeriodicalId":284743,"journal":{"name":"2009 International Conference of Soft Computing and Pattern Recognition","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123831935","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 Agent Based Trading Game for Risk Adversity Level Estimation","authors":"P. Pandey, Sambatur Hemant, D. V. Khanh","doi":"10.1109/SoCPaR.2009.34","DOIUrl":"https://doi.org/10.1109/SoCPaR.2009.34","url":null,"abstract":"Portfolio optimization based on the behavior and risk appetite of the heterogeneous investor community in financial markets has been very difficult to model and predict accurately. In this paper, firstly we attempt to simulate a multi-agent based stock market; where different types of agents are modeled to trade stocks using various strategies. The observations from trading activity of the user are in turn used to assess the risk adversity level (RAL) by using a suitable fuzzy logic model. RAL score from the fuzzy model serves as input to perform portfolio optimization using Genetic algorithm. We further analyze and evaluate the optimum portfolio performance for different risk adversity level","PeriodicalId":284743,"journal":{"name":"2009 International Conference of Soft Computing and Pattern Recognition","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124660608","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":"Profile Adaptation in Adaptive Information Filtering: An Immune Inspired Approach","authors":"Nurulhuda Firdaus Mohd Azmi, J. Timmis, F. Polack","doi":"10.1109/SOCPAR.2009.87","DOIUrl":"https://doi.org/10.1109/SOCPAR.2009.87","url":null,"abstract":"Within the context of information filtering, learning and adaptation of user profiles is a challenging research area and is, in part, addressed by work in Adaptive Information Filtering (AIF). In order to be effective in a dynamic context, maintaining filtering performance, information filtering systems need to adapt to changes. We argue that artificial immune systems (AIS) exhibit the properties required by AIF, and have the potential to be exploited in the context of AIF. In this paper, we extract general features of immune systems and AIF, based on a principled meta-probe approach. We then propose an architecture for AIF incorporating ideas from AIS. Having such characteristics as adaptability, diversity and self-organised, we argue that AIS have suitable characteristics that are amenable to the task of AIF.","PeriodicalId":284743,"journal":{"name":"2009 International Conference of Soft Computing and Pattern Recognition","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125041031","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}
Muhammad Reza Pourshahabi, H. Pourreza, O. Findl, R. D. Kakhki, W. Buehl
{"title":"CPCO: Contourlet Based PCO Quantification System","authors":"Muhammad Reza Pourshahabi, H. Pourreza, O. Findl, R. D. Kakhki, W. Buehl","doi":"10.1109/SoCPaR.2009.86","DOIUrl":"https://doi.org/10.1109/SoCPaR.2009.86","url":null,"abstract":"Nowadays, Posterior Capsule Opacification (PCO)is a common postoperative complication of cataract surgery. The rate of incidence and the intensity of PCO are affected by factors such as type and shape of implanted intraocular lens(IOL), cataract surgical techniques and etc. Clinical quantification of PCO is so subjective that evaluating the effects of these factors on PCO are varying among studies. The need for a reliable and efficient automated PCO quantification system is highly desired and many researchers tried to design such a system till now. In this paper a new fully automated Contourlet based PCO quantification system (CPCO) is presented. Comparing this system with other subjective and objective systems shows the reliability and correctness of CPCO system.","PeriodicalId":284743,"journal":{"name":"2009 International Conference of Soft Computing and Pattern Recognition","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122009688","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}
Sim Hiew Moi, Nazeema Binti Abdul Rahim, Puteh Saad, Pang Li Sim, Z. Zakaria, S. Ibrahim
{"title":"Iris Biometric Cryptography for Identity Document","authors":"Sim Hiew Moi, Nazeema Binti Abdul Rahim, Puteh Saad, Pang Li Sim, Z. Zakaria, S. Ibrahim","doi":"10.1109/SoCPaR.2009.149","DOIUrl":"https://doi.org/10.1109/SoCPaR.2009.149","url":null,"abstract":"Currently, it is noticed that users tend to choose shorter password as their authentication which can be easily attacked. Biometric technologies such as fingerprint scanning, voice authentication, face recognition, signature, hand geometry and iris recognition is now playing an important role especially in application related to security issue. In this work, we present an approach to generate a unique and more secure cryptographic key from iris template. The iris images are processed to produce iris template or code to be utilized for the encryption and decryption tasks. AES cryptography algorithm are employed to encrypt and decrypt the identity data. Distance metric such as hamming distance and Euclidean distance are used for the template matching identification process. Experimental results show that this system can obtain a higher security with a low false rejection or false acceptance rate.","PeriodicalId":284743,"journal":{"name":"2009 International Conference of Soft Computing and Pattern Recognition","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131305921","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":"Template Design Using Extremal Optimization with Multiple Search Operators","authors":"R. Chiong, T. Weise, B. Lau","doi":"10.1109/SoCPaR.2009.49","DOIUrl":"https://doi.org/10.1109/SoCPaR.2009.49","url":null,"abstract":"The template design problem is a constrained optimization problem originated from the printing industry. It involves printing several variations of a design onto one or more stencil sheets, where the aims are to minimize the number of stencils as well as the overproduction of prints of a particular design. Over the years, exact solution methods have been used to solve the problem. These methods could be useful for small to moderate-sized problem instances. However, when the problem instances are huge, the search space may easily grow too large for the systematic approaches. To date, no meta-heuristic or soft computing techniques have been used for this problem. In this paper, we propose the use of Extremal Optimization (EO) with multiple search operators for solving the template design problem. Different combinations of the search operators are tested via extensive numerical experiments. The results show that EO is indeed a feasible approach for template design optimization. The hybridization of EO with a deterministic local search has proven to be particularly effective.","PeriodicalId":284743,"journal":{"name":"2009 International Conference of Soft Computing and Pattern Recognition","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127070759","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":"Fuzzy Logic Based Implementation of a Real-Time Gait Phase Detection Algorithm Using Kinematical Parameters for Walking","authors":"C. Senanayake, S. M. N. Arosha Senanayake","doi":"10.1109/SoCPaR.2009.116","DOIUrl":"https://doi.org/10.1109/SoCPaR.2009.116","url":null,"abstract":"The concept of fuzzy logic was applied to develop a gait phase detection algorithm, to address the complexity of distinguishing between gait phases based on gait parameters obtained for walking. The proposed intelligent algorithm detects seven gait phases taking into consideration only joint parameters. Three inertial sensors were placed at the thigh, shank and foot in order to acquire hip, knee and ankle joint angles. The main objective is to incorporate the algorithm to a rehabilitation device in order to determine accurate timing for feedback. The gait phases detected could also be analyzed to identify normal and abnormal gait depending on the sequence of gait phases detected. Experiments were carried out to validate the feasibility of the algorithm with the acquisition of the joint parameters for five gait cycles. This paper also elaborates the results obtained along with the graphical representation of the gait parameters and the gait phases detected for normal and abnormal walking gait.","PeriodicalId":284743,"journal":{"name":"2009 International Conference of Soft Computing and Pattern Recognition","volume":"157 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133516467","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}
Zi-jun Yu, Weigang Wu, Jing Xiao, Jun Zhang, Rui-zhang Huang, Ou Liu
{"title":"Keyword Combination Extraction in Text Categorization Based on Ant Colony Optimization","authors":"Zi-jun Yu, Weigang Wu, Jing Xiao, Jun Zhang, Rui-zhang Huang, Ou Liu","doi":"10.1109/SoCPaR.2009.90","DOIUrl":"https://doi.org/10.1109/SoCPaR.2009.90","url":null,"abstract":"Due to the increasing number of documents in digital form, the automated text categorization (TC) has become more and more promising in the last ten years. A TC system can automatically assign a document with the most suitable category, but the reason for such an assignment is usually unknown by users. To make the TC system be interpretable, it is necessary to select a group of keywords, or termed a keyword combination, to describe each text category. In this paper, we propose a novel algorithm, keyword combination extraction based on ant colony optimization (KCEACO), to search the optimal keyword combination of a target category. By extending the traditional feature selection techniques, an evaluation function is designed for evaluating a keyword combination. This function takes into account the relationships among different keywords. Experimental results show that KCEACO can efficiently find the optimal keyword combination from a large number of candidate combinations.","PeriodicalId":284743,"journal":{"name":"2009 International Conference of Soft Computing and Pattern Recognition","volume":"85 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114133138","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":"Navigation and Browsing of Image Databases","authors":"William Plant, G. Schaefer","doi":"10.1109/SoCPaR.2009.152","DOIUrl":"https://doi.org/10.1109/SoCPaR.2009.152","url":null,"abstract":"Image collections are growing at an exponential rate and solutions to manage vast databases of images are hence highly sought after. Content-based image retrieval techniques have shown great potential, yet commonly employed approaches like query-by-example are only of limited usefulness. An interesting alternative is provided by systems that allow visual exploration of an image dataset through a browsing interface. In these methods the complete database, or parts thereof, is visualised through application of dimensionality reduction techniques, clustered visualisations or display of a graph structure. Once visualised, it should then be possible to browse through the collection in an interactive, intuitive and efficient way. In this paper we present various browsing techniques that can be employed for this purpose. Browsing can be achieved in several ways. We can distinguish between horizontal browsing which works on images of the visualisation plane, and includes operations such as panning, zooming, magnification and scaling, and vertical browsing which allows navigation to a different level of a hierarchically organised visualisation. Furthermore, browsing can also be accomplished by taking into account time stamp information, hence enabling temporal browsing. We conclude, highlighting the need for objective evaluation and benchmarking of browsing system and see one of the next research challenges in the development of effective image browsing tools for mobile devices.","PeriodicalId":284743,"journal":{"name":"2009 International Conference of Soft Computing and Pattern Recognition","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125774493","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":"Putting the Intelligent Collaboration Model in Practice within the Cleverpal Environment","authors":"E. Oliveira, P. Tedesco","doi":"10.1109/SoCPaR.2009.137","DOIUrl":"https://doi.org/10.1109/SoCPaR.2009.137","url":null,"abstract":"As a way of overcoming a general feeling of isolation and consequent high student evasion in Virtual Learning Environments (VLE), this article presents results of an experience with the i-collaboration model that promotes the collaboration between users in VLE. I-Collaboration is based on the usage of the virtual companion agents’ (VLC) as collaboration monitors. The VLC are integrated with VLE collaborative tools and know each student personality (MBTI) and behavior in the VLE. Based on these information, the VLC provides students with a distinct perception and experience of the VLE. This fosters students’ motivation to keep learning and collaborating, based on their own needs.","PeriodicalId":284743,"journal":{"name":"2009 International Conference of Soft Computing and Pattern Recognition","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126691041","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}