Julio Neves
ABSTRACT
Triadic Concept Analysis (TCA) is an applied mathematical technique for data analysis which the relations between objects, attributes and conditions are identified. However, the volume of information to be processed could make TCA impracticable. For example, with the increasing of social network for personal (Facebook) and professional (LinkedIn) usage, more and more applications of data analysis on environments with high dimensionality (Big Data) have been discussed in the literature. This paper has as an objective to evaluate the behavior of the TRIAS algorithm in order to extract triadic concepts in high dimensional contexts. The experiments shows that our approach has a better performance - up to 33% faster - than its original algorithm.
- S. B. Akers. 1978. Binary Decision Diagrams. IEEE Trans. Comput. C-27, 6 (June 1978), 509--516. Google Scholar
Digital Library
- Kaio Ananias, Julio Neves, Pedro Ruas, Luis Zarate, and Mark Song. 2019. Manipulating Triadic Concept Analysis Contexts through Binary Decision Diagrams. International Conference on Enterprise Information Systems (ICEIS) 1 (2019), 182--189.Google ScholarCross Ref
- Randal E Bryant. 1986. Graph-based algorithms for boolean function manipulation. Computers, IEEE Transactions on 100, 8 (1986), 677--691.Google ScholarDigital Library
- Randal E. Bryant. 1986. Graph-Based Algorithms for Boolean Function Manipulation. IEEE Trans. Comput. 35, 8 (Aug. 1986), 677--691. Google ScholarDigital Library
- Robert Jaschke, Andreas Hotho, Christoph Schmitz, Bernhard Ganter, and Gerd Stumme. 2006. TRIAS-An Algorithm for Mining Iceberg Tri-Lattices. In Data Mining, 2006. ICDM'06. Sixth International Conference on. IEEE, 907--911.Google ScholarDigital Library
- Fritz Lehmann and Rudolf Wille. 1995. A triadic approach to formal concept analysis. Conceptual structures: applications, implementation and theory (1995), 32--43.Google Scholar
- Rokia Missaoui and Léonard Kwuida. 2011. Mining triadic association rules from ternary relations. In International Conference on Formal Concept Analysis. Springer, 204--218.Google ScholarCross Ref
- Yuchang Mo, Liudong Xing, Farong Zhong, Zhusheng Pan, and Zhongyu Chen. 2014. Choosing a heuristic and root node for edge ordering in BDD-based network reliability analysis. Reliability Engineering and System Safety 131 (2014), 83 -- 93. Google ScholarCross Ref
- Sebastiao M Neto, Luis E Zárate, and Mark AJ Song. 2018. Handling high dimensionality contexts in formal concept analysis via binary decision diagrams. Information Sciences 429 (2018), 361--376.Google ScholarDigital Library
- John Old and Uta Priss. 2006. Some open problems in formal concept analysis. Problems presented at International Conference on Formal Concept Analysis (ICFCA).Google Scholar
- Jian Pei, Jiawei Han, Runying Mao, et al. 2000. CLOSET: An Efficient Algorithm for Mining Frequent Closed Itemsets.. In ACM SIGMOD workshop on research issues in data mining and knowledge discovery, Vol. 4. 21--30.Google Scholar
- Ansaf Salleb, Zahir Maazouzi, and Christel Vrain. 2002. Mining maximal frequent itemsets by a boolean based approach. In European Conf. on Artificial Intelligence, Lyon France (July 2002). 285 -- 289.Google Scholar
- Phillip Santos, Julio Neves, Paula Silva, Sérgio M Dias, Luis Zárate, and Mark Song. 2018. An Approach to Extract Proper Implications Set from High-dimension Formal Contexts using Binary Decision Diagram. (2018).Google Scholar
- Rudolf Wille. 1995. The basic theorem of triadic concept analysis. Order 12, 2 (1995), 149--158.Google ScholarCross Ref
Index Terms
- Applying binary decision diagram to extract concepts from triadic formal context
Recommendations
Will Triadic Closure Strengthen Ties in Social Networks?
The social triad—a group of three people—is one of the simplest and most fundamental social groups. Extensive network and social theories have been developed to understand its structure, such as triadic closure and social balance. Over the course of a ...
Learning to predict reciprocity and triadic closure in social networks
We study how links are formed in social networks. In particular, we focus on investigating how a reciprocal (two-way) link, the basic relationship in social networks, is developed from a parasocial (one-way) relationship and how the relationships ...
Binary Decision Diagram (BDD)
ICFCC '09: Proceedings of the 2009 International Conference on Future Computer and Communicationthe primary aim of computer science is invention of new data structures and algorithms. Those data structures and algorithms could significantly help us to solve unsolved problems or let us give much better solutions for the already solved problems. In ...
Comments