Camelia Pintea

Prof. Camelia Pintea

TU Cluj-Napoca
orcid

Research Focus & Metrics

Academic Career Length

22Years (2005-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
7 December 2018 in Applied Intelligence
Verified
Journal Article
Open access
PDF file
Andreas HolzingerAndreas Holzinger
Andreas Holzinger
MPMarkus Plass
Markus Plass
MKMichael D. Kickmeier-Rust
Michael D. Kickmeier-Rust
KHKatharina Holzinger
Katharina Holzinger
Gloria Cerasela CrisanGloria Cerasela Crisan
Gloria Cerasela Crisan
Vasile PaladeVasile Palade
Vasile Palade
Recent advances in automatic machine learning (aML) allow solving problems without any human intervention. However, sometimes a human-in-the-loop can be beneficial in solving computationally hard problems. In this paper we provide new experimental insights on how we can improve computational intelligence by complementing it with human intelligence in an interactive machine learning approach (iML). For this purpose, we used the Ant Colony Optimization (ACO) framework, because this fosters multi-agent approaches with human agents in the loop. We propose unification between the human intelligence and interaction skills and the computational power of an artificial system. The ACO framework is used on a case study solving the Traveling Salesman Problem, because of its many practical implications, e.g. in the medical domain. We used ACO due to the fact that it is one of the best algorithms used in many applied intelligence problems. For the evaluation we used gamification, i.e. we implemented a snake-like game called Traveling Snakesman with the MAX–MIN Ant System (MMAS) in the background. We extended the MMAS–Algorithm in a way, that the human can directly interact and influence the ants. This is done by “traveling” with the snake across the graph. Each time the human travels over an ant, the current pheromone value of the edge is multiplied by 5. This manipulation has an impact on the ant’s behavior (the probability that this edge is taken by the ant increases). The results show that the humans performing one tour through the graphs have a significant impact on the shortest path found by the MMAS. Consequently, our experiment demonstrates that in our case human intelligence can positively influence machine intelligence. To the best of our knowledge this is the first study of this kind.

23 August 2016
Verified
Book Chapter
Open access
PDF file
Andreas HolzingerAndreas Holzinger
Andreas Holzinger
MPMarkus Plass
Markus Plass
KHKatharina Holzinger
Katharina Holzinger
Gloria Cerasela CrisanGloria Cerasela Crisan
Gloria Cerasela Crisan
CPCamelia Pintea
Camelia Pintea
VPVasile Palade
Vasile Palade
Most Machine Learning (ML) researchers focus on automatic Machine Learning (aML) where great advances have been made, for example, in speech recognition, recommender systems, or autonomous vehicles. Automatic approaches greatly benefit from the availability of “big data”. However, sometimes, for example in health informatics, we are confronted not a small number of data sets or rare events, and with complex problems where aML-approaches fail or deliver unsatisfactory results. Here, interactive Machine Learning (iML) may be of help and the “human-in-the-loop” approach may be beneficial in solving computationally hard problems, where human expertise can help to reduce an exponential search space through heuristics. In this paper, experiments are discussed which help to evaluate the effectiveness of the iML-“human-in-the-loop” approach, particularly in opening the “black box”, thereby enabling a human to directly and indirectly manipulating and interacting with an algorithm. For this purpose, we selected the Ant Colony Optimization (ACO) framework, and use it on the Traveling Salesman Problem (TSP) which is of high importance in solving many practical problems in health informatics, e.g. in the study of proteins.

7 August 2017 in Complex Adaptive Systems Modeling
Verified
Journal Article
Open access
PDF file
CPCamelia Pintea
Camelia Pintea
Petrica Pop-SitarPetrica Pop-Sitar
Petrica Pop-Sitar
CCCamelia Chira
Camelia Chira
A well known $$\mathcal{NP}$$ NP -hard problem called the generalized traveling salesman problem (GTSP) is considered. In GTSP the nodes of a complete undirected graph are partitioned into clusters. The objective is to find a minimum cost tour passing through exactly one node from each cluster. An exact exponential time algorithm and an effective meta-heuristic algorithm for the problem are presented. The meta-heuristic proposed is a modified Ant Colony System (ACS) algorithm called reinforcing Ant Colony System which introduces new correction rules in the ACS algorithm. Computational results are reported for many standard test problems. The proposed algorithm is competitive with the other already proposed heuristics for the GTSP in both solution quality and computational time.

19 June 2019 in Creative Mathematics and Informatics
Verified
Journal Article
Closed access
Andreas HolzingerAndreas Holzinger
Andreas Holzinger
MPMarkus Plass
Markus Plass
KHKatharina Holzinger
Katharina Holzinger
GCGloria Cerasela Cris¸aN
Gloria Cerasela Cris¸aN
CPCamelia Pintea
Camelia Pintea
VPVasile Palade
Vasile Palade
The ultimate goal of the Machine Learning (ML) community is to develop algorithms that can automatically learn from data, to extract knowledge and to make decisions without any human intervention. Specifically, automatic Machine Learning (aML) approaches show impressive success, e.g. in speech/image recognition or autonomous drive and smart car industry. Recent results even demonstrate intriguingly that deep learning applied for automatic classification of skin lesions is on par with the performance of dermatologists, yet outperforms the average human efficiency. As human perception is inherently limited to 3D environments, such approaches can discover patterns, e.g. that two objects are similar, in arbitrarily high-dimensional spaces what no human is able to do. Humans can deal simultaneously only with limited amounts of data, whilst “big data” is not only beneficial but necessary for aML. However, in health informatics, there are few data sets; aML approaches often suffer from insufficient training samples. Many problems are computationally hard, e.g. subspace clustering, k-anonymization, or protein folding. Here, interactive machine learning (iML) could be successfully used, as a human-in-the-loop contributes to reduce a huge search space through heuristic selection of suitable samples. This can reduce the complexity of NP-hard problems through the knowledge brought in by a human agent involved into the learning algorithm. A huge motivation for iML is that standard black-box approaches lack transparency, hence do not foster trust and acceptance of ML among end-users. Most of all, rising legal and privacy aspects, e.g. the European General Data Protection Regulations (GDPR) make black-box approaches difficult to use, because they often are not able to explain why a decision has been made, e.g. why two objects are similar. All these reasons motivate the idea to open the black-box to a glass-box. In this paper, we present some experiments to demonstrate the effectiveness of the iML human-in-the-loop model, in particular when using a glass-box instead of a black-box model and thus enabling a human directly to interact with a learning algorithm. We selected the Ant Colony System (ACS) algorithm, and applied it on the Traveling Salesman Problem (TSP). The TSP-problem is a good example, because it is of high relevance for health informatics as for example on protein folding problem, thus of enormous importance for fostering cancer research. Finally, from studies of learning from observation, i.e. of how humans extract so much from so little data, fundamental ML-research also may benefit.

1 June 2015 in Journal of Applied Logic
Verified
Journal Article
Closed access
Petrica Pop-SitarPetrica Pop-Sitar
Petrica Pop-Sitar
CPCamelia Pintea
Camelia Pintea
CSCorina Pop Sitar
Corina Pop Sitar
MHMara Hajdu-Măcelaru
Mara Hajdu-Măcelaru