{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T17:34:58Z","timestamp":1754156098376,"version":"3.41.2"},"reference-count":44,"publisher":"Emerald","issue":"1","license":[{"start":{"date-parts":[[2018,4,16]],"date-time":"2018-04-16T00:00:00Z","timestamp":1523836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.emerald.com\/insight\/site-policies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IJWIS"],"published-print":{"date-parts":[[2018,4,16]]},"abstract":"<jats:sec><jats:title content-type=\"abstract-subheading\">Purpose<\/jats:title><jats:p>Currently, social network (SN) analysis is focused on the discovery of activity and social relationship patterns. Usually, these relationships are not easily and completely observed. Therefore, it is relevant to discover substructures and potential behavior patterns in SN. Recently, formal concept analysis (FCA) has been applied for this purpose. FCA is a concept analysis theory that identifies concept structures within a data set. The representation of SN patterns through implication rules based on FCA enables the identification of relevant substructures that cannot be easily identified. The authors\u2019 approach considers a minimum and irreducible set of implication rules (stem base) to represent the complete set of data (activity in the network). Applying this to an SN is of interest because it can represent all the relationships using a reduced form. So, the purpose of this paper is to represent social networks through the steam base.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-subheading\">Design\/methodology\/approach<\/jats:title><jats:p>The authors\u2019 approach permits to analyze two-mode networks by transforming access activities of SN into a formal context. From this context, it can be extracted to a minimal set of implications applying the NextClosure algorithm, which is based on the closed sets theory that provides to extract a complete, minimal and non-redundant set of implications. Based on the minimal set, the authors analyzed the relationships between premises and their respective conclusions to find basic user behaviors.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-subheading\">Findings<\/jats:title><jats:p>The experiments pointed out that implications, represented as a complex network, enable the identification and visualization of minimal substructures, which could not be found in two-mode network representation. The results also indicated that relations among premises and conclusions represent navigation behavior of SN functionalities. This approach enables to analyze the following behaviors: conservative, transitive, main functionalities and access time. The results also demonstrated that the relations between premises and conclusions represented the navigation behavior based on the functionalities of SN. The authors applied their approach for an SN for a relationship to explore the minimal access patterns of navigation.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-subheading\">Originality\/value<\/jats:title><jats:p>The authors present an FCA-based approach to obtain the minimal set of implications capable of representing the minimum structure of the users\u2019 behavior in an SN. The paper defines and analyzes three types of rules that form the sets of implications. These types of rules define substructures of the network, the capacity of generation users\u2019 behaviors, transitive behavior and conservative capacity when the temporal aspect is considered.<\/jats:p><\/jats:sec>","DOI":"10.1108\/ijwis-04-2017-0028","type":"journal-article","created":{"date-parts":[[2018,2,27]],"date-time":"2018-02-27T19:07:35Z","timestamp":1519758455000},"page":"62-77","source":"Crossref","is-referenced-by-count":1,"title":["Minimal implications base for social network analysis"],"prefix":"10.1108","volume":"14","author":[{"given":"Paula","family":"Raissa","sequence":"first","affiliation":[]},{"given":"S\u00e9rgio","family":"Dias","sequence":"additional","affiliation":[]},{"given":"Mark","family":"Song","sequence":"additional","affiliation":[]},{"given":"Luis","family":"Z\u00e1rate","sequence":"additional","affiliation":[]}],"member":"140","reference":[{"issue":"1","key":"key2020093012382824100_ref001","doi-asserted-by":"crossref","first-page":"73","DOI":"10.4018\/ijcssa.2013010104","article-title":"Advances in FCA-based applications for social networks analysis","volume":"1","year":"2013","journal-title":"International Journal of Conceptual Structures and Smart Applications"},{"key":"key2020093012382824100_ref002","first-page":"43","article-title":"Comparing performance of algorithms for generating the Duquenne-Guigues basis","volume":"959","year":"2011","journal-title":"CLA \u2013 Concept Lattices and Their Applications"},{"issue":"1","key":"key2020093012382824100_ref003","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1145\/320064.320066","article-title":"Computational problems related to the design of normal form relational schemas","volume":"4","year":"1979","journal-title":"ACM Transactions on Database Systems (TODS)"},{"key":"key2020093012382824100_ref004","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1145\/1644893.1644900","article-title":"Characterizing user behavior in online social networks","volume-title":"Proceedings of the 9th ACM SIGCOMM Conference on Internet Measurement","year":"2009"},{"issue":"4","key":"key2020093012382824100_ref005","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1108\/IJWIS-04-2016-0022","article-title":"The role of developers\u2019 social relationships in improving service selection","volume":"12","year":"2016","journal-title":"International Journal of Web Information Systems"},{"first-page":"73","article-title":"Chinese whispers: an efficient graph clustering algorithm and its application to natural language processing problems","year":"2006","key":"key2020093012382824100_ref006"},{"issue":"2","key":"key2020093012382824100_ref007","doi-asserted-by":"crossref","first-page":"181","DOI":"10.2307\/2576011","article-title":"The duality of persons and groups","volume":"53","year":"1974","journal-title":"Social Forces"},{"key":"key2020093012382824100_ref008","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1016\/j.is.2017.01.008","article-title":"Formal concept analysis for topic detection: a clustering quality experimental analysis","volume":"66","year":"2017","journal-title":"Information Systems"},{"key":"key2020093012382824100_ref009","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1016\/j.knosys.2015.07.018","article-title":"Knowledge discovery in social networks by using a logic-based treatment of implications","volume":"87","year":"2015","journal-title":"Knowledge-Based Systems"},{"key":"key2020093012382824100_ref010","first-page":"91","article-title":"A buzz and e-reputation monitoring tool for Twitter based on galois lattices","volume-title":"Conceptual Structures for Discovering Knowledge","year":"2011"},{"key":"key2020093012382824100_ref011","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1016\/j.ins.2017.02.037","article-title":"A methodology for analysis of concept lattice reduction","volume":"396","year":"2017","journal-title":"Information Sciences"},{"key":"key2020093012382824100_ref012","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.ins.2015.12.013","article-title":"Using minimal generators for composite isolated point extraction and conceptual binary relation coverage: application for extracting relevant textual features","volume":"336","year":"2016","journal-title":"Information Sciences"},{"issue":"3","key":"key2020093012382824100_ref013","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0378-8733(95)00271-5","article-title":"Cliques, galois lattices, and the structure of human social groups","volume":"18","year":"1996","journal-title":"Social Networks"},{"key":"key2020093012382824100_ref014","first-page":"39","article-title":"Finding social groups: a meta-analysis of the southern women data","volume-title":"Dynamic Social Network Modeling and Analysis","year":"2003"},{"key":"key2020093012382824100_ref015","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1017\/CBO9780511811395.012","article-title":"Graphic techniques for exploring social network data","volume-title":"Models and Methods in Social Network Analysis","year":"2005"},{"volume-title":"Formal Concept Analysis: Foundations and Applications","year":"2005","key":"key2020093012382824100_ref016"},{"volume-title":"Formal Concept Analysis: Mathematical Foundations","year":"2012","key":"key2020093012382824100_ref017"},{"issue":"2","key":"key2020093012382824100_ref018","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/1117454.1117456","article-title":"Link mining: a survey","volume":"7","year":"2005","journal-title":"ACM SIGKDD Explorations Newsletter"},{"first-page":"195","article-title":"Caracterizac\u00b8\u02dcao de padro\u02dces de acesso de usu\u00e1rios do Orkut","year":"2010","key":"key2020093012382824100_ref019"},{"issue":"1","key":"key2020093012382824100_ref020","first-page":"5","article-title":"Familles minimales d\u2019implications informatives r\u00e9sultant d\u2019un tableau de don\u0144ees binaires","volume":"95","year":"1986","journal-title":"Math\u00c9matiques Et Sciences Humaines"},{"key":"key2020093012382824100_ref021","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.neucom.2015.10.141","article-title":"k-cliques mining in dynamic social networks based on triadic formal concept analysis","volume":"209","year":"2016","journal-title":"Neurocomputing"},{"issue":"6","key":"key2020093012382824100_ref022","first-page":"1","article-title":"Forceatlas2, a continuous graph layout algorithm for handy network visualization designed for the gephi software","volume":"9","year":"2014","journal-title":"PloS One"},{"issue":"1","key":"key2020093012382824100_ref023","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/s13278-016-0386-1","article-title":"A survey on game theoretic models for community detection in social networks","volume":"6","year":"2016","journal-title":"Social Network Analysis and Mining"},{"key":"key2020093012382824100_ref024","first-page":"717","article-title":"Canonical computational models based on formal concept analysis for social network analysis and representation","volume-title":"Web Services (ICWS), 2015 IEEE International Conference on","year":"2015"},{"first-page":"41","article-title":"Social network and formal concept analysis","year":"2014","key":"key2020093012382824100_ref025"},{"issue":"3","key":"key2020093012382824100_ref026","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1080\/08839514.2012.648457","article-title":"Fuzzy clustering-based formal concept analysis for association rules mining","volume":"26","year":"2012","journal-title":"Applied Artificial Intelligence"},{"issue":"3","key":"key2020093012382824100_ref027","doi-asserted-by":"crossref","first-page":"2696","DOI":"10.1016\/j.eswa.2009.09.026","article-title":"Concept lattice reduction using fuzzy k-means clustering","volume":"37","year":"2010","journal-title":"Expert Systems with Applications"},{"key":"key2020093012382824100_ref028","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.ijar.2016.08.007","article-title":"Comparison of reduction in formal decision contexts","volume":"80","year":"2017","journal-title":"International Journal of Approximate Reasoning"},{"key":"key2020093012382824100_ref029","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/j.ins.2014.12.010","article-title":"Concept learning via granular computing: a cognitive viewpoint","volume":"298","year":"2015","journal-title":"Information Sciences"},{"key":"key2020093012382824100_ref030","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.ins.2016.03.009","article-title":"Quality cover: efficient binary relation coverage guided by induced knowledge quality","volume":"355\/356","year":"2016","journal-title":"Information Sciences"},{"issue":"4","key":"key2020093012382824100_ref031","first-page":"1","article-title":"Identifying public health policymakers\u2019 sources of information: comparing survey and network analyses","volume":"25","year":"2015","journal-title":"The European Journal of Public Health"},{"key":"key2020093012382824100_ref032","first-page":"201","article-title":"A concept discovery approach for fighting human trafficking and forced prostitution","volume-title":"Conceptual Structures for Discovering Knowledge","year":"2011"},{"issue":"16","key":"key2020093012382824100_ref033","doi-asserted-by":"crossref","first-page":"6538","DOI":"10.1016\/j.eswa.2013.05.009","article-title":"Formal concept analysis in knowledge processing: a survey on applications","volume":"40","year":"2013","journal-title":"Expert Systems with Applications"},{"key":"key2020093012382824100_ref034","first-page":"33","article-title":"Towards a formal concept analysis approach to exploring communities on the world wide web","volume-title":"Formal Concept Analysis: Third International Conference, ICFCA 2005","year":"2005"},{"issue":"1","key":"key2020093012382824100_ref035","article-title":"Your social network profile reveals you","volume":"13","year":"2017","journal-title":"International Journal of Web Information Systems"},{"issue":"2","key":"key2020093012382824100_ref036","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1515\/amcs-2016-0035","article-title":"A comprehensive survey on formal concept analysis, its research trends and applications","volume":"26","year":"2016","journal-title":"International Journal of Applied Mathematics and Computer Science"},{"key":"key2020093012382824100_ref037","first-page":"357","article-title":"Hierarchical topic modeling based on the combination of formal concept analysis and singular value decomposition","volume-title":"Multimedia and Network Information Systems","year":"2017"},{"volume-title":"Handbook of Graph Drawing and Visualization","year":"2013","key":"key2020093012382824100_ref038"},{"issue":"1","key":"key2020093012382824100_ref039","first-page":"127","article-title":"Using galois lattices to represent network data","volume":"23","year":"1993","journal-title":"Sociological Methodology"},{"key":"key2020093012382824100_ref040","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1007\/978-94-009-7798-3_15","article-title":"Restructuring lattice theory: an approach based on hierarchies of concepts","volume-title":"Ordered Sets","year":"1982"},{"issue":"3","key":"key2020093012382824100_ref041","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1108\/IJWIS-03-2016-0012","article-title":"Twitter user tagging method based on burst time series","volume":"12","year":"2016","journal-title":"International Journal of Web Information Systems"},{"key":"key2020093012382824100_ref042","first-page":"127","article-title":"System of data analysis concept explorer","volume-title":"Proceedings of the 7th national conference on Artificial Intelligence KII-2000","year":"2000"},{"issue":"4\/5","key":"key2020093012382824100_ref043","first-page":"718","article-title":"Qualitative behavior rules for the cold rolling process extracted from trained ANN via the FCANN method","volume":"22","year":"2009","journal-title":"Engineering Applications of Artificial Intelligence"},{"issue":"13\/15","key":"key2020093012382824100_ref044","first-page":"2670","article-title":"FCANN: a new approach for extraction and representation of knowledge from ANN trained via formal concept analysis","volume":"71","year":"2008","journal-title":"Neurocomputing"}],"container-title":["International Journal of Web Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/IJWIS-04-2017-0028\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/IJWIS-04-2017-0028\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T22:23:58Z","timestamp":1753395838000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/ijwis\/article\/14\/1\/62-77\/164986"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4,16]]},"references-count":44,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,4,16]]}},"alternative-id":["10.1108\/IJWIS-04-2017-0028"],"URL":"https:\/\/doi.org\/10.1108\/ijwis-04-2017-0028","relation":{},"ISSN":["1744-0084"],"issn-type":[{"type":"print","value":"1744-0084"}],"subject":[],"published":{"date-parts":[[2018,4,16]]}}}