Seres humanos são capazes de desenvolver complexas estruturas de conhecimento que podem ser utilizadas de modo flexível para lidar com o ambiente de maneira apropriada. Estas estruturas de conhecimento constituem um núcleo que suporta processos cognitivos, tais como a percepção, a categorização, o planejamento, etc. A Inteligência Artificial, enquanto área de investigação, ocupa-se de desenvolver meios que viabilizem a reprodução destas capacidades cognitivas em agentes artificiais. Por este motivo, a investigação de abordagens que permitam a representação de conhecimento de um modo flexível se revela altamente relevante. Com o objetivo de superar algumas das limitações típicas da teoria clássica, que é adotada por várias abordagens propostas na Inteligência Artificial, este trabalho propõe um arcabouço cognitivamente inspirado para representação de conhecimento e raciocínio que integra aspectos de três diferentes teorias cognitivas a respeito de como conceitos são representados na cognição humana: teoria clássica, teoria do protótipo e teoria do exemplar. O arcabouço resultante é capaz de suportar a composicionalidade, a tipicalidade, a representação de instâncias atípicas dos conceitos, e a representação da variabilidade de indivíduos classificados por cada conceito. Consequentemente, o arcabouço proposto também suporta raciocínio lógico e baseado em similaridade. As principais contribuições deste trabalho são a concepção teórica e a formalização de um arcabouço cognitivamente inspirado para representação de conhecimento e raciocínio. Uma outra contribuição deste trabalho é uma abordagem de raciocínio para classificação que utiliza a abordagem de representação de conhecimento proposta. Além disso, este trabalho também apresenta duas abordagens para seleção de exemplares representativos de cada conceito e uma abordagem para extração de protótipos de conceitos. Nesta tese também é apresentado um sistema para interpretação automática de processos deposicionais que adota o arcabouço proposto. Experimentos realizados em uma tarefa de classificação sugerem que o arcabouço proposto é capaz de oferecer classificações mais informativas que as oferecidas por uma abordagem puramente clássica. / Human beings can develop complex knowledge structures that can be used for dealing with the environment in suitable ways. These knowledge structures constitute a core that supports several cognitive processes, such as perception, categorization, planning, etc. The Artificial Intelligence, as a research field, aims at developing approaches for mimicking these cognitive capabilities in machines. Due to this, it is important to investigate approaches that allow representing the knowledge in flexible ways. In order to overcome some limitations of the classical theory of knowledge representation, which is adopted by several approaches proposed in the Artificial Intelligence field, this work proposes a cognitively-inspired framework for knowledge representation and reasoning which integrates aspects from three different cognitive theories about concept representation in the human cognition: classical theory, prototype theory and exemplar theory. The resulting framework can support compositionality, typicality, representation of atypical instances of concepts, and representation of the variability of the individuals classified by each concept. Consequently, the proposed framework also supports logical reasoning and similarity-based reasoning. The main contributions of this work are the formalization of a cognitively-inspired framework for knowledge representation and reasoning, two approaches for selecting representative exemplars of each concept and an approach of reasoning for classification that integrates logical reasoning and similarity-based reasoning and that is supported by definitions, prototypes and exemplars of concepts. This thesis also presents a system for automatic interpretation of depositional processes application that adopts the proposed framework. The experiments, which were performed on a classification task, suggest that the proposed framework provides classifications that are more informative than the ones provided by a classical approach.

Seres humanos são capazes de desenvolver complexas estruturas de conhecimento que podem ser utilizadas de modo flexível para lidar com o ambiente de maneira apropriada. Estas estruturas de conhecimento constituem um núcleo que suporta processos cognitivos, tais como a percepção, a categorização, o planejamento, etc. A Inteligência Artificial, enquanto área de investigação, ocupa-se de desenvolver meios que viabilizem a reprodução destas capacidades cognitivas em agentes artificiais. Por este motivo, a investigação de abordagens que permitam a representação de conhecimento de um modo flexível se revela altamente relevante. Com o objetivo de superar algumas das limitações típicas da teoria clássica, que é adotada por várias abordagens propostas na Inteligência Artificial, este trabalho propõe um arcabouço cognitivamente inspirado para representação de conhecimento e raciocínio que integra aspectos de três diferentes teorias cognitivas a respeito de como conceitos são representados na cognição humana: teoria clássica, teoria do protótipo e teoria do exemplar. O arcabouço resultante é capaz de suportar a composicionalidade, a tipicalidade, a representação de instâncias atípicas dos conceitos, e a representação da variabilidade de indivíduos classificados por cada conceito. Consequentemente, o arcabouço proposto também suporta raciocínio lógico e baseado em similaridade. As principais contribuições deste trabalho são a concepção teórica e a formalização de um arcabouço cognitivamente inspirado para representação de conhecimento e raciocínio. Uma outra contribuição deste trabalho é uma abordagem de raciocínio para classificação que utiliza a abordagem de representação de conhecimento proposta. Além disso, este trabalho também apresenta duas abordagens para seleção de exemplares representativos de cada conceito e uma abordagem para extração de protótipos de conceitos. Nesta tese também é apresentado um sistema para interpretação automática de processos deposicionais que adota o arcabouço proposto. Experimentos realizados em uma tarefa de classificação sugerem que o arcabouço proposto é capaz de oferecer classificações mais informativas que as oferecidas por uma abordagem puramente clássica. / Human beings can develop complex knowledge structures that can be used for dealing with the environment in suitable ways. These knowledge structures constitute a core that supports several cognitive processes, such as perception, categorization, planning, etc. The Artificial Intelligence, as a research field, aims at developing approaches for mimicking these cognitive capabilities in machines. Due to this, it is important to investigate approaches that allow representing the knowledge in flexible ways. In order to overcome some limitations of the classical theory of knowledge representation, which is adopted by several approaches proposed in the Artificial Intelligence field, this work proposes a cognitively-inspired framework for knowledge representation and reasoning which integrates aspects from three different cognitive theories about concept representation in the human cognition: classical theory, prototype theory and exemplar theory. The resulting framework can support compositionality, typicality, representation of atypical instances of concepts, and representation of the variability of the individuals classified by each concept. Consequently, the proposed framework also supports logical reasoning and similarity-based reasoning. The main contributions of this work are the formalization of a cognitively-inspired framework for knowledge representation and reasoning, two approaches for selecting representative exemplars of each concept and an approach of reasoning for classification that integrates logical reasoning and similarity-based reasoning and that is supported by definitions, prototypes and exemplars of concepts. This thesis also presents a system for automatic interpretation of depositional processes application that adopts the proposed framework. The experiments, which were performed on a classification task, suggest that the proposed framework provides classifications that are more informative than the ones provided by a classical approach.

Seres humanos são capazes de desenvolver complexas estruturas de conhecimento que podem ser utilizadas de modo flexível para lidar com o ambiente de maneira apropriada. Estas estruturas de conhecimento constituem um núcleo que suporta processos cognitivos, tais como a percepção, a categorização, o planejamento, etc. A Inteligência Artificial, enquanto área de investigação, ocupa-se de desenvolver meios que viabilizem a reprodução destas capacidades cognitivas em agentes artificiais. Por este motivo, a investigação de abordagens que permitam a representação de conhecimento de um modo flexível se revela altamente relevante. Com o objetivo de superar algumas das limitações típicas da teoria clássica, que é adotada por várias abordagens propostas na Inteligência Artificial, este trabalho propõe um arcabouço cognitivamente inspirado para representação de conhecimento e raciocínio que integra aspectos de três diferentes teorias cognitivas a respeito de como conceitos são representados na cognição humana: teoria clássica, teoria do protótipo e teoria do exemplar. O arcabouço resultante é capaz de suportar a composicionalidade, a tipicalidade, a representação de instâncias atípicas dos conceitos, e a representação da variabilidade de indivíduos classificados por cada conceito. Consequentemente, o arcabouço proposto também suporta raciocínio lógico e baseado em similaridade. As principais contribuições deste trabalho são a concepção teórica e a formalização de um arcabouço cognitivamente inspirado para representação de conhecimento e raciocínio. Uma outra contribuição deste trabalho é uma abordagem de raciocínio para classificação que utiliza a abordagem de representação de conhecimento proposta. Além disso, este trabalho também apresenta duas abordagens para seleção de exemplares representativos de cada conceito e uma abordagem para extração de protótipos de conceitos. Nesta tese também é apresentado um sistema para interpretação automática de processos deposicionais que adota o arcabouço proposto. Experimentos realizados em uma tarefa de classificação sugerem que o arcabouço proposto é capaz de oferecer classificações mais informativas que as oferecidas por uma abordagem puramente clássica. / Human beings can develop complex knowledge structures that can be used for dealing with the environment in suitable ways. These knowledge structures constitute a core that supports several cognitive processes, such as perception, categorization, planning, etc. The Artificial Intelligence, as a research field, aims at developing approaches for mimicking these cognitive capabilities in machines. Due to this, it is important to investigate approaches that allow representing the knowledge in flexible ways. In order to overcome some limitations of the classical theory of knowledge representation, which is adopted by several approaches proposed in the Artificial Intelligence field, this work proposes a cognitively-inspired framework for knowledge representation and reasoning which integrates aspects from three different cognitive theories about concept representation in the human cognition: classical theory, prototype theory and exemplar theory. The resulting framework can support compositionality, typicality, representation of atypical instances of concepts, and representation of the variability of the individuals classified by each concept. Consequently, the proposed framework also supports logical reasoning and similarity-based reasoning. The main contributions of this work are the formalization of a cognitively-inspired framework for knowledge representation and reasoning, two approaches for selecting representative exemplars of each concept and an approach of reasoning for classification that integrates logical reasoning and similarity-based reasoning and that is supported by definitions, prototypes and exemplars of concepts. This thesis also presents a system for automatic interpretation of depositional processes application that adopts the proposed framework. The experiments, which were performed on a classification task, suggest that the proposed framework provides classifications that are more informative than the ones provided by a classical approach.

Millions of new websites are created daily, making it challenging to determine which ones are safe. Cybersecurity involves protecting companies and users from cyberattacks. Cybercriminals exploit various methods, including phishing attacks, to trick users into revealing sensitive information. In Australia alone, there were over 74,000 reported phishing attacks in 2022, resulting in a financial loss of over $24 million. Artificial intelligence (AI) and machine learning are effective tools in various domains, such as cancer detection, financial fraud detection, and chatbot development. Machine learning models, such as Random Forest and Support Vector Machines, are commonly used for classification tasks. With the rise of cybercrime, it is crucial to use machine learning to identify both known and new malicious URLs. The purpose of the study is to compare different instance selection methods and machine learning models for classifying malicious URLs. In this study, a dataset containing approximately 650,000 URLs from Kaggle was used. The dataset consisted of four categories: phishing, defacement, malware, and benign URLs. Three datasets, each consisting of around 170,000 URLs, were generated using instance selection methods (DRLSH, BPLSH, and random selection) implemented in MATLAB. Machine learning models, including SVM, DT, KNNs, and RF, were employed. The study applied these instance selection methods to a dataset of malicious URLs, trained the machine learning models on the resulting datasets, and evaluated their performance using 16 features and one output feature. In the process of hyperparameter tuning, the training dataset was used to train four models with different hyperparameter settings. Bayesian optimization was employed to find the best hyperparameters for each model. The classification process was then conducted, and the results were compared. The study found that the random instance selection method outperformed the other two methods, BPLSH and DRLSH, in terms of both accuracy and elapsed time for data selection. The lower accuracies achieved by the DRLSH and BPLSH methods may be attributed to the imbalanced dataset, which led to poor sample selection.

With respect to the continuous growth of computing systems, the energy-efficiency requirement of their processes becomes even more important. Different configurations, implying different energy-efficiency of the system, could be used to perform the process. A configuration denotes the choice among different hard- and software settings (e.g., CPU frequency, number of threads, the concrete algorithm, etc.). The identification of the most energy-efficient configuration demands to benchmark all configurations. However, this benchmarking is time- and energy-consuming, too. This thesis explores (a) the effect of dynamic voltage and frequency scaling (DVFS) in combination with dynamic concurrency throttling (DCT) on the energy consumption of (de)compression, DBMS query executions, encryption/decryption and sorting; and (b) a generic approach to reduce the benchmarking efforts to determine the optimal configuration. Our findings show that the utilization of optimal configurations can save wavg. 15.14% of energy compared to the default configuration. Moreover, we propose a generic heuristic (fractional factorial design) that utilizes data mining (adaptive instance selection) together with machine learning techniques (multiple linear regression) to decrease benchmarking effort by building a regression model based on the smallest feasible subset of the benchmarked configurations. Our approach reduces the energy consumption required for benchmarking by 63.9% whilst impairing the energy-efficiency of performing the computational process by only 1.88 pp, due to not using the optimal but a near-optimal configuration.

abstract: Medical images constitute a special class of images that are captured to allow diagnosis of disease, and their "correct" interpretation is vitally important. Because they are not "natural" images, radiologists must be trained to visually interpret them. This training process includes implicit perceptual learning that is gradually acquired over an extended period of exposure to medical images. This dissertation proposes novel computational methods for evaluating and facilitating perceptual training in radiologists. Part 1 of this dissertation proposes an eye-tracking-based metric for measuring the training progress of individual radiologists. Six metrics were identified as potentially useful: time to complete task, fixation count, fixation duration, consciously viewed regions, subconsciously viewed regions, and saccadic length. Part 2 of this dissertation proposes an eye-tracking-based entropy metric for tracking the rise and fall in the interest level of radiologists, as they scan chest radiographs. The results showed that entropy was significantly lower when radiologists were fixating on abnormal regions. Part 3 of this dissertation develops a method that allows extraction of Gabor-based feature vectors from corresponding anatomical regions of "normal" chest radiographs, despite anatomical variations across populations. These feature vectors are then used to develop and compare transductive and inductive computational methods for generating overlay maps that show atypical regions within test radiographs. The results show that the transductive methods produced much better maps than the inductive methods for 20 ground-truthed test radiographs. Part 4 of this dissertation uses an Extended Fuzzy C-Means (EFCM) based instance selection method to reduce the computational cost of transductive methods. The results showed that EFCM substantially reduced the computational cost without a substantial drop in performance. The dissertation then proposes a novel Variance Based Instance Selection (VBIS) method that also reduces the computational cost, but allows for incremental incorporation of new informative radiographs, as they are encountered. Part 5 of this dissertation develops and demonstrates a novel semi-transductive framework that combines the superior performance of transductive methods with the reduced computational cost of inductive methods. The results showed that the semi-transductive approach provided both an effective and efficient framework for detection of atypical regions in chest radiographs. / Dissertation/Thesis / Ph.D. Computer Science 2012

Depuis la prolifération des bases de données partiellement étiquetées, l'apprentissage automatique a connu un développement important dans le mode semi-supervisé. Cette tendance est due à la difficulté de l'étiquetage des données d'une part et au coût induit de cet étiquetage quand il est possible, d'autre part.L'apprentissage semi-supervisé consiste en général à modéliser une fonction statistique à partir de base de données regroupant à la fois des exemples étiquetés et d'autres non-étiquetés. Pour aborder une telle problématique, deux familles d'approches existent : celles basées sur la propagation de la supervision en vue de la classification supervisée et celles basées sur les contraintes en vue du clustering (non-supervisé). Nous nous intéressons ici à la deuxième famille avec une difficulté particulière. Il s'agit d'apprendre à partir de données avec une partie étiquetée relativement très réduite par rapport à la partie non-étiquetée.Dans cette thèse, nous nous intéressons à l'optimisation des bases de données statistiques en vue de l'amélioration des modèles d'apprentissage. Cette optimisation peut être horizontale et/ou verticale. La première définit la sélection d'instances et la deuxième définit la tâche de la sélection de variables.Les deux taches sont habituellement étudiées de manière indépendante avec une série de travaux considérable dans la littérature. Nous proposons ici de les étudier dans un cadre simultané, ce qui définit la thématique de la co-sélection. Pour ce faire, nous proposons deux cadres unifiés considérant à la fois la partie étiquetée des données et leur partie non-étiquetée. Le premier cadre est basé sur un clustering pondéré sous contraintes et le deuxième sur la préservation de similarités entre les données. Les deux approches consistent à qualifier les instances et les variables pour en sélectionner les plus pertinentes de manière simultanée.Enfin, nous présentons une série d'études empiriques sur des données publiques connues de la littérature pour valider les approches proposées et les comparer avec d'autres approches connues dans la littérature. De plus, une validation expérimentale est fournie sur un problème réel, concernant le diagnostic de transport ferroviaire de l'état de la Thaïlande / We are drowning in massive data but starved for knowledge retrieval. It is well known through the dimensionality tradeoff that more data increase informative but pay a price in computational complexity, which has to be made up in some way. When the labeled sample size is too little to bring sufficient information about the target concept, supervised learning fail with this serious challenge. Unsupervised learning can be an alternative in this problem. However, as these algorithms ignore label information, important hints from labeled data are left out and this will generally downgrades the performance of unsupervised learning algorithms. Using both labeled and unlabeled data is expected to better procedure in semi-supervised learning, which is more adapted for large domain applications when labels are hardly and costly to obtain. In addition, when data are large, feature selection and instance selection are two important dual operations for removing irrelevant information. Both of tasks with semisupervised learning are different challenges for machine learning and data mining communities for data dimensionality reduction and knowledge retrieval. In this thesis, we focus on co-selection of instances and features in the context of semi-supervised learning. In this context, co-selection becomes a more challenging problem as the data contains labeled and unlabeled examples sampled from the same population. To do such semi-supervised coselection, we propose two unified frameworks, which efficiently integrate labeled and unlabeled parts into the co-selection process. The first framework is based on weighting constrained clustering and the second one is based on similarity preserving selection. Both approaches evaluate the usefulness of features and instances in order to select the most relevant ones, simultaneously. Finally, we present a variety of empirical studies over high-dimensional data sets, which are well-known in the literature. The results are promising and prove the efficiency and effectiveness of the proposed approaches. In addition, the developed methods are validated on a real world application, over data provided by the State Railway of Thailand (SRT). The purpose is to propose the application models from our methodological contributions to diagnose the performance of rail dry port systems. First, we present the results of some ensemble methods applied on a first data set, which is fully labeled. Second, we show how can our co-selection approaches improve the performance of learning algorithms over partially labeled data provided by SRT

Submitted by Fabio Sobreira Campos da Costa (fabio.sobreira@ufpe.br) on 2016-04-05T14:16:18Z No. of bitstreams: 2 license_rdf: 1232 bytes, checksum: 66e71c371cc565284e70f40736c94386 (MD5) Shayane_FINAL.pdf: 7778172 bytes, checksum: bef887b2265bc2ffe53c75c2c275d796 (MD5) / Made available in DSpace on 2016-04-05T14:16:18Z (GMT). No. of bitstreams: 2 license_rdf: 1232 bytes, checksum: 66e71c371cc565284e70f40736c94386 (MD5) Shayane_FINAL.pdf: 7778172 bytes, checksum: bef887b2265bc2ffe53c75c2c275d796 (MD5) Previous issue date: 2015-08-21 / IF Sertão - PE / Os sistemas de Descoberta de Conhecimentos em Bases de Dados (mais conhecidos como sistemas KDD) e métodos de Aprendizagem de Máquinas preveem situações, agrupam e reconhecem padrões, entre outras tarefas que são demandas de um mundo no qual a maioria dos serviços está sendo oferecido por meio virtual. Apesar dessas aplicações se preocuparem em gerar informações de fácil interpretação, rápidas e confiáveis, as extensas bases de dados utilizadas dificultam o alcance de precisão unida a um baixo custo computacional. Para resolver esse problema, as bases de dados podem ser reduzidas com o objetivo de diminuir o tempo de processamento e facilitar o seu armazenamento, bem como, guardar apenas informações suficientes e relevantes para a extração do conhecimento. Nesse contexto, Métodos de Seleção de Instâncias (MSIs) têm sido propostos para reduzir e filtrar as bases de dados, selecionando ou criando novas instâncias que melhor as descrevam. Todavia, aqui se aplica o Teorema do No Free Lunch, ou seja, a performance dos MSIs varia conforme a base e nenhum dos métodos sempre sobrepõe seu desempenho aos demais. Por isso, esta dissertação propõe uma arquitetura para selecionar o “melhor” MSI para uma dada base de dados (mais adequado emrelação à precisão), chamadaMeta-CISM (Metalearning for Choosing Instance SelectionMethod). Estratégias de meta-aprendizagem são utilizadas para treinar um meta-classificador que aprende sobre o relacionamento entre a taxa de acerto de MSIs e a estrutura das bases. O Meta-CISM utiliza ainda reamostragem e métodos de seleção de atributos para melhorar o desempenho do meta-classificador. A proposta foi avaliada com os MSIs: C-pruner, DROP3, IB3, ICF e ENN-CNN. Os métodos de reamostragem utilizados foram: Bagging e Combination (método proposto neste trabalho). Foram utilizados como métodos de seleção de atributos: Relief-F, CFS, Chi Square Feature Evaluation e Consistency-Based Subset Evaluation. Cinco classificadores contribuíram para rotular as meta-instâncias: C4.5, PART, MLP-BP, SMO e KNN. Uma MLP-BP treinou o meta-classificador. Os experimentos foram realizados com dezesseis bases de dados públicas. O método proposto (Meta-CISM) foi melhor que todos os MSIs estudados, na maioria dos experimentos realizados. Visto que eficientemente seleciona um dos três melhores MSIs em mais de 85% dos casos, a abordagemé adequada para ser automaticamente utilizada na fase de pré-processamento das base de dados. / The systems for Knowledge Discovery in Databases (better known as KDD systems) andMachine Learning methods predict situations, recognize and group (cluster) patterns, among other tasks that are demands of a world in which the most of the services is being offered by virtual ways. Although these applications are concerned in generate fast, reliable and easy to interpret information, extensive databases used for such applications make difficult achieving accuracy with a low computational cost. To solve this problem, the databases can be reduced aiming to decrease the processing time and facilitating its storage, as well as, to save only sufficient and relevant information for the knowledge extraction. In this context, Instances SelectionMethods (ISMs) have been proposed to reduce and filter databases, selecting or creating new instances that best describe them. Nevertheless, No Free Lunch Theorem is applied, that is, the ISMs performance varies according to the base and none of the methods always overcomes their performance over others. Therefore, this work proposes an architecture to select the "best"ISM for a given database (best suited in relation to accuracy), called Meta-CISM (Meta-learning for Choosing Instance SelectionMethod). Meta-learning strategies are used to train a meta-classifier that learns about the relationship between the accuracy rate of ISMs and the bases structures. TheMeta-CISM still uses resampling and feature selection methods to improve the meta-classifier performance. The proposal was evaluated with the ISMs: C-pruner, DROP3, IB3, ICF and ENN-CNN. Resampling methods used were: Bagging and Combination (method proposed in this work). The Feature SelectionMethods used were: Relief-F, CFS, Chi Square Feature Evaluation e Consistency-Based Subset Evaluation. Five classifiers contributed to label the meta-instances: C4.5, PART, MLP-BP, SMO e KNN. The meta-classifier was trained by a MLP-BP. Experiments were carried with sixteen public databases. The proposed method (Meta-CISM) was better than all ISMs studied in the most of the experiments performed. Since that efficiently selects one of the three best ISMs in more than 85% of cases, the approach is suitable to be automatically used in the pre-processing of the databases.

With respect to the continuous growth of computing systems, the energy-efficiency requirement of their processes becomes even more important. Different configurations, implying different energy-efficiency of the system, could be used to perform the process. A configuration denotes the choice among different hard- and software settings (e.g., CPU frequency, number of threads, the concrete algorithm, etc.). The identification of the most energy-efficient configuration demands to benchmark all configurations. However, this benchmarking is time- and energy-consuming, too. This thesis explores (a) the effect of dynamic voltage and frequency scaling (DVFS) in combination with dynamic concurrency throttling (DCT) on the energy consumption of (de)compression, DBMS query executions, encryption/decryption and sorting; and (b) a generic approach to reduce the benchmarking efforts to determine the optimal configuration. Our findings show that the utilization of optimal configurations can save wavg. 15.14% of energy compared to the default configuration. Moreover, we propose a generic heuristic (fractional factorial design) that utilizes data mining (adaptive instance selection) together with machine learning techniques (multiple linear regression) to decrease benchmarking effort by building a regression model based on the smallest feasible subset of the benchmarked configurations. Our approach reduces the energy consumption required for benchmarking by 63.9% whilst impairing the energy-efficiency of performing the computational process by only 1.88 pp, due to not using the optimal but a near-optimal configuration.