{"title":"A Review of Machine Learning Solutions to Denial-of-Services Attacks in Wireless Sensor Networks","authors":"S. Gunduz, Bilgehan Arslan, Mehmet C. Demirci","doi":"10.1109/ICMLA.2015.202","DOIUrl":"https://doi.org/10.1109/ICMLA.2015.202","url":null,"abstract":"Wireless sensor networks (WSNs) are used in various fields where remote data collection is necessary, such as environment and habitat monitoring, military applications, smart homes, traffic control, and health monitoring etc. Since WSNs play a crucial role in various domains and the sensors are constrained by resources, they are vulnerable to different types of attacks. One of the main attack types that threaten WSNs is Denial-of-Service (DoS) attacks. DoS attacks can be carried out at various layers of the network architecture. In this paper, we review the DoS attacks at each layer of TCP/IP protocol stack. Among them we focus on the network layer attacks because they are more diverse than other layer attacks. We review a number of studies proposing machine learning solutions pertaining to network layer DoS attacks in WSNs. We also provide some comparative conclusions to aid researchers studying in this field.","PeriodicalId":288427,"journal":{"name":"2015 IEEE 14th International Conference on Machine Learning and Applications (ICMLA)","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124619147","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":"Scrubbing the Web for Association Rules: An Application in Predictive Text","authors":"Justin Lovinger, I. Valova","doi":"10.1109/ICMLA.2015.54","DOIUrl":"https://doi.org/10.1109/ICMLA.2015.54","url":null,"abstract":"Modern smartphones have led to an explosion of interest in predictive text. Predicting the next word that a user will type saves precious time on the compact keyboards that smartphones use. By leveraging the vast amounts of text data available on the Internet, we can easily gather information on natural human writing. We can then use this data with association rules to efficiently determine the probability of one word appearing after another given word. In this paper, we explore the gathering of text data from online social media. We also examine the use of association rules for predictive text, and develop an algorithm that can quickly and efficiently generate rules for predictive text. The results of the presented algorithm are compared to Google's Android keyboard.","PeriodicalId":288427,"journal":{"name":"2015 IEEE 14th International Conference on Machine Learning and Applications (ICMLA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129918379","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":"Performance Investigation of UCB Policy in Q-learning","authors":"Koki Saito, A. Notsu, S. Ubukata, Katsuhiro Honda","doi":"10.1109/ICMLA.2015.59","DOIUrl":"https://doi.org/10.1109/ICMLA.2015.59","url":null,"abstract":"In this paper, we investigated performance and usability of UCBQ algorithm proposed in previous research. This is the algorithm that UCB, which is one of bandit algorithms, is applied to Q-Learning, and can balance between exploitation and exploration. We confirmed in the previous research that it was able to realize effective learning in a partially observable Markov decision process by using a continuous state spaces shortest path problem. We numerically examined it by using a variety of simpler learning situation which is the 2 dimensional goal search problem in a Markov decision process, comparing to previous methods. As a result, we confirmed that it had a better performance than other methods.","PeriodicalId":288427,"journal":{"name":"2015 IEEE 14th International Conference on Machine Learning and Applications (ICMLA)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130884818","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":"Artificial Neural Network Based Abdominal Organ Segmentations: A Review","authors":"Evgin Göçeri, Esther Martinez","doi":"10.1109/ICMLA.2015.231","DOIUrl":"https://doi.org/10.1109/ICMLA.2015.231","url":null,"abstract":"There are many neural network based abdominal organ segmentation approaches from medical images. Computed tomography images were mostly used in these approaches. Applied techniques are usually based on prior information regarding position, shape, and size of organs in these methods. In the literature, there are only a few neural network based techniques that were implemented to segment abdominal organs from magnetic resonance based images. In this paper, we present these methods and their results.","PeriodicalId":288427,"journal":{"name":"2015 IEEE 14th International Conference on Machine Learning and Applications (ICMLA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131160972","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":"Speaker Identification in Medical Simulation Data Using Fisher Vector Representation","authors":"Shuangshuang Jiang, H. Frigui, A. Calhoun","doi":"10.1109/ICMLA.2015.187","DOIUrl":"https://doi.org/10.1109/ICMLA.2015.187","url":null,"abstract":"We present a robust speaker identification algorithm that uses effective features based on Fisher Vector (FV) representations. First, low-level spectral features are extracted from the training data. Next, we model the data (in the spectral feature space) by a mixture of Gaussian components. Then, we construct FV descriptors based on the deviation of the features from the Gaussian components. We analyze the FV feature representations on speech data with two common classifiers: K-nearest neighbor classifier (KNN) and support vector machines (SVM). The proposed approach is evaluated using audio data sets recorded to simulate medical crises. We show that the proposed FV feature representation approach achieves a significant improvement when compared to the state-of-art methods.","PeriodicalId":288427,"journal":{"name":"2015 IEEE 14th International Conference on Machine Learning and Applications (ICMLA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131119352","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":"RPC: An Efficient Classifier Ensemble Using Random Projections","authors":"Lovedeep Gondara","doi":"10.1109/ICMLA.2015.193","DOIUrl":"https://doi.org/10.1109/ICMLA.2015.193","url":null,"abstract":"We propose a classifier ensemble called RPC based on principles of rotation forest using random projections. Random projections project the original high dimensional data into lower dimensions while preserving the dataset's geometrical structure reducing classifier's complexity. Random projections are also an efficient dimensionality reduction tool, removing noisy features from dataset and representing the information using only small number of features. Training set for RPC is created by applying random projection on random subsets of the feature set. The randomness of random projection coupled with random sampling adds diversity to RPC. Initial evaluation using datasets from UCI machine learning repository shows that RPC performs equally well or better than Random Forest, Bagging and AdaBoost. We demonstrate that using dimensionality reduction with RPC we can dramatically reduce datasets dimensions without any loss in classification accuracy and significantly enhance computational performance. Finally, we experiment building RPC with different base learners.","PeriodicalId":288427,"journal":{"name":"2015 IEEE 14th International Conference on Machine Learning and Applications (ICMLA)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134320595","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":"Car Following Markov Regime Classification and Calibration","authors":"A. B. Zaky, W. Gomaa, Mohamed A. Khamis","doi":"10.1109/ICMLA.2015.126","DOIUrl":"https://doi.org/10.1109/ICMLA.2015.126","url":null,"abstract":"The car following behavior has recently gained much attention due to its wide variety of applications. This includes accident analysis, driver assessment, support systems, and road design. In this paper, we present a model that leverages Markov regime switching models to classify various car following regimes. The detected car following regimes are then mined to calibrate the parameters of drivers to be dependent on the driver's current driving regime. A two stage Markov regime switching model is utilized to detect different car following regimes. The first stage discriminates normal car following regimes from abnormal ones, while the second stage classifies normal car following regimes to their fine-grained regimes like braking, accelerating, standing, free-flowing, and normal following. A genetic algorithm is then employed to the observed driver data in each car following regime to optimize car following model parameter values of the driver in each regime. Experimental evaluation of the proposed model using a real dataset shows that it can detect up-normal (rare and short time) events. In addition, it can infer the switching process dynamics such as the expected duration, the probability of moving from one regime to another and the switching parameters of each regime. Finally, the model is able to accurately calibrate the parameters of drivers according to their driving regimes, so we can achieve a better understanding of drivers behavior and better simulation of driving situation.","PeriodicalId":288427,"journal":{"name":"2015 IEEE 14th International Conference on Machine Learning and Applications (ICMLA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134460181","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":"Class Decomposition Using K-Means and Hierarchical Clustering","authors":"Shadi Banitaan, A. B. Nassif, Mohammad Azzeh","doi":"10.1109/ICMLA.2015.169","DOIUrl":"https://doi.org/10.1109/ICMLA.2015.169","url":null,"abstract":"This paper presents a clustering-based class decomposition approach to improve the performance of classifiers. Class decomposition works by dividing each class into clusters, and by relabeling instances contained by each cluster with a new class. Several case studies used class decomposition combined with linear classifiers. While there is an essential improvement in classification accuracy because of class decomposition, the most effective clustering algorithm is not obvious. The aim of this work is to investigate the effect of two clustering algorithms, K-means and hierarchical, on class decomposition. In this work, we study class decomposition when combined with the Naive Bayes classifier using four real-world datasets. Experimental results show an improvement in classification accuracy for most of the datasets when class decomposition using both K-means and hierarchical clustering is performed. The results also show that class decomposition is not suitable for all datasets.","PeriodicalId":288427,"journal":{"name":"2015 IEEE 14th International Conference on Machine Learning and Applications (ICMLA)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132145962","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":"Sequential Covariance-Matrix Estimation with Application to Mitigating Catastrophic Forgetting","authors":"Tomer Lancewicki, Benjamin Goodrich, I. Arel","doi":"10.1109/ICMLA.2015.109","DOIUrl":"https://doi.org/10.1109/ICMLA.2015.109","url":null,"abstract":"Catastrophic forgetting is a problem encountered with neural networks as well as other learning systems whereby past representations are lost as new representations are learned. It has been shown that catastrophic forgetting can be mitigated in neural networks by using a neuron selection technique, dubbed \"cluster-select,\" which performs online clustering over the network inputs to partition the network such that only a subset of neurons are used for a given input vector. Cluster-select can benefit by using Mahalanobis distance which relies on an inverse covariance estimate. Unfortunately, covariance estimation is problematic when lacking a very large number of samples relative to the number of input dimensions. One way to tackle this problem is through the use of a shrinkage estimator that offers a compromise between the sample covariance matrix and a well-conditioned matrix with the aim of minimizing the mean-squared error (MSE). In online environments, such as those in which catastrophic forgetting can occur, data arrives sequentially, requiring the covariance matrix to be estimated sequentially. Therefore, in this work we derive sequential update rules for the shrinkage estimator and approximate it's related inverse. The online covariance estimator is applied to the cluster-select technique with results that demonstrate further improvements in terms of effectively mitigating catastrophic forgetting.","PeriodicalId":288427,"journal":{"name":"2015 IEEE 14th International Conference on Machine Learning and Applications (ICMLA)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132789325","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 Highly Distributable Computational Framework for Fast Cloud Data Retrieval","authors":"Amir H. Basirat, Asad I. Khan, B. Srinivasan","doi":"10.1109/ICMLA.2015.96","DOIUrl":"https://doi.org/10.1109/ICMLA.2015.96","url":null,"abstract":"Unlike the existing relational, hierarchical and object-oriented schemes, associative models can analyze data in similar ways to which our brain links information. Such interactions when implemented in voluminous data clouds can assist in searching for overarching relations in complex and highly distributed data sets with speed and accuracy. In this paper, a different perspective of data recognition will be considered. Rather than looking at conventional approaches, such as statistical computations and deterministic learning schemes, this paper will be focusing on distributed processing approach for scalable data recognition and processing through applying an access scheme that will enable fast data retrieval across multiple records and data segments associatively, utilizing a parallel approach. Doing so will yield a new form of databaselike functionality that can scale up or down over the available infrastructure without interruption or degradation, dynamically and automatically. In our proposed model, data records are treated as patterns. As a result, data storage and retrieval is performed using a distributed pattern recognition approach that is implemented through the integration of loosely-coupled computational networks, followed by a divide-and-distribute approach that facilitates distribution of these networks within the cloud dynamically.","PeriodicalId":288427,"journal":{"name":"2015 IEEE 14th International Conference on Machine Learning and Applications (ICMLA)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133155826","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}