{"title":"A data mining algorithm for mining region-aware cyclic patterns","authors":"Sheng-Hao Chung, W. Chang, K. W. Lin","doi":"10.1109/HIS.2011.6122195","DOIUrl":"https://doi.org/10.1109/HIS.2011.6122195","url":null,"abstract":"Advances in wireless communication and microelectronic devices technologies have achieved the success production of low-power micro-sensors, enabling the large scale deployment of wireless sensor networks (WSNs). In order to track objects energy efficiently in OTSNs, many methods have been proposed but the performance is still not satisfactory. In fact, improving the performance of flooding is necessary for energy efficiently object tracking in WSNs. In this paper, we will propose a data mining method for discovering the partition structure, which can be applied to the improvement of flooding in OTSNs. Through empirical evaluation on various simulation conditions, our proposed method is shown to deliver excellent performance in terms of accuracy and execution efficiency.","PeriodicalId":418397,"journal":{"name":"2011 11th International Conference on Hybrid Intelligent Systems (HIS)","volume":"343 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125802533","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 fuzzy k-medoids clustering algorithm with optimized number of clusters","authors":"Akhtar Sabzi, Y. Farjami, Morteza Zihayat","doi":"10.1109/HIS.2011.6122106","DOIUrl":"https://doi.org/10.1109/HIS.2011.6122106","url":null,"abstract":"K-medoids algorithm is one of the most prominent techniques, as a partitioning clustering algorithm, in data mining and knowledge discovery applications. However, the determined numbers of cluster as an input and the impact of initial value of cluster centers on clusters' quality are the two major challenges of this algorithm. In this paper an improved version of fuzzy k-medoids algorithm has been proposed. Applying entropy concept as a complementary factor in optimization problem of fuzzy k-medoids has become to obtain more accurate centers. Also, using this factor, number of clusters has been achieved effectively. The results show that the proposed method outperforms fuzzy k-medoids in terms of accuracy of obtained centers.","PeriodicalId":418397,"journal":{"name":"2011 11th International Conference on Hybrid Intelligent Systems (HIS)","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128120891","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}
Alessandro Bokan Garay, Guillermo Ponce Contreras, R. E. Patiño-Escarcina
{"title":"A GH-SOM optimization with SOM labelling and dunn index","authors":"Alessandro Bokan Garay, Guillermo Ponce Contreras, R. E. Patiño-Escarcina","doi":"10.1109/HIS.2011.6122168","DOIUrl":"https://doi.org/10.1109/HIS.2011.6122168","url":null,"abstract":"Clustering is an unsupervised classification method that divides a data set in groups, where the elements of a group have similar characteristics to each other. A well-known clustering method is the Growing Hierarchical Self-Organizing Map (GH-SOM), that improves the results of an ordinary SOM by controlling the number of neurons generated. In this paper it is proposed a optimization of the typical GH-SOM, using a cluster validation index to verify the quality of partitioning.","PeriodicalId":418397,"journal":{"name":"2011 11th International Conference on Hybrid Intelligent Systems (HIS)","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126998700","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}
G. Mendez, M. MaríadelosAngelesHernandez, D. S. González, I. López-Juárez
{"title":"Interval singleton type-2 TSK fuzzy logic systems using orthogonal least-squares and backpropagation methods as hybrid learning mechanism","authors":"G. Mendez, M. MaríadelosAngelesHernandez, D. S. González, I. López-Juárez","doi":"10.1109/HIS.2011.6122142","DOIUrl":"https://doi.org/10.1109/HIS.2011.6122142","url":null,"abstract":"A novel learning methodology based on a hybrid mechanism for training interval singleton type-2 Takagi-Sugeno-Kang fuzzy logic systems uses recursive orthogonal least-squares to tune the type-1 consequent parameters and the steepest descent method to tune the interval type-2 antecedent parameters. The proposed hybrid-learning algorithm changes the interval type-2 model parameters adaptively to minimize some criterion function as new information becomes available and to match desired input-output data pairs. Its antecedent sets are type-2 fuzzy sets, its consequent sets are type-1 fuzzy sets, and its inputs are singleton fuzzy numbers without uncertain standard deviations. As reported in the literature, the performance indices of hybrid models have proved to be better than those of the individual training mechanisms used alone. Experiments were carried out involving the application of the hybrid interval type-2 Takagi-Sugeno-Kang fuzzy logic systems for modeling and prediction of the scale-breaker entry temperature in a hot strip mill for three different types of coils. The results demonstrate how the interval type-2 fuzzy system learns from selected input-output data pairs and improves its performance as hybrid training progresses.","PeriodicalId":418397,"journal":{"name":"2011 11th International Conference on Hybrid Intelligent Systems (HIS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130800834","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":"Genetic and ranking-based selection of components for multilabel classifier ensembles","authors":"N. C. Costa, André L. V. Coelho","doi":"10.1109/HIS.2011.6122124","DOIUrl":"https://doi.org/10.1109/HIS.2011.6122124","url":null,"abstract":"This paper deals with the problem of selecting (aka pruning) components for multilabel classifier ensembles. Three methods, one based on a genetic algorithm (GA) and the others based on ranking, are applied for this purpose. In particular, we investigate the adoption of different multilabel classification measures to play the role of the objective function of these methods, paying special attention to how the choice of one measure affects the accuracy of the pruned ensembles as gauged by other measures. A preliminary empirical analysis is conducted on five problems and the results achieved indicate that the classification performance of pruned ensembles as estimated by a given multilabel measure may significantly vary according to the measure adopted for selecting the components. Moreover, although the pruning methods used can yield significant gains in terms of ensemble size reduction, the ensemble models they generate usually lag behind when contrasted to those equipped with the whole sets of components.","PeriodicalId":418397,"journal":{"name":"2011 11th International Conference on Hybrid Intelligent Systems (HIS)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114699480","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":"Adaptive Gaussian membership function fuzzy logic vector control of permanent magnet synchronous motor with a robust Extended Kalman Filter","authors":"V. Bindu, A. Unnikrishnan, R. Gopikakumari","doi":"10.1109/HIS.2011.6122151","DOIUrl":"https://doi.org/10.1109/HIS.2011.6122151","url":null,"abstract":"This paper proposes an adaptive fuzzy logic control (FLC) for the speed control of the permanent magnet synchronous motors (PMSM). The mean and the variance of the Gaussian membership function are updated in real time, until convergence of the error is achieved. The weights used for combining the fuzzy rules are also updated, using the least mean square algorithm. The paper also demonstrates a robust Kalman filter for the estimation of motor quantities. The estimation is ensured to be robust even in the presence of arbitrary fluctuation of the input line currents. The modified robust Extended Kalman Filter (EKF) rejects the outliers in real-time, thereby eliminating the need for manual intervention in tuning the parameters of the EKF. The stability of the controller is checked by computing the Lyapunov exponent from the evolution of direct axis current, quadrature axis current, synchronous speed and found to be stable at all the time. The simulation results show that the proposed control strategy operates robustly under modeling uncertainty, with a good dynamic performance.","PeriodicalId":418397,"journal":{"name":"2011 11th International Conference on Hybrid Intelligent Systems (HIS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122588724","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 new recommendation algorithm using distributed learning automata and graph partitioning","authors":"S. M. Mehr, M. Taran, Ali B. Hashemi, M. Meybodi","doi":"10.1109/HIS.2011.6122131","DOIUrl":"https://doi.org/10.1109/HIS.2011.6122131","url":null,"abstract":"Recommendation systems aim at directing users toward the resources that best meet their needs and interests. In this paper, we propose a new recommendation algorithm based on a hybrid method of distributed learning automata and graph partitioning. The proposed method utilizes usage data and hyperlink graph of the web site. The idea of the proposed method is that an appropriate recommendation for a user can be pages similar to the pages the user has already visited. To calculate similarities between pages, it is assumed that if different users request a couple of pages together, these pages are likely to correspond to the same information need therefore can be considered similar. Experiments on synthetic and real data show that the proposed algorithm provides better recommendations than the only learning automata based recommendation method reported in the literature.","PeriodicalId":418397,"journal":{"name":"2011 11th International Conference on Hybrid Intelligent Systems (HIS)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115129953","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":"Improving ant swarm optimization with embedded vaccination for optimum reducts generation","authors":"Lustiana Pratiwi, Y. Choo, A. Muda, N. A. Muda","doi":"10.1109/HIS.2011.6122147","DOIUrl":"https://doi.org/10.1109/HIS.2011.6122147","url":null,"abstract":"Ant Swarm Optimization refers to the hybridization of Particle Swarm Optimization (PSO) and Ant Colony Optimization (ACO) algorithms to enhance optimization performance. It is used in rough reducts calculation for identifying optimally significant attributes set. This paper proposes a hybrid ant swarm optimization algorithm by using immunity to discover better fitness value in optimizing rough reducts set. Unlike a conventional PSO/ACO algorithm, this hybrid algorithm shows improvement of the classification accuracy in its generated rough reducts to solve NP-Hard problem. This paper has evaluated the immune algorithm in 12 common benchmark dataset to evaluate the performance of rough reducts-based on attribute reduction. The results show that immune ant swarm algorithm is very competitive in terms of fitness value, number of iterations, and classification accuracy to produce a better optimization technique and more accurate results in rough reducts generation. The results also show that immune ant swarm optimization provides a slight increase in accuracy when compared to the differential evolution variant.","PeriodicalId":418397,"journal":{"name":"2011 11th International Conference on Hybrid Intelligent Systems (HIS)","volume":"361 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114768590","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":"Rough set analysis and cloud model algorithm to automated knowledge acquisition for classification Iris to chieve high security","authors":"Eman Mohamed, Fadl Ahmed, S. Rehan, A. Mohamed","doi":"10.1109/HIS.2011.6122080","DOIUrl":"https://doi.org/10.1109/HIS.2011.6122080","url":null,"abstract":"Most of Intrusion Detection Systems uses all data features to detect an intrusion. Very little work addresses the importance of having a small feature subset in designing an efficient intrusion detection system. Some features are redundant and some contribute little to the intrusion detection process. Purpose of this study is to investigate the effectiveness of Rough Set Theory in identifying the important features in building an Intrusion detection system. Rough Set is also used to classify Iris data. Here, we used CASIA V1.0 (CASIA-IrisV1) data, presents In this paper, a new algorithm, Decision Tree Construction based on Rough Set Theory under Characteristic Relation (DTCRSCR), is proposed for mining classification knowledge from incomplete information systems. The algorithm is then used in iris classification. Its idea is to select the attribute whose weighted mean roughness under the characteristic relation as current splitting node. Our framework RST-DTCRSCR method result has a higher accuracy as compared to either full feature or entropy.","PeriodicalId":418397,"journal":{"name":"2011 11th International Conference on Hybrid Intelligent Systems (HIS)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117343204","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 innovative hybrid approach to construct fuzzy-neural network for 3D face recognition system","authors":"N. Thakare, V. Thakare","doi":"10.1109/HIS.2011.6122149","DOIUrl":"https://doi.org/10.1109/HIS.2011.6122149","url":null,"abstract":"The 2D face recognition systems encounter difficulties in recognizing faces with illumination variations. The depth map of the 3D face data has the potential to handle the variation in illumination of face images. For feature matching an efficient fuzzy-neural technique is proposed. This paper presents a new approach in which the depth maps of the 3D face images, containing the depth information of the face image are used. Since the input images contain the depth information the input to the fuzzy neural network is illumination invariant. Using the normalized depth map and fuzzy-neural network, a fully automatic 3D face recognition system is developed. The system is evaluated on the 3D face databases; the CASIA database. The proposed system efficiently handles the varying lighting effects and provides significant recognition accuracy.","PeriodicalId":418397,"journal":{"name":"2011 11th International Conference on Hybrid Intelligent Systems (HIS)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116755606","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}