Yan Nan, Hengshan Zhang, Q. Zheng, Di Wang, Ting Liu, B. Feng
{"title":"IFSDA: An intuitionistic fuzzy set-based data aggregation approach for software maintainability evaluation","authors":"Yan Nan, Hengshan Zhang, Q. Zheng, Di Wang, Ting Liu, B. Feng","doi":"10.1109/FSKD.2014.6980839","DOIUrl":"https://doi.org/10.1109/FSKD.2014.6980839","url":null,"abstract":"The software maintainability which is an important part of software quality and trustworthiness has always been a hot topic in software engineering domain. The measurements of the software are multi-source and heterogeneous data, which result in big challenges on data aggregation for software maintainability evaluation. In this paper, an Intuitionistic Fuzzy Set-based Data Aggregation (IFSDA) approach is developed to evaluate the software maintainability. In order to unify the heterogeneous measurements, a Grade Mapping method is proposed to transform them to the membership function and the non-membership function based on Intuitionistic Fuzzy Set (IFS). The Einstein operation-based aggregation algorithm is applied to aggregate the measurements from the lower level to the higher level under the software maintainability index system. In the experiments, 880 versions of Linux kernels are collected and evaluated to test the IFSDA approach and the maintainability evolution of the Linux kernels can be studied from the experiment results and analysis.","PeriodicalId":397095,"journal":{"name":"2014 11th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)","volume":"41 8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121582385","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":"Delay synchronization controller for Chua's chaotic circuits","authors":"Liping Zhang, Shulin Wu, Kelin Li","doi":"10.1109/FSKD.2014.6980952","DOIUrl":"https://doi.org/10.1109/FSKD.2014.6980952","url":null,"abstract":"In this paper, we present a time delay synchronization controller for the Chua's chaotic circuits. The proposed synchronization strategy is very simple because it only impose piecewise linear feedback control on the first solution component. The global asymptotical synchronization criterion is established based on the stability theory of linear systems. Numerical simulations are given to support the theoretical results.","PeriodicalId":397095,"journal":{"name":"2014 11th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125158244","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":"Several classes of polynomial-time solvable fuzzy relational inequalities","authors":"Fangfang Guo, Yong-gong Ren","doi":"10.1109/FSKD.2014.6980803","DOIUrl":"https://doi.org/10.1109/FSKD.2014.6980803","url":null,"abstract":"Finding the list of all minimal solutions of a fuzzy relational system is a tough work. Actually it has been proved to be NP hard recently by Markovskii. (A.V. Markovskii, On the relation between equations with max-product composition and the covering problem. Fuzzy Sets Systems 153, pp. 261-273, 2005). However, practical programs for solving these problems usually run much faster than they are supposed to be in theoretical result. This motivates us to ask: are there any polynomial-time solvable fuzzy relation systems and what kind of systems they should be? This paper devotes to answering this question by analyzing the computational complexity of a proposed algorithm for solving fuzzy relation systems. It is proved that a fuzzy relation system has polynomial time algorithm whenever it has poly(m, n) many quasi-minimal solutions, where m × n is its dimension. Based on the conclusion, some conditions are proposed, under which fuzzy relation systems can be solved in polynomial time. Presented examples show the practicality of these conditions.","PeriodicalId":397095,"journal":{"name":"2014 11th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133954893","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}
Zhengling Liao, Jie Luo, Meihang Li, Yun Xue, TieChen Li, Xiaohui Hu
{"title":"A new approach for mining deep order-preserving submatrices","authors":"Zhengling Liao, Jie Luo, Meihang Li, Yun Xue, TieChen Li, Xiaohui Hu","doi":"10.1109/FSKD.2014.6980857","DOIUrl":"https://doi.org/10.1109/FSKD.2014.6980857","url":null,"abstract":"In this paper, we proposed an exact method to discover all order-preserving submatrices (OPSMs) based on frequent sequential pattern mining. Firstly, an existing algorithm calACS is adjusted to disclose all common subsequences between every two row sequences, therefore all the deep OPSMs corresponding to long patterns with few supporting sequences will not be missed. Then an improved data structure for prefix tree was used to store and traverse all common subsequences, and Apriori principle was employed to mine the frequent sequential pattern efficiently. Finally, experiments were implemented on real data set and GO analysis was applied to identify whether the patterns discovered were biologically significant. The results demonstrate the effectiveness and the efficiency of this method.","PeriodicalId":397095,"journal":{"name":"2014 11th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131897241","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":"Parameter estimation of K model of radar cross section for synthetic aperture radar images based on second-kind statistics","authors":"Zengguo Sun, Zhihua Zhang","doi":"10.1109/FSKD.2014.6980941","DOIUrl":"https://doi.org/10.1109/FSKD.2014.6980941","url":null,"abstract":"The K distribution is used to model the radar cross section (RCS) of synthetic aperture radar (SAR) images, and its parameters are estimated from the observed images using second-kind statistics. The types of intensity and amplitude images are considered in this paper. For each kind of image, the first two log-cumulants of speckle and RCS are derived respectively, and thus the estimators are derived with explicit expressions based on the second-kind statistics. Parameter estimation experiments demonstrate the effectiveness of the proposed estimators.","PeriodicalId":397095,"journal":{"name":"2014 11th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133886315","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":"Research on distributed computing of EAI platform system","authors":"Jun Tao","doi":"10.1109/FSKD.2014.6980954","DOIUrl":"https://doi.org/10.1109/FSKD.2014.6980954","url":null,"abstract":"Distributed computing, a paradigm often used for building business applications, enables a task to be performed by combining the efforts of multiple processes. The processes can be running at different locations, and on different types of computers. This paper gives an overview on the distributed computing problem in an integrated application environment. Based on this problem description, it gives out the EAI Platform Distributed Computing Solution. To this end, it designs a platform system for enterprise applications integration. EAI Platform provides an infrastructure for communication and control among diverse, distributed applications. The EAI Platform framework supports applications that use distributed, client-server communications, in both Java and C++.","PeriodicalId":397095,"journal":{"name":"2014 11th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)","volume":"239 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132839985","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 decision support system based on fuzzy specialized rules for the Alzheimer disease","authors":"Firas Zekri, Hanen Ghorbel, R. Bouaziz","doi":"10.1109/FSKD.2014.6980883","DOIUrl":"https://doi.org/10.1109/FSKD.2014.6980883","url":null,"abstract":"Since Alzheimer's Disease (AD) has a huge socio-economic impact, attempts to reduce this impact are being searched. However, studies on AD have shown that the fight against this disease requires a great effort of several actors who should contribute to the success of the patient care process. As computer scientists, we aim to contribute to this fight by assisting the decision-makers in the AD domain to choose the optimal decision in each given situation. Our objective is to capitalize knowledge so that we can provide more powerful and more efficient systems. We then propose an approach to build AD Clinical Decision Support Expert Systems (CDSES) based on the fuzzy specialization of the knowledge of this disease.","PeriodicalId":397095,"journal":{"name":"2014 11th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117267043","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":"ARAS: Efficient generation of Association Rules Using Antecedent Support","authors":"S. B. Bajaj","doi":"10.1109/FSKD.2014.6980848","DOIUrl":"https://doi.org/10.1109/FSKD.2014.6980848","url":null,"abstract":"In Association rule mining, much attention has been paid for developing algorithms for large (frequent/closed/maximal) itemsets but very little attention has been paid to improve the performance of rule generation algorithms. Rule generation is an important part of Association rule mining. In this paper, a novel approach named ARAS (Association Rule Using Antecedent Support) has been proposed for rule generation that uses memory resident data structure named FCET (Frequent Closed Enumeration Tree) to find frequent/closed itemsets. In addition, the computational speed of ARAS is enhanced by giving importance to the rules that have lower antecedent support. Comparative performance evaluation of ARAS with fast association rule mining algorithm for rule generation has been done on synthetic datasets (generated by IBM Synthetic Data Generator) and real life datasets (taken from UCI Machine Learning Repository). Performance analysis shows that ARAS is computationally faster as compared to the existing algorithms for rule generation.","PeriodicalId":397095,"journal":{"name":"2014 11th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115143937","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 common-subsequence-based approach for mining deep order preserving submatrix","authors":"Yun Xue, TieChen Li, Zhiwen Liu, Zhengling Liao, Hua Xiao, Hongya Zhao, Xiaohui Hu","doi":"10.1109/FSKD.2014.6980856","DOIUrl":"https://doi.org/10.1109/FSKD.2014.6980856","url":null,"abstract":"As an effective biclustering model, order-preserving submatrix (OPSM) has been widely applied to biological gene expression data mining. Recently, biologists hope to find deep OPSMs with long patterns and comparatively few support rows, which are not only useful on the interpretation of gene regulatory networks but also have essential biological significance. Unfortunately, the traditional exact mining algorithms based on Apriori principle could not deal with the deep OPSM problem, since they often take a large minimum support threshold for pattern pruning, and inevitably miss some significant deep OPSMs. Therefore, this paper proposes a new exact algorithm for mining deep OPSMs, which obtain all the deep OPSMs by finding the common subsequences shared by every two rows. Experiments have been done in both real and synthetic data sets, and the results show that our algorithm is suitable for the full mining of deep OPSMs with a small support, which could even find all the deep OPSMs with a minimum support threshold of 2. Compared with the traditional sequential pattern mining algorithms which depend on relatively large support threshold, our algorithm is an effective one to solve the deep OPSM problem.","PeriodicalId":397095,"journal":{"name":"2014 11th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124355184","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":"Predict user interest with respect to global interest popularity","authors":"Wenhao Zhu, Kan Niu, Guannan Hu, Jiaoxiong Xia","doi":"10.1109/FSKD.2014.6980958","DOIUrl":"https://doi.org/10.1109/FSKD.2014.6980958","url":null,"abstract":"With the development of personalized recommendation, the method of user interest prediction has been a hot research topic. Usually, predict methods use individual related parameters such as user ratings to infer possible user interests. A potential problem with these methods is that the credibility of the user ratings is rarely questioned or considered during the process of prediction. However, as a common knowledge of social science, people can be affected by group actions. For example, individual ratings can be affected by public opinion. In this paper, we propose an approach to predict user interest with respect to popularity facts. It operates in two aspects. First, interest item popularity gives a weight for each rating value to promote popular items. On the other hand, the prediction calculation is adjusted on the basis of individual item popularity and global item popularity. The experiment results show that this method can improve the accuracy of interest prediction.","PeriodicalId":397095,"journal":{"name":"2014 11th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123954314","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}