Pub Date : 2018-10-01DOI: 10.1109/BRACIS.2018.00056
G. Plichoski, Chidambaram Chidambaram, R. S. Parpinelli
It is possible to find in the literature a wide range of techniques employed for face recognition. Hence, to select a technique or set of techniques and tune their respective parameters become an optimization task. In this paper, we present a face recognition framework with the aid of bio-inspired optimization algorithms. This approach implements several preprocessing and feature extraction techniques, and the optimization algorithm is responsible for choosing which strategies to use, as well as tunning their parameters. In this work, we analyzed the performance of two optimization algorithms, namely Particle Swarm Optimization (PSO) and Differential Evolution (DE) aiming to address the illumination compensation problem. The well known Yale Extended B database is used in the classification task. The results obtained show that the proposed approach is competitive with literature achieving the average recognition rate of 99.95% with DE.
{"title":"A Face Recognition Framework for Illumination Compensation Based on Bio-Inspired Algorithms","authors":"G. Plichoski, Chidambaram Chidambaram, R. S. Parpinelli","doi":"10.1109/BRACIS.2018.00056","DOIUrl":"https://doi.org/10.1109/BRACIS.2018.00056","url":null,"abstract":"It is possible to find in the literature a wide range of techniques employed for face recognition. Hence, to select a technique or set of techniques and tune their respective parameters become an optimization task. In this paper, we present a face recognition framework with the aid of bio-inspired optimization algorithms. This approach implements several preprocessing and feature extraction techniques, and the optimization algorithm is responsible for choosing which strategies to use, as well as tunning their parameters. In this work, we analyzed the performance of two optimization algorithms, namely Particle Swarm Optimization (PSO) and Differential Evolution (DE) aiming to address the illumination compensation problem. The well known Yale Extended B database is used in the classification task. The results obtained show that the proposed approach is competitive with literature achieving the average recognition rate of 99.95% with DE.","PeriodicalId":405190,"journal":{"name":"2018 7th Brazilian Conference on Intelligent Systems (BRACIS)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125207647","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}
Pub Date : 2018-10-01DOI: 10.1109/BRACIS.2018.00065
M. W. Rodrigues, Wladmir Cardoso Brandão, Luis E. Zárate
Scientific collaboration improves researchers productivity by providing a way to share new ideas, learn new techniques, and find new research applications, increasing the chance to access funding. Beyond ethics and reciprocity, there are other important aspects on achieving scientific collaborations, such as research interests and expected productivity gain, that are paramount to a successful partnership. However, achieve effective collaborations is a hard work and can drain researchers time. In this work, we propose a recommendation approach that uses different strategies to suggest scientific collaboration for researchers based on their research interest. In particular, our approach exploits ResearchGate, a well known research social network from where research interests and researchers production are used to model similarity between them. Experimental results show that the content-based strategy outperforms neighborhood-based collaborative filtering strategies to recommend scientific collaboration with gains of up 16.60% in precision, 37.19% in recall, and 21.16% in F1 for the top-20 recommendation lists.
{"title":"Recommending Scientific Collaboration from ResearchGate","authors":"M. W. Rodrigues, Wladmir Cardoso Brandão, Luis E. Zárate","doi":"10.1109/BRACIS.2018.00065","DOIUrl":"https://doi.org/10.1109/BRACIS.2018.00065","url":null,"abstract":"Scientific collaboration improves researchers productivity by providing a way to share new ideas, learn new techniques, and find new research applications, increasing the chance to access funding. Beyond ethics and reciprocity, there are other important aspects on achieving scientific collaborations, such as research interests and expected productivity gain, that are paramount to a successful partnership. However, achieve effective collaborations is a hard work and can drain researchers time. In this work, we propose a recommendation approach that uses different strategies to suggest scientific collaboration for researchers based on their research interest. In particular, our approach exploits ResearchGate, a well known research social network from where research interests and researchers production are used to model similarity between them. Experimental results show that the content-based strategy outperforms neighborhood-based collaborative filtering strategies to recommend scientific collaboration with gains of up 16.60% in precision, 37.19% in recall, and 21.16% in F1 for the top-20 recommendation lists.","PeriodicalId":405190,"journal":{"name":"2018 7th Brazilian Conference on Intelligent Systems (BRACIS)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127217541","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}
Pub Date : 2018-10-01DOI: 10.1109/BRACIS.2018.00015
Hilário Oliveira, R. Lins, Rinaldo Lima, F. Freitas, S. Simske
Multi-document summarization systems aim to generate a brief text containing the most relevant information from a collection of related documents. The fast and continually growing volume of text data has increasingly drawn the attention from users and researchers to such systems. Aspects such as sentence centrality and position have been extensively studied in multi-document summarization as indicators of content relevancy. Very few works have investigated their efficient integration using global-based optimization approaches, however. This paper proposes a concept-based integer linear programming approach for multi-document summarization of news articles that integrates centrality and position features to filter out the less relevant sentences and measure the importance of concepts (textual fragments) in composing the output summary. The presented approach relies on a centrality-based strategy to perform the sentence clustering process and also to support the sentence ordering step. The benchmarks conducted with four datasets of the Document Understanding Conferences from 2001 to 2004 demonstrate that the proposed approach presents competitive performance compared with other state-of-the-art methods.
{"title":"A Concept-Based ILP Approach for Multi-document Summarization Exploring Centrality and Position","authors":"Hilário Oliveira, R. Lins, Rinaldo Lima, F. Freitas, S. Simske","doi":"10.1109/BRACIS.2018.00015","DOIUrl":"https://doi.org/10.1109/BRACIS.2018.00015","url":null,"abstract":"Multi-document summarization systems aim to generate a brief text containing the most relevant information from a collection of related documents. The fast and continually growing volume of text data has increasingly drawn the attention from users and researchers to such systems. Aspects such as sentence centrality and position have been extensively studied in multi-document summarization as indicators of content relevancy. Very few works have investigated their efficient integration using global-based optimization approaches, however. This paper proposes a concept-based integer linear programming approach for multi-document summarization of news articles that integrates centrality and position features to filter out the less relevant sentences and measure the importance of concepts (textual fragments) in composing the output summary. The presented approach relies on a centrality-based strategy to perform the sentence clustering process and also to support the sentence ordering step. The benchmarks conducted with four datasets of the Document Understanding Conferences from 2001 to 2004 demonstrate that the proposed approach presents competitive performance compared with other state-of-the-art methods.","PeriodicalId":405190,"journal":{"name":"2018 7th Brazilian Conference on Intelligent Systems (BRACIS)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121752138","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}
Pub Date : 2018-10-01DOI: 10.1109/BRACIS.2018.00086
J. C. Xavier, A. Freitas, Antonino Feitosa Neto, Teresa B Ludermir
Automated Machine Learning (Auto-ML) is an emerging area of ML which consists of automatically selecting the best ML algorithm and its best hyper-parameter settings for a given input dataset, by doing a search in a large space of candidate algorithms and settings. In this work we propose a new Evolutionary Algorithm (EA) for the Auto-ML task of automatically selecting the best ensemble of classifiers and their hyper-parameter settings for an input dataset. The proposed EA was compared against a version of the well-known Auto-WEKA method adapted to search in the same space of algorithms and hyper-parameter settings as the EA. In general, the EA obtained significantly smaller classification error rates than that Auto-WEKA version in experiments with 15 classification datasets.
{"title":"A Novel Evolutionary Algorithm for Automated Machine Learning Focusing on Classifier Ensembles","authors":"J. C. Xavier, A. Freitas, Antonino Feitosa Neto, Teresa B Ludermir","doi":"10.1109/BRACIS.2018.00086","DOIUrl":"https://doi.org/10.1109/BRACIS.2018.00086","url":null,"abstract":"Automated Machine Learning (Auto-ML) is an emerging area of ML which consists of automatically selecting the best ML algorithm and its best hyper-parameter settings for a given input dataset, by doing a search in a large space of candidate algorithms and settings. In this work we propose a new Evolutionary Algorithm (EA) for the Auto-ML task of automatically selecting the best ensemble of classifiers and their hyper-parameter settings for an input dataset. The proposed EA was compared against a version of the well-known Auto-WEKA method adapted to search in the same space of algorithms and hyper-parameter settings as the EA. In general, the EA obtained significantly smaller classification error rates than that Auto-WEKA version in experiments with 15 classification datasets.","PeriodicalId":405190,"journal":{"name":"2018 7th Brazilian Conference on Intelligent Systems (BRACIS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130702708","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}
Pub Date : 2018-10-01DOI: 10.1109/BRACIS.2018.00024
J. Nagai, H. Sousa, A. Aono, Ana Carolina Lorena, R. Kuroshu
Fundamental questions such as what are the genes that are really necessary for the survival of cells have motivated many studies to investigate the essentiality of genes in different species. Initial efforts have attempted to address this problem through exhaustive knockout experiments in simple bacteria. Recently, results obtained in these studies have also been applied to the emerging field of synthetic biology with possible implications in many other fields such as health and energy. Motivated by the evolution of DNA sequencing technology and high-throughput biological data generation, many recent efforts have also been made for building and understanding biological networks. In particular, metabolic networks represent the set of known biochemical reactions within a cell. Essential genes are expected to play a key role in these networks, as they must be involved in vital metabolic pathways. Even though some studies investigated the correlation between essential genes and biological network information, different types of networks and other biological information were usually combined and the effect of each of them in the obtained results was not stressed. This paper describes an attempt to predict essential genes using solely topological features from metabolic networks. The networks were built from a common repository, the KEGG database, ensuring data uniformity. Experimentally, considering different prediction scenarios and reference organisms, the use of topological features from metabolic networks achieved mean AUC of about 70% in the prediction of gene essentiality. This reveals that more factors affect essentiality and should indeed be considered in order to obtain more accurate predictions.
{"title":"Gene Essentiality Prediction Using Topological Features From Metabolic Networks","authors":"J. Nagai, H. Sousa, A. Aono, Ana Carolina Lorena, R. Kuroshu","doi":"10.1109/BRACIS.2018.00024","DOIUrl":"https://doi.org/10.1109/BRACIS.2018.00024","url":null,"abstract":"Fundamental questions such as what are the genes that are really necessary for the survival of cells have motivated many studies to investigate the essentiality of genes in different species. Initial efforts have attempted to address this problem through exhaustive knockout experiments in simple bacteria. Recently, results obtained in these studies have also been applied to the emerging field of synthetic biology with possible implications in many other fields such as health and energy. Motivated by the evolution of DNA sequencing technology and high-throughput biological data generation, many recent efforts have also been made for building and understanding biological networks. In particular, metabolic networks represent the set of known biochemical reactions within a cell. Essential genes are expected to play a key role in these networks, as they must be involved in vital metabolic pathways. Even though some studies investigated the correlation between essential genes and biological network information, different types of networks and other biological information were usually combined and the effect of each of them in the obtained results was not stressed. This paper describes an attempt to predict essential genes using solely topological features from metabolic networks. The networks were built from a common repository, the KEGG database, ensuring data uniformity. Experimentally, considering different prediction scenarios and reference organisms, the use of topological features from metabolic networks achieved mean AUC of about 70% in the prediction of gene essentiality. This reveals that more factors affect essentiality and should indeed be considered in order to obtain more accurate predictions.","PeriodicalId":405190,"journal":{"name":"2018 7th Brazilian Conference on Intelligent Systems (BRACIS)","volume":"2016 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114494249","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}
Pub Date : 2018-10-01DOI: 10.1109/BRACIS.2018.00090
Luis Guilherme Bergamini Mendes, A. Vendramin, Anelise Munaretto, M. Delgado
This paper presents a rule-based system for the Greedy Ant Protocol (GrAnt), named rGrAnt. GrAnt uses the Ant Colony Optimization (ACO) meta-heuristic aiming to route traffic in complex and dynamic Delay Tolerant Networks. rGrAnt has been developed to provide the protocol the ability to extract information online from nodes' social connectivity, which can range from disconnected and sparse to highly connected networking environments. With this information, the proposed protocol can guide through its fuzzy/crisp rules the ACO routing module by deciding when to consider data from heuristic functions and/or pheromone concentration, which data can be incorporated in both heuristic and pheromone parameters, and if the message forwarding phase must be less or more restrictive. In nodes with low connectivity, the rules of rGrAnt indicate that the protocol must be less restrictive when forwarding messages, in order to make better use of the few available contacts. In contrast, in nodes with high connectivity, it is necessary to restrict forwarding to avoid overloading the same sets of nodes and links. rGrAnt is compared with GrAnt in three different movement models. Results show that, in the three models, rGrAnt achieves a higher delivery ratio than GrAnt.
{"title":"A Rule-Based Greedy Ant (rGrAnt) Protocol for Networking Environments","authors":"Luis Guilherme Bergamini Mendes, A. Vendramin, Anelise Munaretto, M. Delgado","doi":"10.1109/BRACIS.2018.00090","DOIUrl":"https://doi.org/10.1109/BRACIS.2018.00090","url":null,"abstract":"This paper presents a rule-based system for the Greedy Ant Protocol (GrAnt), named rGrAnt. GrAnt uses the Ant Colony Optimization (ACO) meta-heuristic aiming to route traffic in complex and dynamic Delay Tolerant Networks. rGrAnt has been developed to provide the protocol the ability to extract information online from nodes' social connectivity, which can range from disconnected and sparse to highly connected networking environments. With this information, the proposed protocol can guide through its fuzzy/crisp rules the ACO routing module by deciding when to consider data from heuristic functions and/or pheromone concentration, which data can be incorporated in both heuristic and pheromone parameters, and if the message forwarding phase must be less or more restrictive. In nodes with low connectivity, the rules of rGrAnt indicate that the protocol must be less restrictive when forwarding messages, in order to make better use of the few available contacts. In contrast, in nodes with high connectivity, it is necessary to restrict forwarding to avoid overloading the same sets of nodes and links. rGrAnt is compared with GrAnt in three different movement models. Results show that, in the three models, rGrAnt achieves a higher delivery ratio than GrAnt.","PeriodicalId":405190,"journal":{"name":"2018 7th Brazilian Conference on Intelligent Systems (BRACIS)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133909630","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}
Pub Date : 2018-10-01DOI: 10.1109/BRACIS.2018.00039
Raul Sena Ferreira, Bruno M. A. da Silva, W. Teixeira, Geraldo Zimbrão, L. Alvim
Machine learning solutions usually consider that the train and test data has the same probabilistic distribution, that is, the data is stationary. However, in streaming scenarios, data distribution generally change through the time, that is, the data is non-stationary. The main challenge in such online environment is the model adaptation for the constant drifts in data distribution. Besides, other important restriction may happen in online scenarios: the extreme latency to verify the labels. Worth to mention that the incremental drift assumption is that class distributions overlap at subsequent time steps. Hence, the core region of data distribution have significant overlap with incoming data. Therefore, selecting samples from these core regions helps to retain the most important instances that represent the new distribution. This selection is denominated core support extraction (CSE). Thus, we present a study about density-based algorithms applied in non-stationary environments. We compared KDE, GMM and two variations of DBSCAN against single semi-supervised approaches. We validated these approaches in seventeen synthetic datasets and a real one, showing the strengths and weaknesses of these CSE methods through many metrics. We show that a semi-supervised classifier is improved up to 68% on a real dataset when it is applied along with a density-based CSE algorithm. The results between KDE and GMM, as CSE methods, were close but the approach using KDE is more practical due to having less parameters.
{"title":"Density-Based Core Support Extraction for Non-stationary Environments with Extreme Verification Latency","authors":"Raul Sena Ferreira, Bruno M. A. da Silva, W. Teixeira, Geraldo Zimbrão, L. Alvim","doi":"10.1109/BRACIS.2018.00039","DOIUrl":"https://doi.org/10.1109/BRACIS.2018.00039","url":null,"abstract":"Machine learning solutions usually consider that the train and test data has the same probabilistic distribution, that is, the data is stationary. However, in streaming scenarios, data distribution generally change through the time, that is, the data is non-stationary. The main challenge in such online environment is the model adaptation for the constant drifts in data distribution. Besides, other important restriction may happen in online scenarios: the extreme latency to verify the labels. Worth to mention that the incremental drift assumption is that class distributions overlap at subsequent time steps. Hence, the core region of data distribution have significant overlap with incoming data. Therefore, selecting samples from these core regions helps to retain the most important instances that represent the new distribution. This selection is denominated core support extraction (CSE). Thus, we present a study about density-based algorithms applied in non-stationary environments. We compared KDE, GMM and two variations of DBSCAN against single semi-supervised approaches. We validated these approaches in seventeen synthetic datasets and a real one, showing the strengths and weaknesses of these CSE methods through many metrics. We show that a semi-supervised classifier is improved up to 68% on a real dataset when it is applied along with a density-based CSE algorithm. The results between KDE and GMM, as CSE methods, were close but the approach using KDE is more practical due to having less parameters.","PeriodicalId":405190,"journal":{"name":"2018 7th Brazilian Conference on Intelligent Systems (BRACIS)","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134410082","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}
Pub Date : 2018-10-01DOI: 10.1109/BRACIS.2018.00048
P. Freitas, W. Y. L. Akamine, Mylène C. Q. Farias
In many practical multimedia applications, the visual content is modified during transmission, enhancement, modification, and compression stages. These modifications often create visible distortions that may be perceived by humans. Therefore, the development of algorithms that are able to assess the visual quality as perceived by a human viewer can lead to significant progress in multimedia applications. Many researchers have developed algorithms that estimate visual quality. These algorithms can either make use of the full pristine content (full-reference metrics), partial aspects of the pristine content (reduced-reference metrics) or only the assessed content (referenceless or no-reference metrics). These three approaches have advantages and drawbacks. Nevertheless, although the design of a referenceless metric is more challenging, they have greater applicability in different scenarios. This paper introduces a novel referenceless image quality assessment (RIQA) metric. The proposed metric uses statistics of the Binarized Statistical Image Features descriptor (BSIF) to analyze the textures of an image. These statistics are mapped into subjective quality scores using a Random Forest Regression approach. Results show that the proposed metric is robust and accurate, outperforming other state-of-the-art RIQA methods.
{"title":"Towards a Referenceless Visual Quality Assessment Model Using Binarized Statistical Image Features","authors":"P. Freitas, W. Y. L. Akamine, Mylène C. Q. Farias","doi":"10.1109/BRACIS.2018.00048","DOIUrl":"https://doi.org/10.1109/BRACIS.2018.00048","url":null,"abstract":"In many practical multimedia applications, the visual content is modified during transmission, enhancement, modification, and compression stages. These modifications often create visible distortions that may be perceived by humans. Therefore, the development of algorithms that are able to assess the visual quality as perceived by a human viewer can lead to significant progress in multimedia applications. Many researchers have developed algorithms that estimate visual quality. These algorithms can either make use of the full pristine content (full-reference metrics), partial aspects of the pristine content (reduced-reference metrics) or only the assessed content (referenceless or no-reference metrics). These three approaches have advantages and drawbacks. Nevertheless, although the design of a referenceless metric is more challenging, they have greater applicability in different scenarios. This paper introduces a novel referenceless image quality assessment (RIQA) metric. The proposed metric uses statistics of the Binarized Statistical Image Features descriptor (BSIF) to analyze the textures of an image. These statistics are mapped into subjective quality scores using a Random Forest Regression approach. Results show that the proposed metric is robust and accurate, outperforming other state-of-the-art RIQA methods.","PeriodicalId":405190,"journal":{"name":"2018 7th Brazilian Conference on Intelligent Systems (BRACIS)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132148778","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}
Pub Date : 2018-10-01DOI: 10.1109/bracis.2018.00064
Renan de Padua, Dario Brito Calçada, Verônica Oliveira de Carvalho, Solange Oliveira Rezende
In this paper, we presented the Extended Association Rule Network (ExARN) to structure, prune and analyze a set of association rules, aiming to build hypothesis candidates. The ExARN extends the ARN, proposed by [2], allowing a more complete exploration. We validate the ExARN using two databases: contact lenses and hayes-roth, both available online for download. The results were validated by comparing the ExARN to the conventional ARN and also by comparing the results with a decision tree algorithms. The approach presented promising results, showing its capability to explain a set of objective items, aiding the user on the hypothesis building.
{"title":"Exploring the Data Using Extended Association Rule Network","authors":"Renan de Padua, Dario Brito Calçada, Verônica Oliveira de Carvalho, Solange Oliveira Rezende","doi":"10.1109/bracis.2018.00064","DOIUrl":"https://doi.org/10.1109/bracis.2018.00064","url":null,"abstract":"In this paper, we presented the Extended Association Rule Network (ExARN) to structure, prune and analyze a set of association rules, aiming to build hypothesis candidates. The ExARN extends the ARN, proposed by [2], allowing a more complete exploration. We validate the ExARN using two databases: contact lenses and hayes-roth, both available online for download. The results were validated by comparing the ExARN to the conventional ARN and also by comparing the results with a decision tree algorithms. The approach presented promising results, showing its capability to explain a set of objective items, aiding the user on the hypothesis building.","PeriodicalId":405190,"journal":{"name":"2018 7th Brazilian Conference on Intelligent Systems (BRACIS)","volume":"34 7","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114113057","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}
Pub Date : 2018-10-01DOI: 10.1109/bracis.2018.00066
Eduardo Pereira Fressato, Arthur Fortes da Costa, Marcelo Garcia Manzato
In recommender systems (RS) one of the most used approaches is collaborative filtering (CF), which recommends items according to the behavior of similar users. Among CF approaches, those based on matrix factorization are generally more effective because they allow the system to discover the underlying characteristics of interactions between users and items. However, this approach presents the cold-start problem, which occurs because of the system's inability to recommend new items and/or accurately predict new users' preferences. This paper proposes a novel matrix factorization approach, which incorporates similarity of items using their metadata, in order to improve the rating prediction task in an item cold-start scenario. For this purpose, we explore semantic descriptions of items which are gathered from knowledge bases available online. Our approach is evaluated in two different and publicly available datasets and compared against content-based and collaborative algorithms. The experiments show the effectiveness of our approach in the item cold-start scenario.
{"title":"Similarity-Based Matrix Factorization for Item Cold-Start in Recommender Systems","authors":"Eduardo Pereira Fressato, Arthur Fortes da Costa, Marcelo Garcia Manzato","doi":"10.1109/bracis.2018.00066","DOIUrl":"https://doi.org/10.1109/bracis.2018.00066","url":null,"abstract":"In recommender systems (RS) one of the most used approaches is collaborative filtering (CF), which recommends items according to the behavior of similar users. Among CF approaches, those based on matrix factorization are generally more effective because they allow the system to discover the underlying characteristics of interactions between users and items. However, this approach presents the cold-start problem, which occurs because of the system's inability to recommend new items and/or accurately predict new users' preferences. This paper proposes a novel matrix factorization approach, which incorporates similarity of items using their metadata, in order to improve the rating prediction task in an item cold-start scenario. For this purpose, we explore semantic descriptions of items which are gathered from knowledge bases available online. Our approach is evaluated in two different and publicly available datasets and compared against content-based and collaborative algorithms. The experiments show the effectiveness of our approach in the item cold-start scenario.","PeriodicalId":405190,"journal":{"name":"2018 7th Brazilian Conference on Intelligent Systems (BRACIS)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123849110","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：