{"title":"Path for Kernel Adaptive One-Class Support Vector Machine","authors":"Van Khoa Le, P. Beauseroy","doi":"10.1109/ICMLA.2015.127","DOIUrl":"https://doi.org/10.1109/ICMLA.2015.127","url":null,"abstract":"This paper proposes a Kernel Adaptive One Class SVM (KAOC-SVM) method based on the model introduced by A. Scholkopf and al. [7]. The aim is to find the solution path - the path of Lagrange multiplier a - as the kernel parameter changes from one value to another. It is similar to the regularization path approach proposed by Hastie and al. [2], which finds the path when the regularization parameter ? changes from 0 to 1. In present case, the main difference is that the Lagrange multiplier paths are not piecewise linear anymore. Experimental results show that the proposed method is able to compute one-class SVMs with the same accuracy as traditional method but exploring all solutions combining 2 kernels. Simulation results are presented and CPU requirement is analyzed.","PeriodicalId":288427,"journal":{"name":"2015 IEEE 14th International Conference on Machine Learning and Applications (ICMLA)","volume":"8 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":"116772353","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":"Measuring Level-K Reasoning, Satisficing, and Human Error in Game-Play Data","authors":"Tamal Biswas, Kenneth W. Regan","doi":"10.1109/ICMLA.2015.233","DOIUrl":"https://doi.org/10.1109/ICMLA.2015.233","url":null,"abstract":"Inferences about structured patterns in human decision making have been drawn from medium-scale simulated competitions with human subjects. The concepts analyzed in these studies include level-k thinking, satisficing, and other human error tendencies. These concepts can be mapped via a natural depth of search metric into the domain of chess, where copious data is available from hundreds of thousands of games by players of a wide range of precisely known skill levels in real competitions. The games are analyzed by strong chess programs to produce authoritative utility values for move decision options by progressive deepening of search. Our experiments show a significant relationship between the formulations of level-k thinking and the skill level of players. Notably, the players are distinguished solely on moves where they erred -- according to the average depth level at which their errors are exposed by the authoritative analysis. Our results also indicate that the decisions are often independent of tail assumptions on higher-order beliefs. Further, we observe changes in this relationship in different contexts, such as minimal versus acute time pressure. We try to relate satisficing to insufficient level of reasoning and answer numerically the question, why do humans blunder?","PeriodicalId":288427,"journal":{"name":"2015 IEEE 14th International Conference on Machine Learning and Applications (ICMLA)","volume":"27 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":"122484373","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-level Resolution Features for Classification of Transportation Trajectories","authors":"Aidan Macdonald, Jeffrey S. Ellen","doi":"10.1109/ICMLA.2015.66","DOIUrl":"https://doi.org/10.1109/ICMLA.2015.66","url":null,"abstract":"We explore the use of filter-like multi-level resolution features of a positional trajectory for classification. Our approach is time and location agnostic which increases generality. Several filter types are discussed and used in feature extraction including moments and wavelets. Previous work by Bolbol et al. is extended to incorporate these features and results are shown for each framework and filter type. We attempt a 6-way classification of mode of transportation from GPS trajectories obtained from cell phone handsets. Our primary contribution is that our approach can classify an entire trajectory, regardless of its length, overcoming a deficiency in other approaches which require trajectories to be segmented into equal length parts. We achieve >60% accuracy split between 6 classes where the 'random' feature accuracy is <;28%, an 'informative' gain of over 30%..","PeriodicalId":288427,"journal":{"name":"2015 IEEE 14th International Conference on Machine Learning and Applications (ICMLA)","volume":"152 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":"132736859","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":"An Automatic Recognition for the Auditory Brainstem Response Waveform","authors":"Balemir Uragun","doi":"10.1109/ICMLA.2015.92","DOIUrl":"https://doi.org/10.1109/ICMLA.2015.92","url":null,"abstract":"The Auditory Brainstem Response (ABR) is Brainstem Auditory Evoked potentials and often used in the neurophysiology. The waveform of ABR is usually recorded right after stimulation applied, as a response characteristic with a five peaks. These each peaks from the recording electrodes is identified by (a) neural transmission times and (b) amplitude in measured potentials. These sequential of few msec peaks with the amplitude are all correlated each other to form a unique-pattern and that can be observed as a health-monitoring indicator. In this paper, an automatic recognition pattern for ABR waveform is proposed. Firstly, diverse ABR applications and recent techniques reviewed. Than, knowledge based information obtained from these recent techniques to develop a similar methodology, secondly to model the complete set of peaks in the ABR waveform. Several curve fitted functions tested to narrow down the suitable function to be used for the ABR model. The outcome is the parameter of this mathematical modelling of ABR pattern, and put forward the use for an automatic health diagnostic tool as a machine learning application.","PeriodicalId":288427,"journal":{"name":"2015 IEEE 14th International Conference on Machine Learning and Applications (ICMLA)","volume":"23 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":"132759295","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 Hierarchical Deep Neural Network for Fault Diagnosis on Tennessee-Eastman Process","authors":"Danfeng Xie, Limei Bai","doi":"10.1109/ICMLA.2015.208","DOIUrl":"https://doi.org/10.1109/ICMLA.2015.208","url":null,"abstract":"This paper proposes a hierarchical deep neural network (HDNN) for diagnosing the faults on the Tennessee-Eastman process (TEP). The TEP process is a benchmark simulation model for evaluating process control and monitoring method. A supervisory deep neural network is trained to categorize the whole faults into a few groups. For each group of faults, a special deep neural network which is trained for the particular group is triggered for further diagnosis. The training and test data is generated from the Tennessee Eastman process simulation. The performance of the proposed method is evaluated and compared to single neural network (SNN) and duty-oriented hierarchical artificial neural network (DOHANN) methods. The results of experiment demonstrate that our method outperforms the SNN and DOHANN methods.","PeriodicalId":288427,"journal":{"name":"2015 IEEE 14th International Conference on Machine Learning and Applications (ICMLA)","volume":"87 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":"133996641","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}
Bin-Bin Gao, Jianjun Wang, Yao Wang, Chan-Yun Yang
{"title":"Coordinate Descent Fuzzy Twin Support Vector Machine for Classification","authors":"Bin-Bin Gao, Jianjun Wang, Yao Wang, Chan-Yun Yang","doi":"10.1109/ICMLA.2015.35","DOIUrl":"https://doi.org/10.1109/ICMLA.2015.35","url":null,"abstract":"In this paper, we develop a novel coordinate descent fuzzy twin SVM (CDFTSVM) for classification. The proposed CDFTSVM not only inherits the advantages of twin SVM but also leads to a rapid and robust classification results. Specifically, our CDFTSVM has two distinguished advantages: (1) An effective fuzzy membership function is produced for removing the noise incurred by the contaminant inputs. (2) A coordinate descent strategy with shrinking by active set is used to deal with the computational complexity brought by the high dimensional input. In addition, a series of simulation experiments are conducted to verify the performance of the CDFTSVM, which further supports our previous claims.","PeriodicalId":288427,"journal":{"name":"2015 IEEE 14th International Conference on Machine Learning and Applications (ICMLA)","volume":"188 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":"132188964","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 Demonstration of Stability-Plasticity Imbalance in Multi-agent, Decomposition-Based Learning","authors":"Sean C. Mondesire, R. P. Wiegand","doi":"10.1109/ICMLA.2015.106","DOIUrl":"https://doi.org/10.1109/ICMLA.2015.106","url":null,"abstract":"Layered learning is a machine learning paradigm used in conjunction with direct-policy search reinforcement learning methods to find high performance agent behaviors for complex tasks. At its core, layered learning is a decomposition-based paradigm that shares many characteristics with robot shaping, transfer learning, hierarchical decomposition, and incremental learning. Previous studies have provided evidence that layered learning has the ability to outperform standard monolithic methods of learning in many cases. The dilemma of balancing stability and plasticity is a common problem in machine learning that causes learning agents to compromise between retaining learned information to perform a task with new incoming information. Although existing work implies that there is a stability-plasticity imbalance that greatly limits layered learning agents' ability to learn optimally, no work explicitly verifies the existence of the imbalance or its causes. This work investigates the stability-plasticity imbalance and demonstrates that indeed, layered learning heavily favors plasticity, which can cause learned subtask proficiency to be lost when new tasks are learned. We conclude by identifying potential causes of the imbalance in layered learning and provide high level advice about how to mitigate the imbalance's negative effects.","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":"115551647","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":"Probabilistic Models for One-Day Ahead Solar Irradiance Forecasting in Renewable Energy Applications","authors":"C. V. A. Silva, L. Lim, D. Stevens, D. Nakafuji","doi":"10.1109/ICMLA.2015.137","DOIUrl":"https://doi.org/10.1109/ICMLA.2015.137","url":null,"abstract":"Solar irradiance forecasting is an important problem in renewable energy management where any dips in solar energy generation must be made up for by reserves in order to ensure an uninterrupted energy supply. In this paper, we study several data mining methods for short term solar irradiance forecasting at a given location. In particular, we apply linear regression, probabilistic models, and naive Bayes classifier to forecast solar irradiance one day ahead, i.e., we forecast what tomorrow's solar irradiance will be like at sundown today. We evaluate the forecasting performance of our adaptations of the three models using land-based weather data from several weather stations on the island of Oahu in Hawai'i.","PeriodicalId":288427,"journal":{"name":"2015 IEEE 14th International Conference on Machine Learning and Applications (ICMLA)","volume":"14 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":"117081674","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":"Superposed Naive Bayes for Accurate and Interpretable Prediction","authors":"Toshiki Mori","doi":"10.1109/ICMLA.2015.147","DOIUrl":"https://doi.org/10.1109/ICMLA.2015.147","url":null,"abstract":"Background: Data mining and machine learning techniques have been widely applied in software engineering research. However, past research has mainly focused on only prediction accuracy. Aim: The interpretability of prediction results should be accorded greater emphasis in software engineering research. A prediction model that has high accuracy and explanatory power is required. Method: We propose a new algorithm of naïve Bayes ensemble, called superposed naïve Bayes (SNB), which firstly builds an ensemble model with high prediction accuracy and then transforms it into an interpretable naïve Bayes model. Results: We conducted an experiment with the NASA MDP datasets, in which the performance and interpretability of the proposed method were compared with those of other classification techniques. The results of the experiment indicate that the proposed method can produce balanced outputs that satisfy both performance and interpretability criteria. Conclusion: We confirmed the effectiveness of the proposed method in an experiment using software defect data. The model can be extensively applied to other application areas, where both performance and interpretability are required.","PeriodicalId":288427,"journal":{"name":"2015 IEEE 14th International Conference on Machine Learning and Applications (ICMLA)","volume":"50 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":"121477098","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":"Extracting Topical Information of Tweets Using Hashtags","authors":"Z. Alp, Ş. Öğüdücü","doi":"10.1109/ICMLA.2015.73","DOIUrl":"https://doi.org/10.1109/ICMLA.2015.73","url":null,"abstract":"Twitter is one of the largest micro blogging web sites where users share news, their opinions, moods, recommendations by posting text messages, and it is mostly used like a news media. Since the data being shared via Twitter is vast, many researches are focusing on extracting meaningful information with the help of information retrieval systems. Retrieving meaningful information from social media applications became important for several tasks such as sentiment analysis, detecting anomalies, and recommendation systems. Topic modeling is one of the mostly studied and hard problems in information retrieval area, and it is even more challenging to model topics when the documents are too short such as tweets. In this paper, we focus on developing an effective and efficient method to overcome this challenge of tweets being too short for topic modeling. We compare different topic modeling schemes, one of which is not studied before, based on Latent Dirichlet Allocation (LDA) that merges tweets in order to improve LDA performance. We also demonstrate our experimental results with unbiased data collection and evaluation methodologies.","PeriodicalId":288427,"journal":{"name":"2015 IEEE 14th International Conference on Machine Learning and Applications (ICMLA)","volume":"16 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":"125280257","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}