{"title":"Machine learning of engineering diagnostic knowledge from unstructured verbatim text descriptions","authors":"Yinghao Huang, Y. Murphey, Yao Ge","doi":"10.1109/CIDM.2013.6597216","DOIUrl":"https://doi.org/10.1109/CIDM.2013.6597216","url":null,"abstract":"This paper presents our research in text mining for discovering important engineering fault diagnostic knowledge from unstructured and verbatim text descriptions. In particular we focus on developing machine learning algorithms for detecting documents that contain descriptions of systematic failures and root causes to the faults. We developed a machine algorithm based on entropy analysis to extract an A-word list, a list of words that are important to characterize the documents of interests, a vector space model to represent features of important documents, and a constraint based k-means clustering algorithm to generate high purity clusters for use in detecting important documents. We applied the algorithms to automotive diagnostic text data, which are unstructured and verbatim descriptions by customers and technicians that contain many typos and self-invented terms. We were able to reduce a list of 2183 words to a list of 137 important words. The classification system generated by these machine learning algorithms showed high recall and accuracy in detecting important diagnostic descriptions.","PeriodicalId":220189,"journal":{"name":"2013 IEEE Symposium on Computational Intelligence and Data Mining (CIDM)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130076096","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":"Detecting abnormal ozone levels using PCA-based GLR hypothesis testing","authors":"F. Harrou, M. Nounou, H. Nounou","doi":"10.1109/CIDM.2013.6597223","DOIUrl":"https://doi.org/10.1109/CIDM.2013.6597223","url":null,"abstract":"Ozone is one of the lost serious air pollution problems. Monitoring abnormal changes in the concentration of ozone in the troposphere is of great interest because of its negative influence on human health, vegetation, and materials. Modeling ozone is very challenging because of the complexity of the ozone formation mechanisms in the troposphere and the uncertainty about the meteorological conditions in urban areas. In the absence of a process model, principal component analysis (PCA), which is a multivariate statistical technique, has been successfully used as a data-based fault detection (FD) method for highly correlated process variables. When a process model is available, however, the generalized likelihood ratio (GLR) test, which is a statistical hypothesis testing method, has shown good fault detection abilities. In this work, a PCA-based GLR fault detection algorithm is developed to exploit the advantages of the GLR test in the absence of a process model. In fact, PCA is used to provide a modeling framework for the develop fault detection algorithm. The developed PCA-based GLR FD algorithm is utilized to enhance monitoring the ozone concentrations in Upper Normandy, France. The performances of PCA and PCA-based GLR test are compared through two practical case studies, one involving a sensor fault and the other involving tropospheric ozone pollution in multiple measuring stations. The results show that the PCA-based GLR test can detect abnormal ozone levels with a smaller number of false alarms than the conventional PCA method.","PeriodicalId":220189,"journal":{"name":"2013 IEEE Symposium on Computational Intelligence and Data Mining (CIDM)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130757968","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":"Interpretable models from distributed data via merging of decision trees","authors":"A. Andrzejak, Felix Langner, Silvestre Zabala","doi":"10.1109/CIDM.2013.6597210","DOIUrl":"https://doi.org/10.1109/CIDM.2013.6597210","url":null,"abstract":"Learning from distributed data becomes increasingly important. Factors contributing to this trend include emergence of data sets exceeding RAM sizes and inherently distributed scenarios such as mobile environments. Also in these cases interpretable models are favored: they facilitate identifying artifacts and understanding the impact of individual variables. Given the distributed environment, even if the individual learner on each site is interpretable, the overall model usually is not (as e.g. in case of voting schemes). To overcome this problem we propose an approach for efficient merging of decision trees (each learned independently) into a single decision tree. The method complements the existing distributed decision trees algorithms by providing interpretable intermediate models and tolerating constraints on bandwidth and RAM size. The latter properties are achieved by trading RAM and communication constraints for accuracy. Our method and the mentioned trade-offs are validated in experiments on real-world data sets.","PeriodicalId":220189,"journal":{"name":"2013 IEEE Symposium on Computational Intelligence and Data Mining (CIDM)","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122878199","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":"Unsupervised multimodal VAD using sequential hierarchy","authors":"R. Ahmad, Syed Paymaan Raza, Hafiz Malik","doi":"10.1109/CIDM.2013.6597233","DOIUrl":"https://doi.org/10.1109/CIDM.2013.6597233","url":null,"abstract":"In speech processing systems, the performance of the Voice Activity Detector (VAD) is a bottleneck to the whole system. Traditional VADs are solely based on acoustic features. Additional modality in form of visual information is used to make robust VADs. In this paper, we propose a multimodal VAD based on decision fusion between two modalities. Visual VAD (VVAD) decision vectors are interpolated so that logical operators can be applied to both modalities. In order to avoid this interpolation, we suggest a sequential arrangement of both subsystems to achieve a multimodal VAD. The proposed method considerably reduces false alarm rates when compared with performance of standalone audio VAD (AVAD).","PeriodicalId":220189,"journal":{"name":"2013 IEEE Symposium on Computational Intelligence and Data Mining (CIDM)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125716572","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}
O. Schulte, B. Bina, B. Crawford, D. Bingham, Y. Xiong
{"title":"A hierarchy of independence assumptions for multi-relational Bayes net classifiers","authors":"O. Schulte, B. Bina, B. Crawford, D. Bingham, Y. Xiong","doi":"10.1109/CIDM.2013.6597230","DOIUrl":"https://doi.org/10.1109/CIDM.2013.6597230","url":null,"abstract":"Many databases store data in relational format, with different types of entities and information about their attributes and links between the entities. Link-based classification (LBC) is the problem of predicting the class attribute of a target entity given the attributes of entities linked to it. In this paper we propose a new relational Bayes net classifier method for LBC, which assumes that different links of an object are independently drawn from the same distribution, given attribute information from the linked tables. We show that this assumption allows very fast multi-relational Bayes net learning. We define three more independence assumptions for LBC to unify proposals from different researchers in a single novel hierarchy. Our proposed model is at the top and the wellknown multi-relational Naive Bayes classifier is at the bottom of this hierarchy. The model in each level of the hierarchy uses a new independence assumption in addition to the assumptions used in the higher levels. In experiments on four benchmark datasets, our proposed link independence model has the best predictive accuracy compared to the hierarchy models and a variety of relational classifiers.","PeriodicalId":220189,"journal":{"name":"2013 IEEE Symposium on Computational Intelligence and Data Mining (CIDM)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128206149","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":"How to extract meaningful shapes from noisy time-series subsequences?","authors":"Yanfei Kang, K. Smith‐Miles, D. Belušić","doi":"10.1109/CIDM.2013.6597219","DOIUrl":"https://doi.org/10.1109/CIDM.2013.6597219","url":null,"abstract":"A method for extracting and classifying shapes from noisy time series is proposed. The method consists of two steps. The first step is to perform a noise test on each subsequence extracted from the series using a sliding window. All the subsequences recognised as noise are removed from further analysis, and the shapes are extracted from the remaining non-noise subsequences. The second step is to cluster these extracted shapes. Although extracted from subsequences, these shapes form a non-overlapping set of time series subsequences and are hence amenable to meaningful clustering. The method is primarily designed for extracting and classifying shapes from very noisy real-world time series. Tests using artificial data with different levels of white noise and the red noise, and the real-world atmospheric turbulence data naturally characterised by strong red noise show that the method is able to correctly extract and cluster shapes from artificial data and that it has great potential for locating shapes in very noisy real-world time series.","PeriodicalId":220189,"journal":{"name":"2013 IEEE Symposium on Computational Intelligence and Data Mining (CIDM)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127462736","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":"Ready-to-use activity recognition for smartphones","authors":"Pekka Siirtola, J. Röning","doi":"10.1109/CIDM.2013.6597218","DOIUrl":"https://doi.org/10.1109/CIDM.2013.6597218","url":null,"abstract":"In this study, every day activities are recognized from data collected using smartphones accelerometer sensors. Offline experiments are made to show that the presented method is user- and body position-independent. In addition, it is shown that the features used in the classification are not dependent on the calibration of the phone. The recognition models trained using the offline data are also tested online. A mobile application running these models is built for two operating systems: Symbian^3 and Android. Real-time experiments using these applications are made to show that the presented method can be implemented to any operating system and hardware variations do not affect recognition results. High recognition accuracies are obtained, in the offline study, the average recognition rate is almost 99% and, also, in the online study, the average recognition accuracy is over 90%.","PeriodicalId":220189,"journal":{"name":"2013 IEEE Symposium on Computational Intelligence and Data Mining (CIDM)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131993701","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}
M. Strickert, B. Hammer, T. Villmann, Michael Biehl
{"title":"Regularization and improved interpretation of linear data mappings and adaptive distance measures","authors":"M. Strickert, B. Hammer, T. Villmann, Michael Biehl","doi":"10.1109/CIDM.2013.6597211","DOIUrl":"https://doi.org/10.1109/CIDM.2013.6597211","url":null,"abstract":"Linear data transformations are essential operations in many machine learning algorithms, helping to make such models more flexible or to emphasize certain data directions. In particular for high dimensional data sets linear transformations are not necessarily uniquely determined, though, and alternative parameterizations exist which do not change the mapping of the training data. Thus, regularization is required to make the model robust to noise and more interpretable for the user. In this contribution, we characterize the group of transformations which leave a linear mapping invariant for a given finite data set, and we discuss the consequences on the interpretability of the models. We propose an intuitive regularization mechanism to avoid problems in under-determined configurations, and we test the approach in two machine learning models.","PeriodicalId":220189,"journal":{"name":"2013 IEEE Symposium on Computational Intelligence and Data Mining (CIDM)","volume":"83 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134503305","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":"Detecting pixel-value differencing steganography using Levenberg-Marquardt neural network","authors":"El-Sayed M. El-Alfy","doi":"10.1109/CIDM.2013.6597231","DOIUrl":"https://doi.org/10.1109/CIDM.2013.6597231","url":null,"abstract":"With the wide use of steganographic techniques, several security challenges emerge, e.g. criminals and network intruders can hide any information they want into legitimate multimedia data and exchange it over the Internet. This requires network designers and service providers to investigate new tools for detecting such misuse. In this paper, we explore a detection method based on neural network approach with Levenberg-Marquardt back propagation learning algorithm. This learning technique has been known to overcome the slow convergence of traditional back propagation and the instability problem of the steepest descent optimization method. We focus on digital images containing messages embedded by one of the recently proposed steganographic methods, known as pixel-value differencing. The idea is to analyze images before and after embedding to extract discriminating features and then build a neural network recognition model. The proposed approach is empirically evaluated and compared with four other machine-learning methods. The results show that more than 99% detection rate can be attained with very few false alarms.","PeriodicalId":220189,"journal":{"name":"2013 IEEE Symposium on Computational Intelligence and Data Mining (CIDM)","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114277213","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":"Automated selection of interaction effects in sparse kernel methods to predict pregnancy viability","authors":"V. Belle, P. Lisboa","doi":"10.1109/CIDM.2013.6597213","DOIUrl":"https://doi.org/10.1109/CIDM.2013.6597213","url":null,"abstract":"Support vector machines are highly flexible and generalizing mathematical models that can be used to build prediction models. Their success on a mathematical field is not followed by their application in practice due to their black-box nature. The RBF kernel is often used but the good performance cannot be accompanied by an interpretation of the results. We present a method to visualize the different components of an RBF kernel and propose a method to select the relevant ones. The proposed method is able to automatically detect important main and two-way interaction effects while still obtaining interpretable prediction models. The method is illustrated on a large dataset to predict the viability of pregnancies at the end of the first trimester based on initial scan findings.","PeriodicalId":220189,"journal":{"name":"2013 IEEE Symposium on Computational Intelligence and Data Mining (CIDM)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124539689","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}