Charalampos Chelmis
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Charalampos Chelmis has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Daphney-Stavroula Zois
Department of Electrical and Computer Engineering, University at Albany, State University of New York, Albany, NY, USA
9 shared publications - Viktor Prasanna
University of Southern California
4 shared publications - Yasitha Warahena Liyanage
Department of Electrical and Computer Engineering, University at Albany, Albany, NY, USA
4 shared publications - Khandker Sadia Rahman
Department of Computer Science, University at Albany, SUNY, Albany, USA
3 shared publications - Bedirhan Gergin
University at Albany, SUNY
2 shared publications - Mengfan Yao
State University of New York at Albany, Albany, USA
2 shared publications
Latest Publications
- 13 August 2025
- Published by Springer Nature in Journal of Computational Social Science
- Vol. 8 (4) , 1-23
Improving homeless service assignment outcomes
- 13 August 2025
- Published by Springer Nature in Journal of Computational Social Science
- Vol. 8 (4) , 1-23
Improving homeless service assignment outcomes
- 27 November 2024
- Published by Springer Nature
- p. 3-19
SparkKG-ML: A Library to Facilitate End–to–End Large–Scale Machine Learning Over Knowledge Graphs in Python
- 27 November 2024
- Published by Springer Nature
- p. 3-19
SparkKG-ML: A Library to Facilitate End–to–End Large–Scale Machine Learning Over Knowledge Graphs in Python
- 20 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Artificial Intelligence
- Vol. 5 (6) , 2663-2677
Sequential Datum-wise Feature Acquisition and Classifier Selection
We present a supervised machine learning framework for sequential datum–wise feature acquisition and classifier selection. The presented method sequentially acquires features during testing until it determines that additional features will not improve label assignment. At that stage, easy–to–classify examples are handled by a simple classifier, which assigns labels based on the lowest expected misclassification cost. On the contrary, difficult–to–classify examples are assigned a label using the acquired features along with one of a number of available complex classifiers. As more features are acquired, the presented framework continually assesses the difficulty of classifying each example. It controls both the feature acquisition and classifier selection processes through a carefully constructed optimization problem. We use eleven publicly available datasets to evaluate the presented framework with respect to accuracy and average number of acquired features, and obtain results when two and three complex classifiers are available, respectively. We compare the performance of the presented framework with both sequential feature aquisition methods and dynamic classifier selection methods, and observe improvements in accuracy as well as acquisition of less number of features on average. Moreover, we conduct experiments with popular ensemble classification methods and assess the performance of the proposed framework.
- 20 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Artificial Intelligence
- Vol. 5 (6) , 2663-2677
Sequential Datum-wise Feature Acquisition and Classifier Selection
We present a supervised machine learning framework for sequential datum–wise feature acquisition and classifier selection. The presented method sequentially acquires features during testing until it determines that additional features will not improve label assignment. At that stage, easy–to–classify examples are handled by a simple classifier, which assigns labels based on the lowest expected misclassification cost. On the contrary, difficult–to–classify examples are assigned a label using the acquired features along with one of a number of available complex classifiers. As more features are acquired, the presented framework continually assesses the difficulty of classifying each example. It controls both the feature acquisition and classifier selection processes through a carefully constructed optimization problem. We use eleven publicly available datasets to evaluate the presented framework with respect to accuracy and average number of acquired features, and obtain results when two and three complex classifiers are available, respectively. We compare the performance of the presented framework with both sequential feature aquisition methods and dynamic classifier selection methods, and observe improvements in accuracy as well as acquisition of less number of features on average. Moreover, we conduct experiments with popular ensemble classification methods and assess the performance of the proposed framework.
- 14 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 11 (2) , 2703-2712
Why Do Some Homeless Succeed While Others Falter? A Network Science Perspective
Homelessness, a long-standing societal problem, appears to be on the rise, fueled in part by the Covid-19 pandemic. Looking at the homelessness system as a network of interconnected services which individuals traverse over time, we seek to shed light on their progression toward securing stable housing. We formalize the concept of stability upon exit and show that regardless of starting conditions, the ultimate goal is either reached quickly or not at all, indicating the importance of addressing the homeless’ needs early on to avoid them “giving up.” To better understand the causes that may contribute to positive outcomes for certain individuals versus others, we computationally analyze their pathways through the network of homeless services. We confirm the intuition that some individuals face more challenges than others based on their initial living conditions and initial placement to homelessness services. At the same time, we discover that simple signals can act as good indicators of individuals at risk of “falling through the cracks.” Being able to predict such outcomes is critical to design assistive technology that can retain individuals who would otherwise falter.
- 14 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 11 (2) , 2703-2712
Why Do Some Homeless Succeed While Others Falter? A Network Science Perspective
Homelessness, a long-standing societal problem, appears to be on the rise, fueled in part by the Covid-19 pandemic. Looking at the homelessness system as a network of interconnected services which individuals traverse over time, we seek to shed light on their progression toward securing stable housing. We formalize the concept of stability upon exit and show that regardless of starting conditions, the ultimate goal is either reached quickly or not at all, indicating the importance of addressing the homeless’ needs early on to avoid them “giving up.” To better understand the causes that may contribute to positive outcomes for certain individuals versus others, we computationally analyze their pathways through the network of homeless services. We confirm the intuition that some individuals face more challenges than others based on their initial living conditions and initial placement to homelessness services. At the same time, we discover that simple signals can act as good indicators of individuals at risk of “falling through the cracks.” Being able to predict such outcomes is critical to design assistive technology that can retain individuals who would otherwise falter.
- Open Access
- 2 June 2023
- Published by Association for the Advancement of Artificial Intelligence (AAAI) in Proceedings of the International AAAI Conference on Web and Social Media
- Vol. 17, 95-102
Recipe Networks and the Principles of Healthy Food on the Web
People increasingly use the Internet to make food-related choices, prompting research on food recommendation systems. Recently, works that incorporate nutritional constraints into the recommendation process have been proposed to promote healthier recipes. Ingredient substitution is also used, particularly by people motivated to reduce the intake of a specific nutrient or in order to avoid a particular category of ingredients due for instance to allergies. This study takes a complementary approach towards empowering people to make healthier food choices by simplifying the process of identifying plausible recipe substitutions. To achieve this goal, this work constructs a large-scale network of similar recipes, and analyzes this network to reveal interesting properties that have important implications to the development of food recommendation systems.
- 2 June 2023
- Published by Association for the Advancement of Artificial Intelligence (AAAI) in Proceedings of the International AAAI Conference on Web and Social Media
- Vol. 17, 95-102
Open AccessRecipe Networks and the Principles of Healthy Food on the Web
People increasingly use the Internet to make food-related choices, prompting research on food recommendation systems. Recently, works that incorporate nutritional constraints into the recommendation process have been proposed to promote healthier recipes. Ingredient substitution is also used, particularly by people motivated to reduce the intake of a specific nutrient or in order to avoid a particular category of ingredients due for instance to allergies. This study takes a complementary approach towards empowering people to make healthier food choices by simplifying the process of identifying plausible recipe substitutions. To achieve this goal, this work constructs a large-scale network of similar recipes, and analyzes this network to reveal interesting properties that have important implications to the development of food recommendation systems.
- 1 May 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Artificial Intelligence
- Vol. 5 (2) , 763-775
Noisy Label Detection and Counterfactual Correction
Data quality is of paramount importance to the training of any machine learning model. Recently proposed approaches for noisy learning focus on detecting noisy labeled data instances by using a fixed loss value threshold and excluding detected noisy data instances in subsequent training steps. However, a predefined, fixed loss value threshold may not be optimal for detecting noisy labeled data, whereas excluding the detected noisy data instances can reduce the size of the training set to such an extend that accuracy can be negatively affected. In this article, we propose N oisy label D etection and C ounterfactual C orrection (NDCC), a new approach that automatically selects a loss value threshold to identify noisy labeled data instances, and uses counterfactual learning to correct the noisy labels. To the best of our knowledge, NDCC is the first work to explore the use of counterfactual learning in the noisy learning domain. We demonstrate the performance of NDCC on several datasets under a variety of label noise environments. Experimental results show the superiority of the proposed approach compared to the state–of–the–art, especially in the presence of severe label noise.
- 1 May 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Artificial Intelligence
- Vol. 5 (2) , 763-775
Noisy Label Detection and Counterfactual Correction
Data quality is of paramount importance to the training of any machine learning model. Recently proposed approaches for noisy learning focus on detecting noisy labeled data instances by using a fixed loss value threshold and excluding detected noisy data instances in subsequent training steps. However, a predefined, fixed loss value threshold may not be optimal for detecting noisy labeled data, whereas excluding the detected noisy data instances can reduce the size of the training set to such an extend that accuracy can be negatively affected. In this article, we propose N oisy label D etection and C ounterfactual C orrection (NDCC), a new approach that automatically selects a loss value threshold to identify noisy labeled data instances, and uses counterfactual learning to correct the noisy labels. To the best of our knowledge, NDCC is the first work to explore the use of counterfactual learning in the noisy learning domain. We demonstrate the performance of NDCC on several datasets under a variety of label noise environments. Experimental results show the superiority of the proposed approach compared to the state–of–the–art, especially in the presence of severe label noise.
- 25 April 2023
- Published by Springer Nature in Social Network Analysis and Mining
- Vol. 13 (1) , 1-18
Modeling and predicting individual transitions within the homelessness system
- 25 April 2023
- Published by Springer Nature in Social Network Analysis and Mining
- Vol. 13 (1) , 1-18
Modeling and predicting individual transitions within the homelessness system
- 10 December 2022
- Published by Springer Nature in Journal of Computational Social Science
- Vol. 6 (1) , 59-89
Evaluating algorithmic homeless service allocation
- 10 December 2022
- Published by Springer Nature in Journal of Computational Social Science
- Vol. 6 (1) , 59-89
Evaluating algorithmic homeless service allocation
- 3 July 2022
- Published by Taylor & Francis in Journal of Community Practice
- Vol. 30 (3) , 319-331
Community-engaged technology development for bridging service users and service providers: lessons from the field
This article shares the experiences and lessons learned from a community project that aims to develop a technology-based solution to improve communications between service users and service providers. Through this multi-year project in the Capital District of New York State, a team of social workers and engineers created a mobile app prototype based on the feedback from the community. This case study shares insights for conceptualizing various phases of community engagement as well as for recruiting multiple groups of stakeholders in the process of creating a collective vision for technology development.
- 3 July 2022
- Published by Taylor & Francis in Journal of Community Practice
- Vol. 30 (3) , 319-331
Community-engaged technology development for bridging service users and service providers: lessons from the field
This article shares the experiences and lessons learned from a community project that aims to develop a technology-based solution to improve communications between service users and service providers. Through this multi-year project in the Capital District of New York State, a team of social workers and engineers created a mobile app prototype based on the feedback from the community. This case study shares insights for conceptualizing various phases of community engagement as well as for recruiting multiple groups of stakeholders in the process of creating a collective vision for technology development.
- 8 September 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Artificial Intelligence
- Vol. 2 (6) , 537-548
Dynamic Instance-Wise Classification in Correlated Feature Spaces
In a typical supervised machine learning setting, the predictions on all test instances are based on a common subset of features discovered during model training. However, using a different subset of features that is most informative for each test instance individually may improve not only the prediction accuracy but also the overall interpretability of the model. At the same time, feature selection methods for classification have been known to be the most effective when many features are irrelevant and/or uncorrelated. In fact, feature selection ignoring correlations between features can lead to poor classification performance. In this work, a Bayesian network is utilized to model feature dependencies. Using the dependence network, a new method is proposed that sequentially selects the best feature to evaluate for each test instance individually and stops the selection process to make a prediction once it determines that no further improvement can be achieved with respect to classification accuracy. The optimum number of features to acquire and the optimum classification strategy are derived for each test instance. The theoretical properties of the optimum solution are analyzed, and a new algorithm is proposed that takes advantage of these properties to implement a robust and scalable solution for high-dimensional settings. The effectiveness, generalizability, and scalability of the proposed method are illustrated on a variety of real-world datasets from diverse application domains. Impact statement— The ability to rationalize which features to use to classify each data instance is of paramount importance in a wide range of application domains, including but not limited to medicine, criminal justice, and cybersecurity. Correlations between features, and the need for variable selection at the same stage as classification, in such application domains present additional challenges to machine learning related to classification accuracy and computationally intractability. The proposed framework presents, to the best of our knowledge, the first practical solution that balances between classification accuracy and sparsity at the instance level, by dynamically choosing the most informative features, relative to each instance, from a set of potentially correlated features, for classifying each individual instance. The proposed framework achieves reductions up to 82% in the average number of features used by state-of-the-art methods without sacrificing accuracy and is robust for up to 10% of missing features. Broad positive societal implications include: fast, accurate, and cost-efficient inference in complex dynamic settings; and ease of interpretation of and trust in machine learning outcomes by domain experts (e.g., doctors and lawyers).
- 8 September 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Artificial Intelligence
- Vol. 2 (6) , 537-548
Dynamic Instance-Wise Classification in Correlated Feature Spaces
In a typical supervised machine learning setting, the predictions on all test instances are based on a common subset of features discovered during model training. However, using a different subset of features that is most informative for each test instance individually may improve not only the prediction accuracy but also the overall interpretability of the model. At the same time, feature selection methods for classification have been known to be the most effective when many features are irrelevant and/or uncorrelated. In fact, feature selection ignoring correlations between features can lead to poor classification performance. In this work, a Bayesian network is utilized to model feature dependencies. Using the dependence network, a new method is proposed that sequentially selects the best feature to evaluate for each test instance individually and stops the selection process to make a prediction once it determines that no further improvement can be achieved with respect to classification accuracy. The optimum number of features to acquire and the optimum classification strategy are derived for each test instance. The theoretical properties of the optimum solution are analyzed, and a new algorithm is proposed that takes advantage of these properties to implement a robust and scalable solution for high-dimensional settings. The effectiveness, generalizability, and scalability of the proposed method are illustrated on a variety of real-world datasets from diverse application domains. Impact statement— The ability to rationalize which features to use to classify each data instance is of paramount importance in a wide range of application domains, including but not limited to medicine, criminal justice, and cybersecurity. Correlations between features, and the need for variable selection at the same stage as classification, in such application domains present additional challenges to machine learning related to classification accuracy and computationally intractability. The proposed framework presents, to the best of our knowledge, the first practical solution that balances between classification accuracy and sparsity at the instance level, by dynamically choosing the most informative features, relative to each instance, from a set of potentially correlated features, for classifying each individual instance. The proposed framework achieves reductions up to 82% in the average number of features used by state-of-the-art methods without sacrificing accuracy and is robust for up to 10% of missing features. Broad positive societal implications include: fast, accurate, and cost-efficient inference in complex dynamic settings; and ease of interpretation of and trust in machine learning outcomes by domain experts (e.g., doctors and lawyers).