Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleNovember 2021
A graph-based approach for positive and unlabeled learning
Information Sciences: an International Journal (ISCI), Volume 580, Issue CPages 655–672https://doi.org/10.1016/j.ins.2021.08.099Highlights- Proposal of a graph-based method for Positive and Unlabeled Learning that uses graph-based strategies in all steps.
Positive and Unlabeled Learning (PUL) uses unlabeled documents and a few positive documents for retrieving a set of “interest” documents from a text collection. Usually, PUL approaches are based on the vector space model. However, when ...
- research-articleApril 2020
A benchmarking tool for the generation of bipartite network models with overlapping communities
Knowledge and Information Systems (KAIS), Volume 62, Issue 4Pages 1641–1669https://doi.org/10.1007/s10115-019-01411-9AbstractMany real-world networks display hidden community structures with important potential implications in their dynamics. Many algorithms highly relevant to network analysis have been introduced to unveil community structures. Accurate assessment and ...
- research-articleJanuary 2020
Unsupervised learning of textual pattern based on Propagation in Bipartite Graph
Graph-based algorithms have aroused considerable interests in recent years by facilitating pattern recognition and learning via information propagation process through the graph. Here, we propose an unsupervised learning algorithm based on ...
- research-articleFebruary 2017
RGCLI
Neurocomputing (NEUROC), Volume 226, Issue CPages 238–248https://doi.org/10.1016/j.neucom.2016.11.053Graph-based semi-supervised learning (SSL) provides a powerful framework for the modeling of manifold structures in high-dimensional spaces. Additionally, graph representation is effective for the propagation of the few initial labels existing in ...
- research-articleFebruary 2017
Optimizing the class information divergence for transductive classification of texts using propagation in bipartite graphs
Pattern Recognition Letters (PTRL), Volume 87, Issue CPages 127–138https://doi.org/10.1016/j.patrec.2016.04.006Scalable algorithm based on bipartite graphs to perform transduction learning.Label propagation procedure that uses class information associated with vertices and edges.Better performance than state-of-the-art algorithms based on vector space or ...
- short-paperJuly 2016
The Extraction from News Stories a Causal Topic Centred Bayesian Graph for Sugarcane
IDEAS '16: Proceedings of the 20th International Database Engineering & Applications SymposiumPages 364–369https://doi.org/10.1145/2938503.2938521Sugarcane is an important product to the Brazilian economy because it is the primary ingredient of ethanol which is used as a gasoline substitute. Sugarcane is affected by many factors which can be modelled in a Bayesian Graph. This paper describes a ...
- research-articleJune 2016
Neighborhood graph construction for semi-supervised learning
Semi-supervised learning (SSL) is useful when few labeled and plenty of unlabeled examples are available. This occurs in most of the cases due to labeled instances be difficult, expensive and time consuming to be obtained since human experts are ...
- ArticleJuly 2015
Influence maximization based on the least influential spreaders
The emergence of social media increases the need for the recognization of social influence mainly motivated by online advertising, political and health campaigns, recommendation systems, epidemiological study, etc. In spreading processes, it is possible ...
- ArticleJuly 2015
Bipartite graph for topic extraction
IJCAI'15: Proceedings of the 24th International Conference on Artificial IntelligencePages 4361–4362This article presents a bipartite graph propagation method to be applied to different tasks in the machine learning unsupervised domain, such as topic extraction and clustering. We introduce the objectives and hypothesis that motivate the use of graph ...
- ArticleJuly 2015
Graph construction for semi-supervised learning
IJCAI'15: Proceedings of the 24th International Conference on Artificial IntelligencePages 4343–4344Semi-Supervised Learning (SSL) techniques have become very relevant since they require a small set of labeled data. In this scenario, graph-based SSL algorithms provide a powerful framework for modeling manifold structures in high-dimensional spaces and ...
- research-articleApril 2015
A naïve Bayes model based on overlapping groups for link prediction in online social networks
SAC '15: Proceedings of the 30th Annual ACM Symposium on Applied ComputingPages 1136–1141https://doi.org/10.1145/2695664.2695719Link prediction in online social networks is useful in numerous applications, mainly for recommendation. Recently, different approaches have considered friendship groups information for increasing the link prediction accuracy. Nevertheless, these ...
- ArticleMarch 2013
Learning bayesian network using parse trees for extraction of protein-protein interaction
CICLing'13: Proceedings of the 14th international conference on Computational Linguistics and Intelligent Text Processing - Volume 2Pages 347–358https://doi.org/10.1007/978-3-642-37256-8_29Extraction of protein-protein interactions from scientific papers is a relevant task in the biomedical field. Machine learning-based methods such as kernel-based represent the state-of-the-art in this task. Many efforts have focused on obtaining new ...
- research-articleMarch 2013
Comparing relational and non-relational algorithms for clustering propositional data
- Robson Motta,
- Alneu de Andrade Lopes,
- Bruno M. Nogueira,
- Solange O. Rezende,
- Alípio M. Jorge,
- Maria Cristina Ferreira de Oliveira
SAC '13: Proceedings of the 28th Annual ACM Symposium on Applied ComputingPages 150–155https://doi.org/10.1145/2480362.2480393Cluster detection methods are widely studied in Propositional Data Mining. In this context, data is individually represented as a feature vector. This data has a natural non-relational structure, but can be represented in a relational form through ...
- ArticleDecember 2012
Inductive Model Generation for Text Categorization Using a Bipartite Heterogeneous Network
ICDM '12: Proceedings of the 2012 IEEE 12th International Conference on Data MiningPages 1086–1091https://doi.org/10.1109/ICDM.2012.130Usually, algorithms for categorization of numeric data have been applied for text categorization after a preprocessing phase which assigns weights for textual terms deemed as attributes. However, due to characteristics of textual data, some algorithms ...
- ArticleOctober 2012
Link prediction in complex networks based on cluster information
SBIA'12: Proceedings of the 21st Brazilian conference on Advances in Artificial IntelligencePages 92–101https://doi.org/10.1007/978-3-642-34459-6_10Cluster in graphs is densely connected group of vertices sparsely connected to other groups. Hence, for prediction of a future link between a pair of vertices, these vertices common neighbors may play different roles depending on if they belong or not ...
- ArticleAugust 2010
Combining Local and Global KNN With Cotraining
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial IntelligencePages 815–820Semi-supervised learning is a machine learning paradigm in which the induced hypothesis is improved by taking advantage of unlabeled data. It is particularly useful when labeled data is scarce. Cotraining is a widely adopted semi-supervised approach ...
- ArticleMay 2005
Efficient Identification of Duplicate Bibliographical References
Proceedings of the 2005 conference on Advances in Logic Based Intelligent Systems: Selected Papers of LAPTEC 2005Pages 169–176In this work we present an approach to extract and to structure bibliographical references from BibTex files, allowing the identification of the duplicate ones, which can appear slightly different in different files. To deal with this problem, existing ...