2016 3rd International Conference on Soft Computing & Machine Intelligence (ISCMI)最新文献

筛选
英文 中文
Anomaly Detection Guidelines for Data Streams in Big Data 大数据中数据流异常检测指南
Annie Ibrahim Rana, G. Estrada, Marc Solé, Victor Muntés
{"title":"Anomaly Detection Guidelines for Data Streams in Big Data","authors":"Annie Ibrahim Rana, G. Estrada, Marc Solé, Victor Muntés","doi":"10.1109/ISCMI.2016.24","DOIUrl":"https://doi.org/10.1109/ISCMI.2016.24","url":null,"abstract":"Real time data analysis in data streams is a highly challenging area in big data. The surge in big data techniques has recently attracted considerable interest to the detection of significant changes or anomalies in data streams. There is a variety of literature across a number of fields relevant to anomaly detection. The growing number of techniques, from seemingly disconnected areas, prevents a comprehensive review. Many interesting techniques may therefore remain largely unknown to the anomaly detection community at large. The survey presents a compact, but comprehensive overview of diverse strategies for anomaly detection in evolving data streams. A number of recommendations based performance and applicability to use cases are provided. We expect that our classification and recommendations will provide useful guidelines to practitioners in this rapidly evolving field.","PeriodicalId":417057,"journal":{"name":"2016 3rd International Conference on Soft Computing & Machine Intelligence (ISCMI)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124527676","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}
引用次数: 8
Heterogeneous Ensembles for Software Development Effort Estimation 软件开发工作量评估的异构集成
Mohamed Hosni, A. Idri, A. B. Nassif, A. Abran
{"title":"Heterogeneous Ensembles for Software Development Effort Estimation","authors":"Mohamed Hosni, A. Idri, A. B. Nassif, A. Abran","doi":"10.1109/ISCMI.2016.15","DOIUrl":"https://doi.org/10.1109/ISCMI.2016.15","url":null,"abstract":"Software effort estimation influences almost all the process of software development such as: bidding, planning, and budgeting. Hence, delivering an accurate estimation in early stages of the software life cycle may be the key of success of any project. To this aim, many solo techniques have been proposed to predict the effort required to develop a software system. Nevertheless, none of them proved to be suitable in all circumstances. Recently, Ensemble Effort Estimation has been investigated to estimate software effort and consists on generating the software effort by combining more than one solo estimation technique by means of a combination rule. In this study, a heterogeneous EEE based on four machine learning techniques was investigated using three linear rules and two well-known datasets. The results of this study suggest that the proposed heterogeneous EEE yields a very promising performance and there is no best combiner rule that can be recommended.","PeriodicalId":417057,"journal":{"name":"2016 3rd International Conference on Soft Computing & Machine Intelligence (ISCMI)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131622554","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}
引用次数: 20
Privacy Preserving in Distributed SVM Data Mining on Vertical Partitioned Data 垂直分区数据分布式支持向量机数据挖掘中的隐私保护
Mohammed Z. Omer, Hui Gao, Faisal Sayed
{"title":"Privacy Preserving in Distributed SVM Data Mining on Vertical Partitioned Data","authors":"Mohammed Z. Omer, Hui Gao, Faisal Sayed","doi":"10.1109/ISCMI.2016.40","DOIUrl":"https://doi.org/10.1109/ISCMI.2016.40","url":null,"abstract":"Data mining algorithms tacitly quite access to the data either at centralized or distributed form. Distributed data becomes a big challenge and cannot handle by a classical analytic tool. Cloud Computing can solve the issues of processing, storing, and analyzing the data at distributing locations within the cloud. However, a significant problem that is preventing free sharing of data is privacy and security issues, therefore obstructing data mining schemes. Lately, there is increasingly hard to find a solution to these problems. Due to the existing knowledge in a more distributed data and better for data mining issues. An important task of data mining and machine learning is classification, a widely used in classification is support vector machine (SVM) algorithms applicable in many various domains. In this paper, we proposes a privacy-preserving solution for SVM classification. Our workaround constructing a global SVM classification model from vertically partitioned distributed data at multi-parties based on Gram matrix, without revealing a party's data. We proposed an efficient and preserve privacy protocol for SVM classification on vertical partitioned data. Our experimental results, the accuracy of distributed SVM using Gram matrix up to 90% and the privacy not compromised.","PeriodicalId":417057,"journal":{"name":"2016 3rd International Conference on Soft Computing & Machine Intelligence (ISCMI)","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116589286","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}
引用次数: 6
A Question Answer System for the Mauritian Judiciary 毛里求斯司法系统的问答系统
S. Pudaruth, R. Gunputh, K. Soyjaudah, P. Domun
{"title":"A Question Answer System for the Mauritian Judiciary","authors":"S. Pudaruth, R. Gunputh, K. Soyjaudah, P. Domun","doi":"10.1109/ISCMI.2016.47","DOIUrl":"https://doi.org/10.1109/ISCMI.2016.47","url":null,"abstract":"Law is a research-oriented profession and legal research is an activity that costs time and money. Information Technology is now revolutionising the way in which legal research is being done. In this work, we have implemented an online web-based question answer system for the Mauritian Judiciary where users can enter their queries freely using natural language. The system processes the queries by extracting relevant keywords and discards those that do not carry much information and then returns the relevant sections of law which contain these keywords or keyphrases. The system also returns a list of relevant Supreme Court cases. The user can decide on the number of results to be displayed. The user can also wish to have only the name of the relevant acts be displayed for certain keywords or keyphrases. The system does not require the user to know how the law is structured or how the knowledge-base is built in order to benefit from it. The portal can also be accessed via mobile devices without compromising any of its facilities or user-friendliness. It is hoped that the availability of information at the click of a button will help the human resources at the Mauritian Judiciary to become more efficient and this will contribute to the reduction of delays in the disposal of cases.","PeriodicalId":417057,"journal":{"name":"2016 3rd International Conference on Soft Computing & Machine Intelligence (ISCMI)","volume":"414 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123909698","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
A Two Phases Heuristic Based Method for the MinMax Regret Location Problem 最小最大遗憾定位问题的两阶段启发式方法
S. Ibri
{"title":"A Two Phases Heuristic Based Method for the MinMax Regret Location Problem","authors":"S. Ibri","doi":"10.1109/ISCMI.2016.32","DOIUrl":"https://doi.org/10.1109/ISCMI.2016.32","url":null,"abstract":"We are interested in solving the problem of locating a subset of facilities in the case of uncertainties and variations in the system parameters. Dealing with this problem using scenarios based approach needs an important computational effort. The two phases proposed method in this paper combines both exact and heuristic approaches to minimize the maximum regret of the model. We proposed and compared three different heuristics to solve it and applied it to the case of locating emergency vehicles stations. The obtained results show that site selection based on the minimum average travel time is the most promising one.","PeriodicalId":417057,"journal":{"name":"2016 3rd International Conference on Soft Computing & Machine Intelligence (ISCMI)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122976885","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
Personification of Bag-of-Features Dataset for Real Time Activity Recognition 面向实时活动识别的特征袋数据集人格化
M. L. Gadebe, Okuthe P. Kogeda
{"title":"Personification of Bag-of-Features Dataset for Real Time Activity Recognition","authors":"M. L. Gadebe, Okuthe P. Kogeda","doi":"10.1109/ISCMI.2016.27","DOIUrl":"https://doi.org/10.1109/ISCMI.2016.27","url":null,"abstract":"Personalization of activity recognition is possible and important, when existing public dataset collected from large group of subjects can be tailored and be used as training and testing dataset for new users (subjects) who have similar personal traits. However, due to shortage of personalized dataset and techniques to tailor public dataset for new users weakens the personalization of human activity. To address shortage of personalized dataset, we propose a personification algorithm that extracts and tailor-make bag-of-features dataset to support new users from publicly available Human Activity Recognition dataset (PAMAP2 and USC-HAD). Studies indicate that BMI can be used to profile user's weight as either normal weight or overweight or obese, which could be used to predict cardiovascular diseases. For that purpose our personification algorithm uses height, weight and BMI to generate human activity bag-of-features. The personification algorithm is implemented in Scala and Java programming languages and is deployed on Apache Spark Server. We validated our algorithm, by running three set trials of experiments for each 5 K threshold values using 2 randomly selected new user's profile against two publicly available Human Activity Recognition dataset PAMAP2 and USC-HAD. The results indicate that it is possible to tailor bag-of-features from public dataset. Overall performance of our algorithm shows precision, recall and F-score of 0.70%, 0.50% and 0.60% respectively.","PeriodicalId":417057,"journal":{"name":"2016 3rd International Conference on Soft Computing & Machine Intelligence (ISCMI)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134644884","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
Leader-Follower Fixed-Time Consensus for Multi-agent Systems with Heterogeneous Non-linear Inherent Dynamics 具有非均质非线性内在动力学的多智能体系统的领导-随从定时一致性
A. Sharghi, M. Baradarannia, F. Hashemzadeh
{"title":"Leader-Follower Fixed-Time Consensus for Multi-agent Systems with Heterogeneous Non-linear Inherent Dynamics","authors":"A. Sharghi, M. Baradarannia, F. Hashemzadeh","doi":"10.1109/ISCMI.2016.48","DOIUrl":"https://doi.org/10.1109/ISCMI.2016.48","url":null,"abstract":"In this paper the leader-follower fixed-time consensus of multi agent systems with non-linear inherent dynamics is investigated. The non-linear inherent dynamics for followers and leader are supposed to be different. A distributed control protocol is proposed based on fixed-time consensus and it is shown that the proposed method solves leader-following fixed-time consensus. Finally, simulations are performed to show the efficiency of the theoretical results.","PeriodicalId":417057,"journal":{"name":"2016 3rd International Conference on Soft Computing & Machine Intelligence (ISCMI)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116099029","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}
引用次数: 7
Two-Step Feature Selection Methods for Selection of Very Few Features 基于两步特征选择的极少量特征选择方法
P. Drotár, J. Gazda
{"title":"Two-Step Feature Selection Methods for Selection of Very Few Features","authors":"P. Drotár, J. Gazda","doi":"10.1109/ISCMI.2016.29","DOIUrl":"https://doi.org/10.1109/ISCMI.2016.29","url":null,"abstract":"The feature selection (FS) plays a important role in identification of the significant genes in bioinformatics and related fields. Additionally, it is frequently necessary step to avoid over-fitting and to reduce complexity and computational time. Wang et al [1] proposed new two stage feature selection method achieving excellent classification performance while selecting only few relevant genes. We present new feature selection methods, based on the idea of the Wang's paper, and analyze how the particular filter FS method, used in first stage, influence overall performance. The performance is analyzed by means of the FS stability and influence on the prediction performance. Our results indicate that the stability of FS is significantly affected by the type of FS used in the first stage, but the prediction performance is not so sensitive to the choice of FS in the first stage.","PeriodicalId":417057,"journal":{"name":"2016 3rd International Conference on Soft Computing & Machine Intelligence (ISCMI)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126756961","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
Swarm Intelligence: Today and Tomorrow 群体智能:今天和明天
Xin-She Yang, S. Deb, S. Fong, Xingshi He, Yuxin Zhao
{"title":"Swarm Intelligence: Today and Tomorrow","authors":"Xin-She Yang, S. Deb, S. Fong, Xingshi He, Yuxin Zhao","doi":"10.1109/ISCMI.2016.34","DOIUrl":"https://doi.org/10.1109/ISCMI.2016.34","url":null,"abstract":"Swarm intelligence (SI) and SI-based algorithms have become popular and useful in almost all areas of sciences and engineering. Significant developments have been made in recent years. This paper provides a short but timely analysis about SI algorithms and their links with self-organization. Emphasis has been on the present developments by analyzing the main characteristics and properties of algorithms, while future directions are pointed out by highlighting key challenges and their implications.","PeriodicalId":417057,"journal":{"name":"2016 3rd International Conference on Soft Computing & Machine Intelligence (ISCMI)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114284039","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}
引用次数: 8
Comparative Analysis of ECG Classification Using Neuro-Fuzzy Algorithm and Multimodal Decision Learning Algorithm: ECG Classification Algorithm 神经模糊算法与多模态决策学习算法心电分类的比较分析
G. Naik, K. Reddy
{"title":"Comparative Analysis of ECG Classification Using Neuro-Fuzzy Algorithm and Multimodal Decision Learning Algorithm: ECG Classification Algorithm","authors":"G. Naik, K. Reddy","doi":"10.1109/ISCMI.2016.35","DOIUrl":"https://doi.org/10.1109/ISCMI.2016.35","url":null,"abstract":"Classification of ECGs is an important task for proper identification of the signal which helps in suitable diagnosis of the patient. This paper proposes a new algorithm for ECG basic classification as normal or abnormal. As there are many existing methods for classification like support vector machine, neural networks, neuro-fuzzy algorithms and so on, the main objective of this work is to compare performance analysis of two selected methods, one with adaptive neuro-fuzzy algorithm as the existing method and the other with the proposed method i.e., multimodal decision learning algorithm. The comparative analysis deals with the parameters like true positive (TP), true negative (TN), False positive (FP), False negative (FN), False rejection ratio (FRR), false acceptance ratio (FAR), global acceptance ratio (GAR), confusion matrix (CM), Kappa coefficient (KC), Sensitivity, Specificity and Accuracy. Pre-recorded ECG signals of MIT-BIH database are used for processing, filtering, classification and performance evaluation. Simulation results indicate the ECG signal as normal or abnormal with respect to the above defined parameters.","PeriodicalId":417057,"journal":{"name":"2016 3rd International Conference on Soft Computing & Machine Intelligence (ISCMI)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116429642","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
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学术官方微信