{"title":"Teaching Artificial Intelligence (AI) with AI for AI applications","authors":"K. Brawner, Ning Wang, Ben Nye","doi":"10.32473/flairs.36.133388","DOIUrl":"https://doi.org/10.32473/flairs.36.133388","url":null,"abstract":"The emergence of widely-used artificial intelligence (AI) has created a critical need for AI expertise, not just as a research area but for workers in the wide variety of careers and roles that AI disrupts. While AI is still an area of research for new processing, application, and development – it continues to partially automate, augment, or replace many of the tasks which are performed through active use of human hands. While recently publicized items such as ChatGPT and MidJourney have made press in their adjustment to writing and image generation technology, the basic workflow of copyeditors and digital artists was completely transformed, inside of the year, to a combination of partially automated or fully automated AI tasks. While some blame AI as part of the “problem”, it is naturally part of the “solution” – AI tools to help workers develop AI competencies. The paper describes an array of strategies which the DoD and its ICT UARC are using to address the fundamental problem of quickly upskilling the DoD workforce of over 2 million adult learners.","PeriodicalId":302103,"journal":{"name":"The International FLAIRS Conference Proceedings","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115310191","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":"CyberReco: ~Cybersecurity Workforce Readiness Recommender System","authors":"Ramoni O. Lasisi","doi":"10.32473/flairs.36.133305","DOIUrl":"https://doi.org/10.32473/flairs.36.133305","url":null,"abstract":"Using the United States National Initiative for Cybersecurity Education framework as a guide, we propose CyberReco - Cybersecurity Workforce Readiness Recommender System, an AI/ML model that attempts to address readiness gaps needed to prepare users lacking in some cybersecurity knowledge, skills, and activities to be workforce-ready. CyberReco is built using natural language processing. We present a hierarchical-based framework that is composed of four components including, text preparation and normalization, keywords extraction and processing, similarity scores and skills computation, and a recommender component.","PeriodicalId":302103,"journal":{"name":"The International FLAIRS Conference Proceedings","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127453779","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":"Similarity-Based Retrieval in Process-Oriented Case-Based Reasoning Using Graph Neural Networks and Transfer Learning","authors":"Johannes Pauli, Maximilian Hoffmann, R. Bergmann","doi":"10.32473/flairs.36.133040","DOIUrl":"https://doi.org/10.32473/flairs.36.133040","url":null,"abstract":"Similarity-based retrieval of semantic graphs is a crucial task of Process-Oriented Case-Based Reasoning (POCBR) that is usually complex and time-consuming, as it requires some kind of inexact graph matching. Previous work tackles this problem by using Graph Neural Networks (GNNs) to learn pairwise graph similarities. In this paper, we present a novel approach that improves on the GNN-based case retrieval with a Transfer Learning (TL) setup, composed of two phases: First, the pretraining phase trains a model for assessing the similarities between graph nodes and edges and their semantic annotations. Second, the pretrained model is then integrated into the GNN model by either using fine-tuning, i.e., the parameters of the pretrained model are further trained, or feature extraction, i.e., the parameters of the pretrained model are converted to constants. The experimental evaluation examines the quality and performance of the models based on TL compared to the GNN models from previous work for three semantic graph domains with various properties. The results show the great potential of the proposed approach for reducing the similarity prediction error and the training time.","PeriodicalId":302103,"journal":{"name":"The International FLAIRS Conference Proceedings","volume":"168 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115178582","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":"Comparing Statistical Models for Retrieval based Question-answering Dialogue: BERT vs Relevance Models","authors":"Debaditya Pal, A. Leuski, D. Traum","doi":"10.32473/flairs.36.133386","DOIUrl":"https://doi.org/10.32473/flairs.36.133386","url":null,"abstract":"In this paper, we compare the performance of four models in a retrieval based question answering dialogue task on two moderately sized corpora (~ 10,000 utterances). One model is a statistical model and uses cross language relevance while the others are deep neural networks utilizing the BERT architecture along with different retrieval methods. The statistical model has previously outperformed LSTM based neural networks in a similar task whereas BERT has been proven to perform well on a variety of NLP tasks, achieving state-of-the-art results in many of them. Results show that the statistical cross language relevance model outperforms the BERT based architectures in learning question-answer mappings. BERT achieves better results by mapping new questions to existing questions.","PeriodicalId":302103,"journal":{"name":"The International FLAIRS Conference Proceedings","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116059050","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":"On Bounding the Behavior of a Neuron","authors":"Richard Borowski, Arthur Choi","doi":"10.32473/flairs.36.133336","DOIUrl":"https://doi.org/10.32473/flairs.36.133336","url":null,"abstract":"A neuron with binary inputs and a binary output represents a Boolean function. Our goal is to extract this Boolean function into a tractable representation that will facilitate the explanation and formal verification of a neuron's behavior. Unfortunately, extracting a neuron's Boolean function is in general an NP-hard problem. However, it was recently shown that prime implicants of this Boolean function can be enumerated efficiently, with only polynomial time delay. Building on this result, we propose a best-first search algorithm that is able to incrementally tighten inner and outer bounds of a neuron's Boolean function. These bounds correspond to truncated prime-implicant covers of the Boolean function. We provide two case studies that highlight our ability to bound the behavior of a neuron.","PeriodicalId":302103,"journal":{"name":"The International FLAIRS Conference Proceedings","volume":"290 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128590275","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}
Mateo Gannod, Nicholas M. Masto, Collins Owusu, Cory J. Highway, Katherine E. Brown, Abigail G. Blake‐Bradshaw, Jamie C. Feddersen, H. Hagy, Douglas A. Talbert, Bradley Cohen
{"title":"Semantic Segmentation with Multispectral Satellite Images of Waterfowl Habitat","authors":"Mateo Gannod, Nicholas M. Masto, Collins Owusu, Cory J. Highway, Katherine E. Brown, Abigail G. Blake‐Bradshaw, Jamie C. Feddersen, H. Hagy, Douglas A. Talbert, Bradley Cohen","doi":"10.32473/flairs.36.133331","DOIUrl":"https://doi.org/10.32473/flairs.36.133331","url":null,"abstract":"\u0000 \u0000 \u0000Migratory waterfowl (i.e., ducks, geese, and swans) management relies on landscape bioenergetic models to inform on-the-ground habitat conditions and conservation practices. Therefore, conservation planners rely on accurate predictions of wetland habitats for waterfowl at regional scales. Unharvested flooded corn is a popular management tool on public and private lands that greatly increases landscape-level energy compared to other wetlands; thus, landscape bioenergetic models are particularly sensitive to these habitat features. Despite their importance to conservation planning and implementation, the abundance and distribution of unharvested flooded corn fields across North America is unknown. Furthermore, training data is difficult to collect and accurate predictions are challenging given their unique attributes and discreteness at landscape-level lens. Advances in multispectral imagery and deep learning algorithms may enable continuous and autonomous detection of these habitat features. Therefore, we conducted modeling experiments using training data of unharvested flooded corn fields in West Tennessee and multispectral imagery collected from Sentinel-2 satellite missions. We performed several experiments using individual band combination composites and/or vegetation indices to identify optimal bands using MRUNET architectures. We subsequently used 3 ensemble models of important individual networks. We found the use of multispectral bands was necessary and although the CIR composite and OSAVI index improved precision, the 12-band composite increased recall, the metric we were most interested in. Moreover, all ensembles exhibited poor performance. Here, we present results of our initial modeling experiments and suggest future modeling exercises including temporal image and vegetation index stacking using multi-modal and/or recurrent neural network architectures. \u0000 \u0000 \u0000","PeriodicalId":302103,"journal":{"name":"The International FLAIRS Conference Proceedings","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124233568","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 Q-Learning Proposal for Tuning Genetic Algorithms in Flexible Job Shop Scheduling Problems","authors":"Christian Pérez, Carlos March, M. Salido","doi":"10.32473/flairs.36.133366","DOIUrl":"https://doi.org/10.32473/flairs.36.133366","url":null,"abstract":"Genetic algorithms (GAs) belong to the category of evolutionary algorithms and are frequently utilized for resolving challenging combinatorial problems. However, they typically require customization to suit a particular problem type, and their performance is heavily influenced by numerous hyperparameters and reproduction operators. In this work, we propose a Reinforcement Learning approach for fine-tuning Genetic Algorithms in Flexible Job Shop Scheduling problems (FJSP), where the main parameters involved in the genetic algorithm operators are trained to allocate the most promising values. The approach returns an optimized schedule taking into account given constraints specific to the scenario, such as the relationship among release date, due date, and processing time, which machines must be selected out of a set of alternative machines, or which sequence-dependent setup time can be filtered. \u0000The approach takes input data in the form of FJSP instances by varying the numbers of jobs and machines and then uses the NSGA-II algorithm to generate solutions. These solutions are stored in a Solutions module and they are analyzed using a Principal components analysis (PCA) to identify clusters of similar instances and solutions. The Q-Learning module then generates hyperparameters for each iteration of the NSGA-II algorithm based on information from the previous modules. A toy example is presented to better understand the behavior of the proposal and the results obtained for optimizing further instances of the problem in a more efficient way.","PeriodicalId":302103,"journal":{"name":"The International FLAIRS Conference Proceedings","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126557099","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 Comparative Study of Imputation Methods for Time Series Data","authors":"D. Khan, A. Lazar","doi":"10.32473/flairs.36.133068","DOIUrl":"https://doi.org/10.32473/flairs.36.133068","url":null,"abstract":"Missing and incomplete values pose a significant challenge in analyzing tabular and time-series data. Dealing with missing values is time-consuming and tedious, especially when working with data from real-world applications. While some imputation approaches estimate missing values based on existing observations, these methods often rely on strong assumptions about the data distribution, which only sometimes improves downstream accuracy. Although tabular imputation methods can be applied to time-series data, incorporating the time component can enhance accuracy. This study evaluates various techniques for missing data imputation in time-series data. We run experiments on four multi-variate time series datasets using five imputation methods. We report training time and testing accuracy.","PeriodicalId":302103,"journal":{"name":"The International FLAIRS Conference Proceedings","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128053686","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}
Jeevan Chapagain, Zak Risha, Rabin Banjade, P. Oli, L. Tamang, Peter Brusilovsky, V. Rus
{"title":"SelfCode: An Annotated Corpus and a Model for Automated Assessment of Self-Explanation During Source Code Comprehension","authors":"Jeevan Chapagain, Zak Risha, Rabin Banjade, P. Oli, L. Tamang, Peter Brusilovsky, V. Rus","doi":"10.32473/flairs.36.133385","DOIUrl":"https://doi.org/10.32473/flairs.36.133385","url":null,"abstract":"The ability to automatically assess learners' activities is the key to user modeling and personalization in adaptive educational systems.The work presented in this paper opens an opportunity to expand the scope of automated assessment from traditional programming problems to code comprehension tasks where students are requested to explain the critical steps of a program. The ability to automatically assess these self-explanations offers a unique opportunity to understand the current state of student knowledge, recognize possible misconceptions, and provide feedback. Annotated datasets are needed to train Artificial Intelligence/Machine Learning approaches for the automated assessment of student explanations. To answer this need, we present a novel corpus called SelfCode which consists of 1,770 sentence pairs of student and expert self-explanations of Java code examples, along with semantic similarity judgments provided by experts. We also present a baseline automated assessment model that relies on textual features. The corpus is available at the GitHub repository (https://github.com/jeevanchaps/SelfCode).","PeriodicalId":302103,"journal":{"name":"The International FLAIRS Conference Proceedings","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125767134","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}
Zainab Albujasim, D. Inkpen, Xuejun Han, Yuhong Guo
{"title":"Improving Word Embedding Using Variational Dropout","authors":"Zainab Albujasim, D. Inkpen, Xuejun Han, Yuhong Guo","doi":"10.32473/flairs.36.133326","DOIUrl":"https://doi.org/10.32473/flairs.36.133326","url":null,"abstract":"Pre-trained word embeddings are essential in natural language processing (NLP). In recent years, many post-processing algorithms have been proposed to improve the pre-trained word embeddings. We present a novel method - Orthogonal Auto Encoder with Variational Dropout (OAEVD) for improving word embeddings based on orthogonal autoencoders and variational dropout. Specifically, the orthogonality constraint encourages more diversity in the latent space and increases semantic similarities between similar words, and variational dropout makes it more robust to overfitting. Empirical evaluation on a range of downstream NLP tasks, including semantic similarity, text classification, and concept categorization shows that our proposed method effectively improves the quality of pre-trained word embeddings. Moreover, the proposed method successfully reduces the dimensionality of pre-trained word embeddings while maintaining high performance.","PeriodicalId":302103,"journal":{"name":"The International FLAIRS Conference Proceedings","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121621244","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}