Erik J. Linstead, Rene German, Dennis R. Dixon, D. Granpeesheh, Marlena N. Novack, Alva Powell
{"title":"An Application of Neural Networks to Predicting Mastery of Learning Outcomes in the Treatment of Autism Spectrum Disorder","authors":"Erik J. Linstead, Rene German, Dennis R. Dixon, D. Granpeesheh, Marlena N. Novack, Alva Powell","doi":"10.1109/ICMLA.2015.214","DOIUrl":"https://doi.org/10.1109/ICMLA.2015.214","url":null,"abstract":"We apply artificial neural networks to the task of predicting the mastery of learning outcomes in response to behavioral therapy for children diagnosed with autism spectrum disorder. We report results for a sample size of 726 children, the largest sample size reported for a study of this nature to date. Our results show that neural networks substantially outperform the linear regression models reported in previous studies, and demonstrate the benefits of leveraging more sophisticated machine learning techniques in the autism research domain.","PeriodicalId":288427,"journal":{"name":"2015 IEEE 14th International Conference on Machine Learning and Applications (ICMLA)","volume":"30 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":"130199030","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}
R. LeMoyne, Timothy Mastroianni, A. Hessel, K. Nishikawa
{"title":"Application of a Multilayer Perceptron Neural Network for Classifying Software Platforms of a Powered Prosthesis through a Force Plate","authors":"R. LeMoyne, Timothy Mastroianni, A. Hessel, K. Nishikawa","doi":"10.1109/ICMLA.2015.211","DOIUrl":"https://doi.org/10.1109/ICMLA.2015.211","url":null,"abstract":"The amalgamation of conventional gait analysis devices, such as a force plate, with a machine learning platform facilitates the capability to classify between two disparate software platforms for the same bionic powered prosthesis. The BiOM powered prosthesis is applied with its standard software platform that incorporates a finite state machine control architecture and a biomimetic software platform that uniquely accounts for the muscle modeling history dependence known as the winding filament hypothesis. The feature set is derived from a series of kinetic and temporal parameters derived from the force plate recordings. The multilayer perceptron neural network achieves 91% classification between the software platforms for the BiOM powered prosthesis conventional finite state machine control architecture and biomimetic software platform based on the force plate derived feature set.","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":"132170697","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":"Incremental Learning on Decorrelated Approximators","authors":"Jan H. Schoenke, W. Brockmann","doi":"10.1109/ICMLA.2015.153","DOIUrl":"https://doi.org/10.1109/ICMLA.2015.153","url":null,"abstract":"In general, designing an incremental learning system for a particular task at least consists of choosing an appropriate approximation structure and learning algorithm. Common Linear In the Parameters (LIP) approximation structures are for example polynomials, radial basis functions or grid-based lookup tables. Typical learning algorithms accompanying them are for example Passive-Aggressive (PA) or Recursive Least Squares (RLS). Usually, these two choices are not independent as not every learning algorithm is able to handle any approximation structure well. Here we present a formalism that allows the designer to treat these two design aspects independently from each other. By decorrelating the basis functions of the approximator we form a new set of basis functions that can be handled by any learning algorithm. We develop design guidelines in order to make our approach an easy to use tool and to support the designer in making the learning progress reliable at design time. Further, we look at the properties of our approach as an extension to LIP approximators and investigate its implications for the behavior of the incremental learning system using artificial, benchmark and real world data sets for regression tasks.","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":"132860066","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":"Automatically Discovering Fatigue Patterns from Sparsely Labelled Temporal Data","authors":"Karen Guo, Paul Schrater","doi":"10.1109/ICMLA.2015.51","DOIUrl":"https://doi.org/10.1109/ICMLA.2015.51","url":null,"abstract":"In many problems, we would like to find relation between data and description. However, this description, or label information, may not always be explicitly associated with the data. In this paper, we deal with the data with incomplete label information. In other words, the label only represents a general concept of a bag of data vectors instead of a specific information of one data vector. Our approach assumed that the feature vectors generated from the bag of data can be partitioned into baglabel relevant and irrelevant parts. Under this assumption, we give an algorithm that allows for efficiently extracting meaningful features from a large pool of features, and learning a multiple instance based predictor. We applied our algorithm to the monkey fixation data to predict the monkeys' quit behavior. Our algorithm outperforms other standard classification methods such as binary classifier and one-class classifier. In addition, the microsaccade is interpreted from a large set of features using our method. We find that it is the most effective element to predict the quit behavior.","PeriodicalId":288427,"journal":{"name":"2015 IEEE 14th International Conference on Machine Learning and Applications (ICMLA)","volume":"37 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":"132449478","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 Web-Based Auction Platform for Electricity Retail Markets","authors":"Burak Colak, M. Gokmen, H. Kiliç","doi":"10.1109/ICMLA.2015.17","DOIUrl":"https://doi.org/10.1109/ICMLA.2015.17","url":null,"abstract":"A web-based combinatorial reverse auction platform for electricity retail markets is designed and implemented. At consumer side, the system provides cheaper electricity consumption by means of established competitive market environment. The competitive set up allows suppliers a continuous channel of bidding and chance to increase number of their customers. The winner determination problem of combinatorial auctions - known to be NP-Hard is solved by using available commercial off the shelf optimizer. Experimental results showed that the performance critical component of the platform (i.e. the optimizer) performs quite satisfactory in terms of solution time & memory loads. We observed that there is no correlation between different number of bidders, bids per bidder and solution time & memory load values.","PeriodicalId":288427,"journal":{"name":"2015 IEEE 14th International Conference on Machine Learning and Applications (ICMLA)","volume":"52 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":"116225790","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 Support Vector Classification Model with Partial Empirical Risks Given","authors":"Linkai Luo, Ling-Jun Ye, Qifeng Zhou, Hong Peng","doi":"10.1109/ICMLA.2015.45","DOIUrl":"https://doi.org/10.1109/ICMLA.2015.45","url":null,"abstract":"A novel model of support vector classification with partial empirical risks given (P-SVC) is proposed. A sequential minimal optimization for P-SVC is also provided. P-SVC is an extension of the classical support vector classification (C-SVC) and can be used in the case where partial empirical risks are requested. The experiments on some artificial and benchmark datasets show P-SVC obtains a better classification accuracy and a more stable classification result than C-SVC does when partial empirical risks are known.","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":"121735727","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":"Local Coordinate Projective Non-negative Matrix Factorization","authors":"Qing Liao, Xiang Zhang, Naiyang Guan, Qian Zhang","doi":"10.1109/ICMLA.2015.47","DOIUrl":"https://doi.org/10.1109/ICMLA.2015.47","url":null,"abstract":"Non-negative matrix factorization (NMF) decomposes a group of non-negative examples into both lower-rank factors including the basis and coefficients. It still suffers from the following deficiencies: 1) it does not always ensure the decomposed factors to be sparse theoretically, and 2) the learned basis often stays away from original examples, and thus lacks enough representative capacity. This paper proposes a local coordinate projective NMF (LCPNMF) to overcome the above deficiencies. Particularly, LCPNMF induces sparse coefficients by relaxing the original PNMF model meanwhile encouraging the basis to be close to original examples with the local coordinate constraint. Benefitting from both strategies, LCPNMF can significantly boost the representation ability of the PNMF. Then, we developed the multiplicative update rule to optimize LCPNMF and theoretically proved its convergence. Experimental results on three popular frontal face image datasets verify the effectiveness of LCPNMF comparing to the representative methods.","PeriodicalId":288427,"journal":{"name":"2015 IEEE 14th International Conference on Machine Learning and Applications (ICMLA)","volume":"6 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":"122172802","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":"Recognizing Human Activities from Raw Accelerometer Data Using Deep Neural Networks","authors":"Licheng Zhang, Xihong Wu, D. Luo","doi":"10.1109/ICMLA.2015.48","DOIUrl":"https://doi.org/10.1109/ICMLA.2015.48","url":null,"abstract":"Activity recognition from wearable sensor data has been researched for many years. Previous works usually extracted features manually, which were hand-designed by the researchers, and then were fed into the classifiers as the inputs. Due to the blindness of manually extracted features, it was hard to choose suitable features for the specific classification task. Besides, this heuristic method for feature extraction could not generalize across different application domains, because different application domains needed to extract different features for classification. There was also work that used auto-encoders to learn features automatically and then fed the features into the K-nearest neighbor classifier. However, these features were learned in an unsupervised manner without using the information of the labels, thus might not be related to the specific classification task. In this paper, we recommend deep neural networks (DNNs) for activity recognition, which can automatically learn suitable features. DNNs overcome the blindness of hand-designed features and make use of the precious label information to improve activity recognition performance. We did experiments on three publicly available datasets for activity recognition and compared deep neural networks with traditional methods, including those that extracted features manually and auto-encoders followed by a K-nearest neighbor classifier. The results showed that deep neural networks could generalize across different application domains and got higher accuracy than traditional methods.","PeriodicalId":288427,"journal":{"name":"2015 IEEE 14th International Conference on Machine Learning and Applications (ICMLA)","volume":"30 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":"123808200","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":"Efficient and Rotation Invariant Fingerprint Matching Algorithm Using Adjustment Factor","authors":"Asif Iqbal Khan, M. Wani","doi":"10.1109/ICMLA.2015.226","DOIUrl":"https://doi.org/10.1109/ICMLA.2015.226","url":null,"abstract":"This paper presents a new efficient and rotation invariant algorithm that makes use of local features forfingerprint matching. Minutiae points are first extracted from afingerprint image. Minutiae code mc, defined in this paper, is then generated for each extracted minutiae point. The proposed minutiae code is invariant to rotation of the fingerprint image. Adjustment factor (AF) is introduced to address the problem due to differences in a claimant fingerprint and a template fingerprint of the same person that may be present due to variations in inking or variations in pressure applied between a finger and the scanner. Adjustment factor is calculated from the minutiae code (mc) of the two fingerprints being matched. A two stage fingerprint matching process is proposed. During first stage only a few minutiae codes are checked to decide if the second stage of matching process is required. This makes the matching process faster. The proposed strategy is tested on a number of publicly available images (DB1 of FVC2004 database) and the results are promising.","PeriodicalId":288427,"journal":{"name":"2015 IEEE 14th International Conference on Machine Learning and Applications (ICMLA)","volume":"11 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":"121798986","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":"Multi-period Prediction of Solar Radiation Using ARMA and ARIMA Models","authors":"I. Colak, M. Yesilbudak, N. Genç, R. Bayindir","doi":"10.1109/ICMLA.2015.33","DOIUrl":"https://doi.org/10.1109/ICMLA.2015.33","url":null,"abstract":"Due to the variations in weather conditions, solar power integration to the electricity grid at a high penetration rate can cause a threat for the grid stability. Therefore, it is required to predict the solar radiation parameter in order to ensure the quality and the security of the grid. In this study, initially, a 1-h time series model belong to the solar radiation parameter is created for multi-period predictions. Afterwards, autoregressive moving average (ARMA) and autoregressive integrated moving average (ARIMA) models are compared in terms of the goodness-of-fit value produced by the log-likelihood function. As a result of determining the best statistical models in multi-period predictions, one-period, two-period and three-period ahead predictions are carried out for the solar radiation parameter in a comprehensive way. Many feasible comparisons have been made for the solar radiation prediction.","PeriodicalId":288427,"journal":{"name":"2015 IEEE 14th International Conference on Machine Learning and Applications (ICMLA)","volume":"11 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":"125547043","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}