{"title":"Nonlinear Kernel-Based Approaches for Predicting Normal Tissue Toxicities","authors":"I. El-Naqa, J. Bradley, J. Deasy","doi":"10.1109/ICMLA.2008.126","DOIUrl":"https://doi.org/10.1109/ICMLA.2008.126","url":null,"abstract":"Since the early demonstration of the curative potential of radiation therapy for tumor sterilization, normal tissue toxicity continues to be dose limiting. Accurate prediction of patient¿s complication risk would allow personalization of treatment planning decisions. Nonlinear kernel methods can provide a robust framework for learning complex interactions between observed toxicities and treatment, anatomical, and patient-related variables. However, proper application of these powerful methods would require better understanding of a high-dimensional feature space that is spanned by all these variables. In this work, we investigate methods for visualization of this high-dimensional space and compare different approaches for extracting discriminant features. Our preliminary results demonstrate that principle component analysis is a valuable tool for visualizing high dimensional data and for determining proper kernel type. In addition, variable selection based on resampling methods within the logistic regression framework seemed to yield improved prediction performance compared to the recursive-feature elimination method.","PeriodicalId":381692,"journal":{"name":"2008 Seventh International Conference on Machine Learning and Applications","volume":"57 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":"121982833","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":"Microarray Classification from Several Two-Gene Expression Comparisons","authors":"D. Geman, Bahman Afsari, A. Tan, D. Naiman","doi":"10.1109/ICMLA.2008.152","DOIUrl":"https://doi.org/10.1109/ICMLA.2008.152","url":null,"abstract":"We describe our contribution to the ICMLA2008 ¿Automated Micro-Array Classification Challenge¿. The design of our classifier is motivated by the special scenario encountered in molecular cancer classification based on the mRNA concentrations provided by gene microarray data. Our classifier is rank-based; it only depends on expression comparisons among selected pairs of genes. Such comparisons are invariant to most of the transformations involved in preprocessing and normalization. Every pair of genes determines a binary classifier - choose the class for which the observed ordering is most likely. Pairs are scored by maximizing accuracy. In our k-TSP (k-disjoint Top Scoring Pairs) classifier, k disjoint pairs of genes are learned from training data; the discriminant function is simply the difference in the number of votes for the two classes. This rule involves exactly 2k genes, is readily interpretable, and provides some state-of-the-art results in cancer diagnosis and prognosis for small values of k, even k=1.","PeriodicalId":381692,"journal":{"name":"2008 Seventh International Conference on Machine Learning and Applications","volume":"439 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":"114584593","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":"Segmentation of Lesions with Improved Specificity in Computer-Aided Diagnosis Using a Massive-Training Artificial Neural Network (MTANN)","authors":"Kenji Suzuki","doi":"10.1109/ICMLA.2008.112","DOIUrl":"https://doi.org/10.1109/ICMLA.2008.112","url":null,"abstract":"Segmentation of lesions plays an important role in computer-aided diagnostic (CAD) schemes, because the accuracy of segmentation affects the accuracy of the feature extraction and analysis based on segmented lesions, and therefore, the final accuracy of classification. Accurate segmentation is difficult especially for complicated patterns such as lesions overlapping or touching normal structures, low-contrast lesions, and subtle opacities. With standard segmentation methods, normal structures overlapping or touching lesions are often erroneously included in segmented regions. In addition, normal structures are often segmented erroneously as lesions. Thus, improving the specificity of segmentation methods is very important in the development of a CAD scheme. Our purpose in this study was to develop a supervised lesion segmentation method based on a massive-training artificial neural network (MTANN) filter in a CAD scheme for detection of lung nodules in CT. The MTANN filter was trained with actual nodules in CT images to segment nodules with improved specificity. With the MTANN-based segmentation method, the specificity of the segmentation was improved; thus, the overall performance of our CAD scheme was improved substantially.","PeriodicalId":381692,"journal":{"name":"2008 Seventh International Conference on Machine Learning and Applications","volume":"1 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":"128839203","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}
C. Soares, Christina S. Hamilton, L. Montgomery, J. Gilbert
{"title":"Improving Accuracy in the Montgomery County Corrections Program Using Case-Based Reasoning","authors":"C. Soares, Christina S. Hamilton, L. Montgomery, J. Gilbert","doi":"10.1109/ICMLA.2008.94","DOIUrl":"https://doi.org/10.1109/ICMLA.2008.94","url":null,"abstract":"The Montgomery county corrections program is a program designed to address the problem of overcrowded jails by providing an out-of-jail rehabilitative program as an alternative. The candidate offenders chosen for this program are offenders convicted on nonviolent charges and are currently chosen subjectively with little statistical basis. In addition, historical data has been recorded on offenders who have passed through the program, making the program a good candidate for case-based reasoning. Using such reasoning, county officials would like an objective measurement which will predict the success or failure of a candidate offender based on past offender history. The four case-based reasoning algorithms chosen for this prediction are discrete, continuous and distance weighted k-nearest neighbors and a general regression neural network (GRNN). Although all four algorithms prove to be an improvement on the current system, the GRNN performs the best, with an average accuracy rate of 68%.","PeriodicalId":381692,"journal":{"name":"2008 Seventh International Conference on Machine Learning and Applications","volume":"179 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":"130879883","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":"Highly Scalable SVM Modeling with Random Granulation for Spam Sender Detection","authors":"Yuchun Tang, Yuanchen He, S. Krasser","doi":"10.1109/ICMLA.2008.51","DOIUrl":"https://doi.org/10.1109/ICMLA.2008.51","url":null,"abstract":"Spam sender detection based on email subject data is a complex large-scale text mining task. The dataset consists of email subject lines and the corresponding IP address of the email sender. A fast and accurate classifier is desirable in such an application. In this research, a highly scalable SVM modeling method, named Granular SVM with Random granulation (GSVM-RAND), is designed. GSVM-RAND applies bootstrapping to extract a number of subsets of samples from the original training dataset. Each training subset is then projected into a feature subspace randomly selected from the original feature space. Here we call a granule such a subset of samples in such a feature subspace. A local SVM is then modeled in each granule. For a new sample, it is firstly projected into each granule in which the local SVM is fired to make a prediction. After that, all SVM predictions are aggregated by Bayesian Sum Rule for a final decision. GSVM-RAND is easy to be parallelized and hence efficient and highly scalable. GSVM-RAND is also effective by integrating a large number of weak, low-correlated local SVMs.","PeriodicalId":381692,"journal":{"name":"2008 Seventh International Conference on Machine Learning and Applications","volume":"1 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":"130752087","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 Microarray Classification Based on P-SVM Gene Selection","authors":"Johannes Mohr, Sambu Seo, K. Obermayer","doi":"10.1109/ICMLA.2008.75","DOIUrl":"https://doi.org/10.1109/ICMLA.2008.75","url":null,"abstract":"The analysis of microarray data is a challenging task for statistical and machine learning methods, since the datasets usually contain a very large number of features (genes) and only a small number of examples (subjects). In this work, we describe a technique for gene selection and classification of microarray data based on the recently proposed potential support vector machine (P-SVM) for feature selection and a nu-SVM for classification. The P-SVM expands the decision function in terms of a sparse set of \"support features\". Based on this novel technique for feature selection, we suggest a fully automated method for gene selection, hyper-parameter optimization and microarray classification. Benchmark results are given for the two datasets provided by the ICMLA'08 Automated Micro-Array Classification Challenge.","PeriodicalId":381692,"journal":{"name":"2008 Seventh International Conference on Machine Learning and Applications","volume":"10 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":"128466853","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}
Ken Ueno, Toshio Hayashi, K. Iwata, Nobuyoshi Honda, Youichi Kitahara, T. Paul
{"title":"Prioritizing Health Promotion Plans with k-Bayesian Network Classifier","authors":"Ken Ueno, Toshio Hayashi, K. Iwata, Nobuyoshi Honda, Youichi Kitahara, T. Paul","doi":"10.1109/ICMLA.2008.117","DOIUrl":"https://doi.org/10.1109/ICMLA.2008.117","url":null,"abstract":"Recently, Bayesian network classifiers (BNCs) have attracted many researchers because they can produce classification models with dependencies among attributes. From the application viewpoint, however, BNCs sometimes produce models too complicated to interpret easily. In this paper, we propose k-Bayesian network classifier (k-BNC), which is a new method to reconstruct the attribute-dependency relationship from data for health promotion planning. From the health promotion viewpoint, it would be highly advantageous if occupational physicians could make effective plans for employees, and if employees could carry out the plans easily. Therefore, we focus on the attribute dependencies in classification models represented as a directed acyclic graph (DAG), and find the effective attributes by measuring the standardized Kullback-Leibler divergence from parent attributes to their children. In experimental evaluation, we firstly compare the accuracy of k-BNC with that of Naive Bayes Classifiers, and other wellknown Bayesian Networks and structure learning methods (k2 algorithm etc.) on some public datasets. We show that our proposed k-BNC method successfully produces classification models for the prioritization of health promotion plans on our health checkup data.","PeriodicalId":381692,"journal":{"name":"2008 Seventh International Conference on Machine Learning and Applications","volume":"39 17","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113933946","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":"Development of CPT_M3D for Multiple Chemical Plume Tracing and Source Identification","authors":"Joseph E. Sutton, Wei Li","doi":"10.1109/ICMLA.2008.64","DOIUrl":"https://doi.org/10.1109/ICMLA.2008.64","url":null,"abstract":"This paper explores the developing of a graphical simulation environment for multiple chemical plume tracing and source identification. A number of classes, including a graphical display class, make up the simulation program. Because the intent is to capture and simulate real life scenarios, the program simulates significant variation of fluid flow velocity and orientation, the significant intermittency between advection fluid flow, chemical filaments, and significant meander of chemical plumes to challenge a chemical plume tracing strategy. Thus, the advection fluid flow model class, plume model classes, sensor classes, plume tracing strategy classes, and vehicle model classes were created to bring this challenge alive in a measurable, three dimensional model. The outcome is highly promising, in that it can efficiently evaluate strategies for tracing multiple plumes, identifying their sources, and can do so even in three-dimensions.","PeriodicalId":381692,"journal":{"name":"2008 Seventh International Conference on Machine Learning and Applications","volume":"117 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":"124400593","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 Bayesian Approach to Switching Linear Gaussian State-Space Models for Unsupervised Time-Series Segmentation","authors":"S. Chiappa","doi":"10.1109/ICMLA.2008.109","DOIUrl":"https://doi.org/10.1109/ICMLA.2008.109","url":null,"abstract":"Time-series segmentation in the fully unsupervised scenario in which the number of segment-types is a priori unknown is a fundamental problem in many applications. We propose a Bayesian approach to a segmentation model based on the switching linear Gaussian state-space model that enforces a sparse parametrization, such as to use only a small number of a priori available different dynamics to explain the data. This enables us to estimate the number of segment-types within the model, in contrast to previousnon-Bayesian approaches where training and comparing several separate models was required. As the resulting model is computationally intractable, we introduce a variational approximation where a reformulation of the problem enables the use of efficient inference algorithms.","PeriodicalId":381692,"journal":{"name":"2008 Seventh International Conference on Machine Learning and Applications","volume":"47 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":"121451529","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}
Shyue-Liang Wang, Ting-Zheng Lai, T. Hong, Yu-Lung Wu
{"title":"Efficient Hiding of Collaborative Recommendation Association Rules with Updates","authors":"Shyue-Liang Wang, Ting-Zheng Lai, T. Hong, Yu-Lung Wu","doi":"10.1109/ICMLA.2008.33","DOIUrl":"https://doi.org/10.1109/ICMLA.2008.33","url":null,"abstract":"We propose here an efficient data mining algorithm to hide collaborative recommendation association rules when the database is updated, i.e., when a new data set is added to the original database. For a given predicted item, a collaborative recommendation association rule set [10] is the smallest association rule set that makes the same recommendation as the entire association rule set by confidence priority. Several approaches to hide collaborative recommendation association rules from static databases have been proposed [10, 11]. However, frequent updates to the database may require repeated sanitizations of original database and added data sets. The efforts of previous sanitization are not utilized in these approaches. In this work, we propose using pattern inversion tree to store the added data set in one database scan. It is then sanitized and merged to the original sanitized database. Numerical experiments show that the proposed approach out performs the direct sanitization approach on original and added data sets, with similar side effects.","PeriodicalId":381692,"journal":{"name":"2008 Seventh International Conference on Machine Learning and Applications","volume":"11 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":"126134949","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}