{"title":"Identifying Relation-gaps in Ontologies using TOPSIS","authors":"S. Subhashree, P. S. Kumar","doi":"10.32473/flairs.v35i.130605","DOIUrl":"https://doi.org/10.32473/flairs.v35i.130605","url":null,"abstract":"","PeriodicalId":88964,"journal":{"name":"Proceedings of the ... International Florida AI Research Society Conference. Florida AI Research Symposium","volume":"110 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88656425","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}
Aleksander Obuchowski, Barbara Klaudel, Roman Karski, Bartosz Rydziński, Mateusz Glembin, Paweł Syty, P. Jasik
{"title":"ColorNephroNet: Kidney tumor malignancy prediction using medical image colorization","authors":"Aleksander Obuchowski, Barbara Klaudel, Roman Karski, Bartosz Rydziński, Mateusz Glembin, Paweł Syty, P. Jasik","doi":"10.32473/flairs.v35i.130689","DOIUrl":"https://doi.org/10.32473/flairs.v35i.130689","url":null,"abstract":"Renal tumor malignancy classification is one of the cru- cial tasks in urology, being a primary factor included in the decision of whether to perform kidney removal surgery (nephrectomy) or not. Currently, tumor malignancy prediction is determined by the radiological di- agnosis based on computed tomography (CT) images. However, it is estimated that up to 16% of nephrec- tomies could have been avoided because the tumor that had been diagnosed as malignant, was found to be be- nign in the postoperative histopathological examination. The excess of false-positive diagnoses results in unnec- essarily performed nephrectomies that carry the risk of periprocedural complications. In this paper, we present a machine-aided diagnosis system that predicts the tumor malignancy based on a CT image. The prediction is performed after radiological diagnosis and is used to capture false-positive diagnoses. Our solution is able to achieve a 0.84 F1-score in this task. We also propose a novel approach to knowledge transfer in the medical do- main in terms of colorization based pre-processing that is able to increase the F1-score by up to 1.8pp.","PeriodicalId":88964,"journal":{"name":"Proceedings of the ... International Florida AI Research Society Conference. Florida AI Research Symposium","volume":"66 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89636164","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}
Joseph Allen, Xudong Liu, K. Umapathy, S. Reddivari
{"title":"Clustering Partial Lexicographic Preference Trees","authors":"Joseph Allen, Xudong Liu, K. Umapathy, S. Reddivari","doi":"10.1609/aaai.v35i18.17872","DOIUrl":"https://doi.org/10.1609/aaai.v35i18.17872","url":null,"abstract":"In this work, we consider distance-based clustering of partial lexicographic\u0000preference trees (PLP-trees), intuitive and compact graphical representations \u0000of user preferences over multi-valued attributes. To compute distances between \u0000PLP-trees, we propose a polynomial time algorithm that computes Kendall's \u0000Tau distance directly from the trees and show its efficacy compared to the \u0000brute-force algorithm. To this end, we implement several clustering methods \u0000(i.e., spectral clustering, affinity propagation, and agglomerative nesting) \u0000augmented by our distance algorithm, experiment with clustering of up to 10,000 \u0000PLP-trees, and show the effectiveness of the clustering methods and visualizations \u0000of their results.","PeriodicalId":88964,"journal":{"name":"Proceedings of the ... International Florida AI Research Society Conference. Florida AI Research Symposium","volume":"38 1","pages":"172-175"},"PeriodicalIF":0.0,"publicationDate":"2021-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83317629","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":"Partial (Neighbourhood) Singleton Arc Consistency for Constraint Satisfaction Problems","authors":"R. Wallace","doi":"10.3233/FI-2020-1944","DOIUrl":"https://doi.org/10.3233/FI-2020-1944","url":null,"abstract":"Algorithms based on singleton arc consistency (SAC) show considerable promise for improving backtrack search algorithms for constraint satisfaction problems (CSPs). The drawback is that even the most efficient of them is still comparatively expensive. Even when limited to preprocessing, they give overall improvement only when problems are quite difficult to solve with more typical procedures such as maintained arc consistency (MAC). The present work examines a form of partial SAC and neighbourhood SAC (NSAC) in which a subset of the variables in a CSP are chosen to be made SAC-consistent or neighbourhood-SAC-consistent. Such consistencies, despite their partial character, are still well-characterized in that algorithms have unique fixpoints. Heuristic strategies for choosing an effective subset of variables are described and tested, the best being choice by highest degree and a more complex strategy of choosing by constraint weight after random probing. Experimental results justify the claim that these methods can be nearly as effective as the corresponding full version of the algorithm in terms of values discarded or problems proven unsatisfiable, while significantly reducing the effort required to achieve this.","PeriodicalId":88964,"journal":{"name":"Proceedings of the ... International Florida AI Research Society Conference. Florida AI Research Symposium","volume":"86 1","pages":"140-145"},"PeriodicalIF":0.0,"publicationDate":"2020-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80990642","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}
Chan Hee Song, Dawn J Lawrie, Tim Finin, J. Mayfield
{"title":"Gazetteer Generation for Neural Named Entity Recognition","authors":"Chan Hee Song, Dawn J Lawrie, Tim Finin, J. Mayfield","doi":"10.13016/M2HPFL-WYOV","DOIUrl":"https://doi.org/10.13016/M2HPFL-WYOV","url":null,"abstract":"We present a way to generate gazetteers from the Wikidata knowledge graph and use the lists to improve a neural NER system by adding an input feature indicating that a word is part of a name in the gazetteer. We empirically show that the approach yields performance gains in two distinct languages: a high-resource, word-based language, English and a high-resource, character-based language, Chinese. We apply the approach to a low-resource language, Russian, using a new annotated Russian NER corpus from Reddit tagged with four core and eleven extended types, and show a baseline score.","PeriodicalId":88964,"journal":{"name":"Proceedings of the ... International Florida AI Research Society Conference. Florida AI Research Symposium","volume":"65 3 1","pages":"298-302"},"PeriodicalIF":0.0,"publicationDate":"2020-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86382471","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":"Representation of Indifference and Preference Ordering Between Random Variables by Coherent Upper and Lower Conditional Previsions Defined by Hausdorff Outer and Inner Measures","authors":"S. Doria","doi":"10.1007/978-3-642-15956-5_9","DOIUrl":"https://doi.org/10.1007/978-3-642-15956-5_9","url":null,"abstract":"","PeriodicalId":88964,"journal":{"name":"Proceedings of the ... International Florida AI Research Society Conference. Florida AI Research Symposium","volume":"14 1","pages":"613-616"},"PeriodicalIF":0.0,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77994237","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":"Active Learning of Multi-Class Classifiers with Auxiliary Probabilistic Information.","authors":"Yanbing Xue, Milos Hauskrecht","doi":"","DOIUrl":"","url":null,"abstract":"<p><p>Our ability to learn accurate classification models from data is often limited by the number of available data instances. This limitation is of particular concern when data instances need to be labeled by humans and when the labeling process carries a significant cost. Recent years witnessed increased research interest in developing methods capable of learning models from a smaller number of examples. One such direction is active learning. Another, more recent direction showing a great promise utilizes auxiliary probabilistic information in addition to class labels. However, this direction has been applied and tested only in binary classification settings. In this work we first develop a multi-class variant of the auxiliary probabilistic approach, and after that embed it within an active learning framework, effectively combining two strategies for reducing the dependency of multi-class classification learning on the number of labeled examples. We demonstrate the effectiveness of our new approach on both simulated and real-world datasets.</p>","PeriodicalId":88964,"journal":{"name":"Proceedings of the ... International Florida AI Research Society Conference. Florida AI Research Symposium","volume":"2018 ","pages":"158-163"},"PeriodicalIF":0.0,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6364859/pdf/nihms967723.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"36544155","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Multivariate Conditional Outlier Detection: Identifying Unusual Input-Output Associations in Data.","authors":"Charmgil Hong, Milos Hauskrecht","doi":"","DOIUrl":"","url":null,"abstract":"<p><p>We study <i>multivariate conditional outlier detection</i>, a special type of the conditional outlier detection problem, where data instances consist of continuous input (context) and binary output (responses) vectors. We present a novel outlier detection framework that identifies abnormal input-output associations in data using a decomposable conditional probabilistic model. Since the components of this model can vary in their quality, we combine them with the help of weights reflecting their reliability in assessment of outliers. We propose two ways of calculating the component weights: <i>global</i> that relies on all data and <i>local</i> that relies only on the instances similar to the target instance. Experimental results on data from various domains demonstrate the ability of our framework to successfully identify multivariate conditional outliers.</p>","PeriodicalId":88964,"journal":{"name":"Proceedings of the ... International Florida AI Research Society Conference. Florida AI Research Symposium","volume":"2018 ","pages":"176-179"},"PeriodicalIF":0.0,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6364855/pdf/nihms967728.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"36544156","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Group-Based Active Learning of Classification Models.","authors":"Zhipeng Luo, Milos Hauskrecht","doi":"","DOIUrl":"","url":null,"abstract":"<p><p>Learning of classification models from real-world data often requires additional human expert effort to annotate the data. However, this process can be rather costly and finding ways of reducing the human annotation effort is critical for this task. The objective of this paper is to develop and study new ways of providing human feedback for efficient learning of classification models by labeling groups of examples. Briefly, unlike traditional active learning methods that seek feedback on individual examples, we develop a new group-based active learning framework that solicits label information on groups of multiple examples. In order to describe groups in a user-friendly way, conjunctive patterns are used to compactly represent groups. Our empirical study on 12 UCI data sets demonstrates the advantages and superiority of our approach over both classic instance-based active learning work, as well as existing group-based active-learning methods.</p>","PeriodicalId":88964,"journal":{"name":"Proceedings of the ... International Florida AI Research Society Conference. Florida AI Research Symposium","volume":"2017 ","pages":"92-97"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5512732/pdf/nihms873703.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"35184451","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Efficient Learning of Classification Models from Soft-label Information by Binning and Ranking.","authors":"Yanbing Xue, Milos Hauskrecht","doi":"","DOIUrl":"","url":null,"abstract":"<p><p>Construction of classification models from data in practice often requires additional human effort to annotate (label) observed data instances. However, this annotation effort may often be too costly and only a limited number of data instances may be feasibly labeled. The challenge is to find methods that let us reduce the number of the labeled instances but at the same time preserve the quality of the learned models. In this paper we study the idea of learning classification from soft label information in which each instance is associated with a soft-label further refining its class label. One caveat of applying this idea is that soft-labels based on human assessment are often noisy. To address this problem, we develop and test a new classification model learning algorithm that relies on soft-label binning to limit the effect of soft-label noise. We show this approach is able to learn classification models more rapidly and with a smaller number of labeled instances than (1) existing soft label learning methods, as well as, (2) methods that learn from class-label information.</p>","PeriodicalId":88964,"journal":{"name":"Proceedings of the ... International Florida AI Research Society Conference. Florida AI Research Symposium","volume":"2017 ","pages":"164-169"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5512716/pdf/nihms873697.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"35184452","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}