2014 11th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)最新文献

筛选
英文 中文
Q-increment deterministic annealing fuzzy c-means clsutering using Tsallis entropy 基于Tsallis熵的q增量确定性退火模糊c均值聚类
2014 11th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD) Pub Date : 2014-12-11 DOI: 10.1109/FSKD.2014.6980802
M. Yasuda
{"title":"Q-increment deterministic annealing fuzzy c-means clsutering using Tsallis entropy","authors":"M. Yasuda","doi":"10.1109/FSKD.2014.6980802","DOIUrl":"https://doi.org/10.1109/FSKD.2014.6980802","url":null,"abstract":"Tsallis entropy is a q-parameter extension of Shannon entropy. By extremizing Tsallis entropy within the framework of fuzzy c-means (FCM) clustering, a membership function similar to the statistical mechanical distribution function is obtained. The extent of the membership function is determined by a system temperature and a q-value. By combining with the deterministic annealing (DA) method, DA FCM using Tsallis entropy has been proposed. One of the important problems of this method is how to determine an appropriate q value according to a data distribution. In this article, a combinatorial method of q-increment and deterministic annealing of Tsallis entropy based FCM is proposed and investigated. In this method, in order to determine an appropriate q value automatically, q is increased while lowering the temperature. Experiments are performed on the Iris dataset, and it is confirmed that the proposed method determines an appropriate q value in many cases and a number of iterations of computation can be reduced.","PeriodicalId":397095,"journal":{"name":"2014 11th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)","volume":" 23","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113948810","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}
引用次数: 1
Adaptively incremental dictionary compression method for column-oriented database 面向列数据库的自适应增量字典压缩方法
2014 11th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD) Pub Date : 2014-12-11 DOI: 10.1109/FSKD.2014.6980907
Hui Liu, Zhijing Liu, Tong Yuan, Yong Yao
{"title":"Adaptively incremental dictionary compression method for column-oriented database","authors":"Hui Liu, Zhijing Liu, Tong Yuan, Yong Yao","doi":"10.1109/FSKD.2014.6980907","DOIUrl":"https://doi.org/10.1109/FSKD.2014.6980907","url":null,"abstract":"As an efficient method, the dictionary compression approach has attracted much interest and been widely used in column-oriented database systems. The core idea is to represent a longer string by a shorter integer, which significantly reduces the size of data and then improves the input-output (I/O) performance. To further reduce the space overhead of the dictionary compression method based on static increment, a novel adaptively incremental dictionary compression encoding method is developed in this paper. The developed method makes full use of the statistical characteristics of the data to reduce the footprint of the dictionary in the memory, which is also shown more flexible in reality. Furthermore, a better performance of query execution can be obtained by the adoption of such compression method in the query plan. The simulation results under different experiments show the effectiveness and efficiency of our proposed method.","PeriodicalId":397095,"journal":{"name":"2014 11th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)","volume":"211 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":"115845110","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}
引用次数: 2
A MapReduce based parallel algorithm for CIM data verification 基于MapReduce的CIM数据验证并行算法
2014 11th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD) Pub Date : 2014-12-11 DOI: 10.1109/FSKD.2014.6980921
Yang Liu, Xiaodong Shen, Lixiong Xu, Maozhen Li
{"title":"A MapReduce based parallel algorithm for CIM data verification","authors":"Yang Liu, Xiaodong Shen, Lixiong Xu, Maozhen Li","doi":"10.1109/FSKD.2014.6980921","DOIUrl":"https://doi.org/10.1109/FSKD.2014.6980921","url":null,"abstract":"At present, the power system is building up on top of a series of auxiliary systems for examples communication systems, monitoring systems, marketing systems and so on. All the systems work based on the shared power system data which are defined using Common Information Model (CIM). Due to diversiform reasons, errors may exist in the data. Therefore the verification technologies are developed. So far the researchers mainly focus on the accuracy of the verification. However, along with the volume of data increasing, efficiency has become an issue. This paper proposes a CIM verifying algorithm based on MapReduce in terms of efficiency improvement. The experimental results show that it can enhance the performance of verification.","PeriodicalId":397095,"journal":{"name":"2014 11th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)","volume":"14 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":"114712290","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}
引用次数: 1
Online bidding system based on Cournot model using K-means clustering 基于k -均值聚类的古诺模型在线竞价系统
2014 11th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD) Pub Date : 2014-12-11 DOI: 10.1109/FSKD.2014.6980861
Jun Tan, Yan-Jiang Jia
{"title":"Online bidding system based on Cournot model using K-means clustering","authors":"Jun Tan, Yan-Jiang Jia","doi":"10.1109/FSKD.2014.6980861","DOIUrl":"https://doi.org/10.1109/FSKD.2014.6980861","url":null,"abstract":"Online E-commence has been growing rapidly in the world. Online bidding has become popular. This work will come out with a model of online bidding system (OBS). This paper propose a new model to deal with online bidding, we deal with auction with Cournot Bidding Data Mining (CBDM). CBDM framework based on Cournot model is designed for K-means clustering. The input auction space is partitioned into groups of similar auctions by K-means clustering algorithm. The problem of finding the value of k in K-means algorithm is solved by method using Cournot competition. Cournot bidding is employed to obtain the optimal bidding strategies for the current auction. The clustering algorithm has been deployed successfully into online bidding, yielding significant improvement in performance over the existing OBS.","PeriodicalId":397095,"journal":{"name":"2014 11th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)","volume":"74 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":"122809096","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}
引用次数: 3
Evaluating host-based anomaly detection systems: Application of the one-class SVM algorithm to ADFA-LD 评估基于主机的异常检测系统:一类SVM算法在ADFA-LD中的应用
2014 11th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD) Pub Date : 2014-12-11 DOI: 10.1109/FSKD.2014.6980972
Miao Xie, Jiankun Hu, J. Slay
{"title":"Evaluating host-based anomaly detection systems: Application of the one-class SVM algorithm to ADFA-LD","authors":"Miao Xie, Jiankun Hu, J. Slay","doi":"10.1109/FSKD.2014.6980972","DOIUrl":"https://doi.org/10.1109/FSKD.2014.6980972","url":null,"abstract":"ADFA-LD is a recently released data set for evaluating host-based anomaly detection systems, aiming to substitute the existing benchmark data sets which have failed to reflect the characteristics of modern computer systems. In a previous work, we had attempted to evaluate ADFA-LD with a highly efficient frequency model but the performance is inferior. In this paper, we focus on the other typical technical category that detects anomalies with a short sequence model. In collaboration with the one-class SVM algorithm, a novel anomaly detection system is proposed for ADFA-LD. The numerical experiments demonstrate that it can not only achieve a satisfactory performance, but also reduce the computational cost largely.","PeriodicalId":397095,"journal":{"name":"2014 11th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)","volume":"47 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":"129424123","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}
引用次数: 73
A real-time trajectory indexing method based on MongoDB 基于MongoDB的实时轨迹索引方法
2014 11th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD) Pub Date : 2014-12-11 DOI: 10.1109/FSKD.2014.6980893
Yuxin Zhu, Jun Gong
{"title":"A real-time trajectory indexing method based on MongoDB","authors":"Yuxin Zhu, Jun Gong","doi":"10.1109/FSKD.2014.6980893","DOIUrl":"https://doi.org/10.1109/FSKD.2014.6980893","url":null,"abstract":"Aiming at the inefficiency problems of existing trajectory database techniques especially in real-time access to latest trajectories, a real-time trajectory indexing method based on MongoDB and mixed with spatio-temporal R-tree, hash table and B-tree for searching leaf nodes is proposed in this paper. Time in spatio-temporal R-tree is used as another dimension of equal status to space, and a leaf node can only involve a moving object's consecutive trajectory points. In order to solve the problem of frequent updates and lack of memory, hash table is divided into two kinds: one caches leaf nodes of spatio-temporal R-tree, which are not inserted into spatio-temporal R-tree until they are full or out-dated in the hash table. This improves generation efficiency of real-time trajectory index; the other one caches in-memory nodes which are loaded from external memory, it avoids frequent operations related to external memory. We build B-tree based on object identification and time in leaf nodes, which benefits trajectory queries for moving objects. In comparison to SETI, the experimental results show that our method has good update efficiency and query performance, and it meets the demand of common trajectory queries in present applications.","PeriodicalId":397095,"journal":{"name":"2014 11th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)","volume":"62 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":"129430030","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}
引用次数: 4
Data locality in Hadoop cluster systems Hadoop集群系统中的数据局部性
2014 11th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD) Pub Date : 2014-12-11 DOI: 10.1109/FSKD.2014.6980924
Mukhtaj Khan, Yang Liu, Maozhen Li
{"title":"Data locality in Hadoop cluster systems","authors":"Mukhtaj Khan, Yang Liu, Maozhen Li","doi":"10.1109/FSKD.2014.6980924","DOIUrl":"https://doi.org/10.1109/FSKD.2014.6980924","url":null,"abstract":"MapReduce has become a major programming model that supports distributed and parallel processing for large-scale data-intensive applications such as Web data mining, network traffic analysis, machine learning and scientific simulation. Hadoop is the most popular open-source implementation of the MapReduce programming model. In Hadoop, input files are divided into many data blocks and these blocks are distributed over several nodes in cluster. To efficiently process the data blocks, Hadoop should provide an efficient scheduling mechanism for enhancing the performance of the system in a shared cluster environment. In Hadoop scheduling mainly caused by data locality issues due to limited network bandwidth. By introducing the scheduling issues with regarding to the data locality, this paper review different data locality aware scheduling algorithms that handling the data locality issues. In addition, this paper also evaluating their features, strength, weakness and provided some guidelines on how to improve further these scheduling algorithms.","PeriodicalId":397095,"journal":{"name":"2014 11th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)","volume":"38 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":"125494554","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}
引用次数: 11
A statistical learning approach to Chang'E microwave radiometer data calibration 基于统计学习的嫦娥微波辐射计数据定标方法
2014 11th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD) Pub Date : 2014-12-11 DOI: 10.1109/FSKD.2014.6980863
K. Tsang, S. Fu, Jingwen Gu, Min Zhou, K. Chan, Y. C. Zheng
{"title":"A statistical learning approach to Chang'E microwave radiometer data calibration","authors":"K. Tsang, S. Fu, Jingwen Gu, Min Zhou, K. Chan, Y. C. Zheng","doi":"10.1109/FSKD.2014.6980863","DOIUrl":"https://doi.org/10.1109/FSKD.2014.6980863","url":null,"abstract":"We have proposed a statistical learning model which accounts for the effect due to the Chinese Chang'E (CE) cold space calibration antenna may have been contaminated by thermal microwave radiation from the lunar surface because its field of view overlapped with the lunar surface instead of aiming just at the cold space. This effect can corrupt the simple two-point calibration procedure and lead to the discrepancy between the available microwave radiometer Level 2C data from CE1 & 2. An algorithm to implement the statistical learning model is developed. Recalibration of the Level 2C radiometer data from localized locations (around the Apollo 17 lunar mission landing site on the lunar surface) by regression analysis based on our statistical learning calibration model successfully removes the discrepancy between the two sets of microwave brightness temperatures data from CE1 and 2. Residual analysis on the combined dataset shows that that the residuals are normally distributed with a mean value equals to zero. This sophisticate statistical learning algorithm developed here may be considered as a recalibration effort to remove the systematic inconsistency between the two microwave brightness temperature datasets. The combined and enlarged CE radiometer dataset may potentially increase our understanding of the physical reality hidden behind.","PeriodicalId":397095,"journal":{"name":"2014 11th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)","volume":"111 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":"124369108","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}
引用次数: 2
Image compression algorithm based on automatic extracted ROI 基于ROI自动提取的图像压缩算法
2014 11th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD) Pub Date : 2014-12-11 DOI: 10.1109/FSKD.2014.6980937
Peilong Zhao, Jiwen Dong, Lei Wang
{"title":"Image compression algorithm based on automatic extracted ROI","authors":"Peilong Zhao, Jiwen Dong, Lei Wang","doi":"10.1109/FSKD.2014.6980937","DOIUrl":"https://doi.org/10.1109/FSKD.2014.6980937","url":null,"abstract":"An region of interesting compression algorithm of still image is introduced. The algorithm that is based on embedded block coding with optimized truncation (EBCOT) encodes the interested region of the image. According to the character of image edge, an improved canny edge detection algorithm is proposed before the wavelet transform, without the participation of automatic extraction of artificial region-of-interest (ROI) by using the dilation and erosion operation in morphology. The ROI coding algorithms is analyzed. ROI information can be encoded with high priority at the same time by constructing a weighted function, giving reasonable weight for ROI code block, and reducing the wavelet coefficients effect on the context region of the ROI code block. The proposed method improves the quality of the reconstructed image of ROI. Experiments show that the reconstructed ROI image quality is significantly improved under low bit rate or high, and the reconstructed image background region (BG) quality can be also improved.","PeriodicalId":397095,"journal":{"name":"2014 11th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)","volume":"9 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":"126514432","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}
引用次数: 3
Distributed clustering using distributed mixture of probabilistic PCA 使用分布混合概率PCA的分布式聚类
2014 11th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD) Pub Date : 2014-12-11 DOI: 10.1109/FSKD.2014.6980859
Hang Yin, Chunhong Zhang, Yang Ji
{"title":"Distributed clustering using distributed mixture of probabilistic PCA","authors":"Hang Yin, Chunhong Zhang, Yang Ji","doi":"10.1109/FSKD.2014.6980859","DOIUrl":"https://doi.org/10.1109/FSKD.2014.6980859","url":null,"abstract":"This paper considers the clustering algorithm based on mixture of probabilistic principle component analyzers in distributed environments. The EM procedure of it is first transformed to a summing variant. Following the classic distributed EM framework for mixture of exponential family distributions and utilizing the summing variant, we propose the distributed EM for mixture of probabilistic principle component analyzers. The proposed algorithm avoids transferring all data from distributed nodes to a central node. Experiment verifies the validity and feasibility of the proposed method. For some datasets, the proposed method can even enhance the log-likelihood as well as the clustering performance.","PeriodicalId":397095,"journal":{"name":"2014 11th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)","volume":"3 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":"132166053","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}
引用次数: 1
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书