{"title":"A new branch and bound algorithm for noncovex quadratic programming with box constraints","authors":"Wenlong Fu, T. Du","doi":"10.1109/FSKD.2013.6816260","DOIUrl":"https://doi.org/10.1109/FSKD.2013.6816260","url":null,"abstract":"In this paper, we investigate a class of nonconvex quadratic programming with box constrains. A new branch and bound algorithm is proposed. The improvement of the new method is how to determine the lower bound. We put nonconvex quadratic programming into convex quadratic programming, and get an optimal solution as lower bound of original problem. Meanwhile, an upper bound is got by existing methods. Moreover, by used of the branch and bound algorithm, we can solve the original problem by solved a series of subproblems. Finally, the convergence of the proposed new algorithm is proved.","PeriodicalId":368964,"journal":{"name":"2013 10th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126355557","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 knowledge discovery system for detecting and visualizing knowledge evolution of a research field","authors":"Wei Sun, Xuefu Zhang, Huai Wang","doi":"10.1109/FSKD.2013.6816278","DOIUrl":"https://doi.org/10.1109/FSKD.2013.6816278","url":null,"abstract":"The paper proposes a knowledge discovery system for detecting and visualizing knowledge evolution patterns of a research field. It is mainly focused on co-word technology and core-based algorithm of tracking knowledge evolution. Firstly, the paper defines six kinds of knowledge evolution patterns systematically. Moreover, the paper illustrates the complex architecture of the system which contains four levels, i.e., basic data layer, pre-process layer, visualization layer and analysis layer. The paper elaborates key technologies involved in the system construction, knowledge structure building, knowledge evolution pattern detection and visualization. Then, as an example, the knowledge evolution patterns of hybrid rice field across 17 years are analyzed using 22 core journals of related fields, which verify the feasibility of the system preliminarily.","PeriodicalId":368964,"journal":{"name":"2013 10th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121608636","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 hybrid approach to fuzzy risk analysis in stock market","authors":"Shigang Liu, M. Gan, H. Dai","doi":"10.1109/FSKD.2013.6816210","DOIUrl":"https://doi.org/10.1109/FSKD.2013.6816210","url":null,"abstract":"The analysis and prediction of stock market has always been well recognized as a difficult problem due to the level of uncertainty and the factors that affect the price. To tackle this challenge problem, this paper proposed a hybrid approach which mines the useful information utilizing grey system and fuzzy risk analysis in stock prices prediction. In this approach, we firstly provide a model which contains the fuzzy function, k-mean algorithm and grey system (shorted for FKG), then provide the model of fuzzy risk analysis (FRA). A practical example to describe the development of FKG and FRA in stock market is given, and the analytical results provide an evaluation of the method which shows promote results.","PeriodicalId":368964,"journal":{"name":"2013 10th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123015440","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":"Nonnegative Matrix Factorization using Class Label Information","authors":"Isiuwa Kokoye, Lawrence Oke, Padonou Izogie","doi":"10.1109/FSKD.2013.6816258","DOIUrl":"https://doi.org/10.1109/FSKD.2013.6816258","url":null,"abstract":"Nonnegative matrix factorization (NMF) has been a powerful tool for finding out parts-based, linear representations of nonnegative data samples. Nevertheless, NMF is an unsupervised algorithm, and it is not able to utilize the class label information. In this paper, the Nonnegative Matrix Factorization using Class Label Information (NMF-CLI) is proposed. It combines the class label information for factorization constraints. The proposed NMF-CLI method is investigated with one cost function and the corresponding update rules are given. Experiment results show the power of the proposed novel algorithm, by comparing to the state-of-the-art methods.","PeriodicalId":368964,"journal":{"name":"2013 10th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123108453","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":"Relationship between similarity measure and entropy of interval type-2 fuzzy sets","authors":"Xiang Zhang, Gao Zheng","doi":"10.1109/FSKD.2013.6816174","DOIUrl":"https://doi.org/10.1109/FSKD.2013.6816174","url":null,"abstract":"The similarity measure and entropy of fuzzy sets are two important fuzzy measures in fuzzy logic theory and it is significant to research their relationship. In this paper, we mainly discuss the relationship between the similarity measure and entropy of interval type-2 fuzzy sets (IT2 FSs) proposed by Zheng et al., and give two Theorems and a Corollary that can reflect the mutual conversion relationship between two indexes. These conclusions have extensive practicability in many fields.","PeriodicalId":368964,"journal":{"name":"2013 10th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)","volume":"145 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126014121","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":"Towards recommendation to trust-based user groups in social tagging systems","authors":"Hao Wu, Yu Hua, Bo Li, Yijian Pei","doi":"10.1109/FSKD.2013.6816321","DOIUrl":"https://doi.org/10.1109/FSKD.2013.6816321","url":null,"abstract":"Group recommender systems use various strategies to aggregate users' preferences into a common social welfare function which would maximize the satisfaction of all members. Group recommendation is essentially useful for websites, especially for social tagging systems. In this paper, we initially experiment with various rank aggregation strategies for group recommendation in social tagging systems. Specially, we consider trust-based user groups detected by community discovery based on trustable social relations. Also, we present hybrid similarity to estimate the relevance between users and resources. According to experiments on Delicious and Lastfm datasets, CombMAX, CombSUM and CombANZ are more suitable for aggregating individual preference into a group preference in social tagging systems. And group recommendation can achieve better effect than individual recommendation based on our proposed model.","PeriodicalId":368964,"journal":{"name":"2013 10th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116545143","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 real-time algorithm for fixed-length short data compression","authors":"Qin Li, Jin Yang, Caiming Liu","doi":"10.1109/FSKD.2013.6816350","DOIUrl":"https://doi.org/10.1109/FSKD.2013.6816350","url":null,"abstract":"Based on the specialties of the transmission of fixed-length short data in certain special industries, the lossless compression algorithm for the fixed-length short data packets is presented. The iteration procedure is used to explore the rules rightward and downward from the source data packet and the compression dictionary is obtained. It overcomes the shortcoming of the traditional compression algorithm which only compresses the data by file, but cannot compress the short data effectively by packets. Only the compressed packet but not the compression dictionary is transferred in the network. The experimental results show that the proposed algorithm also overcomes the shortcoming that the Lempel-Ziv-Welch (LZW) algorithm cannot compress the data by pockets. This lossless compression algorithm can effectively compress the fixed-length short data which has similar structure and massive repetition. It realizes compressing and transfering the packets effectively and securely.","PeriodicalId":368964,"journal":{"name":"2013 10th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114264117","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":"New fuzzy metric spaces based on gradual numbers","authors":"Cai-Li Zhou, Yin-Ying Zhou, Junyan Bao","doi":"10.1109/FSKD.2013.6816171","DOIUrl":"https://doi.org/10.1109/FSKD.2013.6816171","url":null,"abstract":"In this paper, we deal with special generalization of metric spaces by considering the distances between objects as gradual numbers. Firstly, the concept of gradual metric spaces is introduced. The new concept is a generalization of classical metric spaces and gradual linear normed spaces in the sense of Sadeqi and Azart. And then, basic concepts with respect to topology in gradual metric spaces are presented and their properties are discussed.","PeriodicalId":368964,"journal":{"name":"2013 10th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125246452","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":"On consensus of high-order multi-agent systems with directed interactions and asymmetric communication delays","authors":"Fangcui Jiang","doi":"10.1109/FSKD.2013.6816271","DOIUrl":"https://doi.org/10.1109/FSKD.2013.6816271","url":null,"abstract":"This paper focuses on the consensus problem for high-order multi-agent systems (MAS) with directed interactions and asymmetric time-varying communication delays. By introducing an orthogonal linear transformation, we prove that the consensus of such MAS is achieved if and only if each solution of an equivalent reduced-order system converges to zero. Based on this nature and Lyapunov-Krasovskii functional approach, we then establish several sufficient convergence conditions which are characterized by linear matrix inequalities. Furthermore, we give a Lyapunov-like design for the explicit selection of protocol parameters, which is robust to asymmetric time-varying delays and fixed or switching directed topologies. Also, we show that the solutions of these linear matrix inequalities always exist under the assumptions on network topology and protocol parameters. As application, we construct a state-feedback controller for the consensus of MAS with agent modeled by a completely controllable single-input linear time-invariant system.","PeriodicalId":368964,"journal":{"name":"2013 10th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127689578","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}
Li-Chang Liu, Jiann-Der Lee, Yu-Wei Hsu, Carol T. Liu, E. Tseng, M. Tsai
{"title":"A region segmentation method on 2-D vessel optical coherence tomography images","authors":"Li-Chang Liu, Jiann-Der Lee, Yu-Wei Hsu, Carol T. Liu, E. Tseng, M. Tsai","doi":"10.1109/FSKD.2013.6816218","DOIUrl":"https://doi.org/10.1109/FSKD.2013.6816218","url":null,"abstract":"This paper describes a novel region segmentation method designed to avoid complications of the threshold process used in traditional segmentation methods in 2-D optical coherence tomography (OCT) images. Analysis of the layers and regions in OCT images is used to diagnose the presence of cancer and identify the stage of the cancer if present. However, scattering during OCT images generates a speckle effect and creates diffusion problems which are also captured; these problems cause traditional image processing methods such as the Canny edge and Otsu methods to fail in finding the proper layer and region edges. The proposed method uses the mean value and an enhanced-fuzzy-c-mean algorithm to cluster pixels in 2-D OCT images and find the edge between different clustered regions. Low-resolution vessel OCT and high-resolution oral cancer OCT images are tested in the experiment, and the experimental results show that the proposed method performs with more robust and accurate segmentation results than does the overcomplete-wavelet-frame-based fractal signature method.","PeriodicalId":368964,"journal":{"name":"2013 10th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)","volume":"80 24","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131770060","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}