{"title":"Research on Data Mining Algorithms for Automotive Customers' Behavior Prediction Problem","authors":"Lan Huang, Chunguang Zhou, Yu Zhou, Zhe Wang","doi":"10.1109/ICMLA.2008.23","DOIUrl":"https://doi.org/10.1109/ICMLA.2008.23","url":null,"abstract":"This paper extracts automotive marketing information, constructs data warehouse, adopts an improved ID3 decision tree model and an association rule model to do data mining, and then obtains prediction information of automotive customers' behavior. Experimental and comparative results verify the validity and accuracy of the prediction results.","PeriodicalId":381692,"journal":{"name":"2008 Seventh International Conference on Machine Learning and Applications","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133214037","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}
Abdeslam Boularias, Masoumeh T. Izadi, B. Chaib-draa
{"title":"Prediction-Directed Compression of POMDPs","authors":"Abdeslam Boularias, Masoumeh T. Izadi, B. Chaib-draa","doi":"10.1109/ICMLA.2008.115","DOIUrl":"https://doi.org/10.1109/ICMLA.2008.115","url":null,"abstract":"High dimensionality of belief space in partially observable Markov decision processes (POMDPs) is one of the major causes that severely restricts the applicability of this model. Previous studies have demonstrated that the dimensionality of a POMDP can eventually be reduced by transforming it into an equivalent predictive state representation (PSR). In this paper, we address the problem of finding an approximate and compact PSR model corresponding to a given POMDP model. We formulate this problem in an optimization framework. Our algorithm tries to minimize the potential error that missing some core tests may cause. We also present an empirical evaluation on benchmark problems, illustrating the performance of this approach.","PeriodicalId":381692,"journal":{"name":"2008 Seventh International Conference on Machine Learning and Applications","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132072132","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}
Shiva K. Das, Shifeng Chen, J. Deasy, Sumin Zhou, F. Yin, L. Marks
{"title":"Decision Fusion of Machine Learning Models to Predict Radiotherapy-Induced Lung Pneumonitis","authors":"Shiva K. Das, Shifeng Chen, J. Deasy, Sumin Zhou, F. Yin, L. Marks","doi":"10.1109/ICMLA.2008.122","DOIUrl":"https://doi.org/10.1109/ICMLA.2008.122","url":null,"abstract":"Combining different machine learning models (decision fusion) has been shown to be an effective method for estimating the underlying physical mechanism by allowing the models to reinforce each other when consensus exists, or, conversely, negate each other when there is no consensus. To be effective, decision fusion requires that the different models provide some degree of complementary information. In this work, we fuse the results of four different machine learning models (Boosted Decision Trees, Neural Networks, Support Vector Machines, Self Organizing Maps) to predict the risk of lung pneumonitis in patients undergoing thoracic radiotherapy. Fusion was achieved by simple averaging of the 10-fold cross validated predictions for each patient from all four models. To reduce prediction dependence on the manner in which the data set was split, 10-fold cross-validation was repeated 100 times for random data splitting. The area under the receiver operating characteristics curve for the fused cross-validated results was 0.79, higher than the individual models and with (generally) lower variance. The fusion extracted three important features as the consensus among all four models in predicting radiation pneumonitis risk: chemotherapy prior to radiotherapy, equivalent Uniform Dose (EUD) for exponent a = 1.2 to 3, and female gender. The results show great promise for machine learning in radiotherapy outcomes modeling.","PeriodicalId":381692,"journal":{"name":"2008 Seventh International Conference on Machine Learning and Applications","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116340428","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":"Simulation Experiments with Bio-inspired Algorithms for Odor Source Localization in Laminar Wind Flow","authors":"Thomas Lochmatter, A. Martinoli","doi":"10.1109/ICMLA.2008.128","DOIUrl":"https://doi.org/10.1109/ICMLA.2008.128","url":null,"abstract":"We compare three bio-inspired odor source localization algorithm (casting, surge-spiral and surge-cast) for environments with a main wind flow in simulation. The wind flow is laminar and the simulation setup similar to the setup in the wind tunnel in which we have carried out similar experiments with real robots. The algorithms are compared in terms of success rate and distance overhead when tracking the plume up to the source. We conclude that the algorithms based on upwind surge yield significantly better performance than pure casting.","PeriodicalId":381692,"journal":{"name":"2008 Seventh International Conference on Machine Learning and Applications","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114627650","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 Comparison of Three Different Methods for Classification of Breast Cancer Data","authors":"D. Soria, J. Garibaldi, E. Biganzoli, I. Ellis","doi":"10.1109/ICMLA.2008.97","DOIUrl":"https://doi.org/10.1109/ICMLA.2008.97","url":null,"abstract":"The classification of breast cancer patients is of great importance in cancer diagnosis. During the last few years, many algorithms have been proposed for this task. In this paper, we review different supervised machine learning techniques for classification of a novel dataset and perform a methodological comparison of these. We used the C4.5 tree classifier, a multilayer perceptron and a naive Bayes classifier over a large set of tumour markers. We found good performance of the multilayer perceptron even when we reduced the number of features to be classified. We found naive Bayes achieved a competitive performance even though the assumption of normality of the data is strongly violated.","PeriodicalId":381692,"journal":{"name":"2008 Seventh International Conference on Machine Learning and Applications","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114663591","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}
A. Taktak, A. Eleuteri, M. Aung, P. Lisboa, L. Desjardins, B. Damato
{"title":"External Validation of a Bayesian Neural Network Model in Survival Analysis","authors":"A. Taktak, A. Eleuteri, M. Aung, P. Lisboa, L. Desjardins, B. Damato","doi":"10.1109/ICMLA.2008.48","DOIUrl":"https://doi.org/10.1109/ICMLA.2008.48","url":null,"abstract":"This paper describes the evaluation of a regularized Bayesian neural network model in prognostic applications. A total sample size of 5442 subjects treated with ocular melanoma in two centers; Liverpool and Paris was used to carry out external validation analysis of the model. The performance of the model was benchmarked against the traditional Cox regression model and a clinically accepted TNM staging system. The cumulative hazards curve for the neural network model was much closer to the empirical curve in the test data than the one produced by the Cox model. The neural network model showed equal performance to Cox's model in terms of discrimination. However, the neural network model was better than Cox's model in terms of calibration. The paper proposes an alternative staging system based on the model, which takes into account histopathological information. The new system has many advantages over the existing staging system.","PeriodicalId":381692,"journal":{"name":"2008 Seventh International Conference on Machine Learning and Applications","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128293178","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}
Nhien-An Le-Khac, Lamine M. Aouad, Mohand Tahar Kechadi
{"title":"Handling Large Volumes of Mined Knowledge with a Self-Reconfigurable Topology on Distributed Systems","authors":"Nhien-An Le-Khac, Lamine M. Aouad, Mohand Tahar Kechadi","doi":"10.1109/ICMLA.2008.30","DOIUrl":"https://doi.org/10.1109/ICMLA.2008.30","url":null,"abstract":"Nowadays, massive amounts of data which are often geographically distributed and owned by different organisations, are being mined. As consequence, large volumes of knowledge is being generated. This causes the problem of efficient knowledge management in distributed data mining (DDM). The main aim of is to exploit fully the benefit of distributed data analysis while minimising the communication overhead. Existing DDM techniques perform partial analysis of local data at individual sites and then generate global models by aggregating the local results. These two steps are not independent since naive approaches to local analysis may produce incorrect and ambiguous global data models. To overcome this problem, we introduce a distributed knowledge map based on an efficient self-reconfiguration network topology to represent easily and exploit efficiently the knowledge mined in large scale distributed platforms. This will also facilitate the integration/coordination of local mining processes and existing knowledge to build global models. In this paper, we implement this knowledge map and present some preliminary results about its performance.","PeriodicalId":381692,"journal":{"name":"2008 Seventh International Conference on Machine Learning and Applications","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134196169","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":"Multimodal Music Mood Classification Using Audio and Lyrics","authors":"C. Laurier, Jens Grivolla, P. Herrera","doi":"10.1109/ICMLA.2008.96","DOIUrl":"https://doi.org/10.1109/ICMLA.2008.96","url":null,"abstract":"In this paper we present a study on music mood classification using audio and lyrics information. The mood of a song is expressed by means of musical features but a relevant part also seems to be conveyed by the lyrics. We evaluate each factor independently and explore the possibility to combine both, using natural language processing and music information retrieval techniques. We show that standard distance-based methods and latent semantic analysis are able to classify the lyrics significantly better than random, but the performance is still quite inferior to that of audio-based techniques. We then introduce a method based on differences between language models that gives performances closer to audio-based classifiers. Moreover, integrating this in a multimodal system (audio+text) allows an improvement in the overall performance. We demonstrate that lyrics and audio information are complementary, and can be combined to improve a classification system.","PeriodicalId":381692,"journal":{"name":"2008 Seventh International Conference on Machine Learning and Applications","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132841656","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 Siglet Detection for Business Microscope","authors":"J. Nishimura, Nobuo Sato, T. Kuroda","doi":"10.1109/ICMLA.2008.132","DOIUrl":"https://doi.org/10.1109/ICMLA.2008.132","url":null,"abstract":"\"Business Microscope\" is our sensornet application in the age of knowledge, which visualizes knowledge workers' interactions by sensing their face-to-face communications. Due to the limitation of energy consumption of sensor nodes and privacy concerns, very short (0.1s) intermittently sensed (10s interval) noise-like signals called siglet is used to for detection task. To detect the speaker from the limited input, \"self\" vs \"others\" classification problem is introduced. For this new classification problem, new classifier called AdaBoost LVQ is studied to explore the application of AdaBoost to reduce the error rate of the conventional classifier with strictly limited inputs. As a result, AdaBoost LVQ achieved highest recognition accuracy of 96.45% with 19.86% error rate improvement relative to best conventional classifier.","PeriodicalId":381692,"journal":{"name":"2008 Seventh International Conference on Machine Learning and Applications","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127742785","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}
Volker Willert, J. Eggert, Marc Toussaint, E. Körner
{"title":"Probabilistic Exploitation of the Lucas and Kanade Smoothness Constraint","authors":"Volker Willert, J. Eggert, Marc Toussaint, E. Körner","doi":"10.1109/ICMLA.2008.54","DOIUrl":"https://doi.org/10.1109/ICMLA.2008.54","url":null,"abstract":"The basic idea of Lucas and Kanade is to constrain the local motion measurement by assuming a constant velocity within a spatial neighborhood. We reformulate this spatial constraint in a probabilistic way assuming Gaussian distributed uncertainty in spatial identification of velocity measurements and extend this idea to scale and time dimensions. Thus, we are able to combine uncertain velocity measurements observed at different image scales and positions over time. We arrive at a new recurrent optical flow filter formulated in a dynamic Bayesian network applying suitable factorisation assumptions and approximate inference techniques. The introduction of spatial uncertainty allows for a dynamic and spatially adaptive tuning of the constraining neighborhood. Here, we realize this tuning dependent on the local structure tensor of the intensity patterns of the image sequence. We demonstrate that a probabilistic combination of spatiotemporal integration and modulation of a purely local integration area improves the Lucas and Kanade estimation.","PeriodicalId":381692,"journal":{"name":"2008 Seventh International Conference on Machine Learning and Applications","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127790861","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}