{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T00:05:31Z","timestamp":1768694731928,"version":"3.49.0"},"reference-count":48,"publisher":"Emerald","issue":"3","license":[{"start":{"date-parts":[[2018,8,20]],"date-time":"2018-08-20T00:00:00Z","timestamp":1534723200000},"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,8,20]]},"abstract":"<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Purpose<\/jats:title>\n<jats:p>In recent years, the increasing complexity of the hyper-connected world demands new approaches for social network analysis. The main challenges are to find new computational methods that allow the representation, characterization and analysis of these social networks. Nowadays, formal concept analysis (FCA) is considered an alternative to identifying conceptual structures in a social network. In this FCA-based work, this paper aims to show the potential of building computational models based on implications to represent and analyze two-mode networks.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Design\/methodology\/approach<\/jats:title>\n<jats:p>This study proposes an approach to find three important substructures in social networks such as conservative access patterns, minimum behavior patterns and canonical access patterns. The present study approach considered as a case study a database containing the access logs of a cable internet service provider.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Findings<\/jats:title>\n<jats:p>The result allows us to uncover access patterns, conservative access patterns and minimum access behavior patterns. Furthermore, through the use of implications sets, the relationships between event-type elements (websites) in two-mode networks are analyzed. This paper discusses, in a generic form, the adopted procedures that can be extended to other social networks.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Originality\/value<\/jats:title>\n<jats:p>A new approach is proposed for the identification of conservative behavior in two-mode networks. The proper implications needed to handle minimum behavior pattern in two-mode networks is also proposed to be analyzed. The one-item conclusion implications are easy to understand and can be more relevant to anyone looking for one particular website access pattern. Finally, a method for a canonical behavior representation in two-mode networks using a canonical set of implications (steam base), which present a minimal set of implications without loss of information, is proposed.<\/jats:p>\n<\/jats:sec>","DOI":"10.1108\/ijwis-10-2017-0067","type":"journal-article","created":{"date-parts":[[2018,7,23]],"date-time":"2018-07-23T19:09:36Z","timestamp":1532372976000},"page":"281-298","source":"Crossref","is-referenced-by-count":3,"title":["Identification of substructures in complex networks using formal concept analysis"],"prefix":"10.1108","volume":"14","author":[{"given":"Sebasti\u00e3o M.","family":"Neto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S\u00e9rgio","family":"Dias","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rokia","family":"Missaoui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luis","family":"Z\u00e1rate","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"Song","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"140","reference":[{"key":"key2020092718105211600_ref001","first-page":"487","article-title":"Fast algorithms for mining association rules","volume-title":"Proc. 20th International Conference Very Large Data Bases, VLDB","year":"1994"},{"key":"key2020092718105211600_ref002","first-page":"580","article-title":"Dependency structures of data base relationships","volume-title":"IFIP Congress","year":"1974"},{"issue":"1","key":"key2020092718105211600_ref003","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 (IJCSSA)"},{"key":"key2020092718105211600_ref004","first-page":"294","article-title":"Recognizing Pseudo-intents is coNP-complete","volume-title":"Proceedings of the 7th International Conference on Concept Lattices and Their Applications","year":"2010"},{"issue":"22","key":"key2020092718105211600_ref005","first-page":"2155","article-title":"The multiple facets of the canonical direct unit implicational basis","volume":"411","year":"2010","journal-title":"Theoretical Computer Science"},{"key":"key2020092718105211600_ref006","first-page":"73","article-title":"Chinese Whispers-an efficient graph clustering algorithm and its application to natural language processing problems","volume-title":"TextGraphs: Graph-based algorithms for Natural Language Processing","year":"2006"},{"key":"key2020092718105211600_ref007","first-page":"83","article-title":"The duality of persons and groups","volume":"15","year":"1997","journal-title":"Contemporary Studies in Sociology"},{"key":"key2020092718105211600_ref008","volume-title":"Concept data analysis: Theory and Applications","year":"2005"},{"key":"key2020092718105211600_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":"key2020092718105211600_ref010","first-page":"91","article-title":"A buzz and e-reputation monitoring tool for twitter based on Galois lattices","volume-title":"International Conference on Conceptual Structures","year":"2011"},{"issue":"2","key":"key2020092718105211600_ref011","first-page":"40","article-title":"Parallelization of the next closure algorithm for generating the minimum set of implication rules","volume":"5","year":"2016","journal-title":"Artificial Intelligence Research"},{"issue":"20","key":"key2020092718105211600_ref012","doi-asserted-by":"crossref","first-page":"7084","DOI":"10.1016\/j.eswa.2015.04.044","article-title":"Concept lattices reduction: definition, analysis and classification","volume":"42","year":"2015","journal-title":"Expert Systems with Applications"},{"key":"key2020092718105211600_ref013","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"},{"issue":"6","key":"key2020092718105211600_ref014","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1016\/j.dam.2010.12.004","article-title":"On the complexity of enumerating pseudo-intents","volume":"159","year":"2011","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"key2020092718105211600_ref015","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"},{"issue":"1","key":"key2020092718105211600_ref016","first-page":"4","article-title":"Visualizing social networks","volume":"1","year":"2000","journal-title":"Journal of Social Structure"},{"key":"key2020092718105211600_ref017","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":"key2020092718105211600_ref018","first-page":"248","article-title":"Graphic techniques for exploring social network data","volume-title":"Models and Methods in Social Network Analysis","year":"2005"},{"key":"key2020092718105211600_ref019","doi-asserted-by":"crossref","first-page":"127","DOI":"10.2307\/271008","article-title":"Using galois lattices to represent network data","volume":"23","year":"1993","journal-title":"Sociological Methodology"},{"issue":"11","key":"key2020092718105211600_ref020","doi-asserted-by":"crossref","first-page":"1129","DOI":"10.1002\/spe.4380211102","article-title":"Graph drawing by force-directed placement","volume":"21","year":"1991","journal-title":"Softw., Pract. Exper"},{"key":"key2020092718105211600_ref021","volume-title":"Formal concept analysis: foundations and Applications","year":"2005"},{"key":"key2020092718105211600_ref022","volume-title":"Formal Concept Analysis - Mathematical Foundations","year":"1999","edition":"1st ed."},{"key":"key2020092718105211600_ref023","first-page":"312","article-title":"Two basic algorithms in concept analysis","volume-title":"Proceedings of the 8th international conference on Formal Concept Analysis","year":"2010"},{"issue":"2","key":"key2020092718105211600_ref024","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"},{"issue":"1","key":"key2020092718105211600_ref025","first-page":"201","article-title":"The strength of weak ties: a network theory revisited","volume":"1","year":"1983","journal-title":"Sociological Theory"},{"key":"key2020092718105211600_ref026","first-page":"5","article-title":"Familles minimales d\u2019implications informatives r\u00e9sultant d\u2019un tableau de donn\u00e9es binaires","volume":"95","year":"1986","journal-title":"Math\u00e9matiques et Sciences Humaines"},{"issue":"6","key":"key2020092718105211600_ref027","doi-asserted-by":"crossref","first-page":"e98679","DOI":"10.1371\/journal.pone.0098679","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"},{"key":"key2020092718105211600_ref028","first-page":"717","article-title":"Canonical computational models based on formal concept analysis for social network analysis and representation","volume-title":"International Conference on Web Services (ICWS) \u2013 IEEE","year":"2015"},{"issue":"3","key":"key2020092718105211600_ref029","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":"key2020092718105211600_ref030","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"},{"issue":"11","key":"key2020092718105211600_ref031","doi-asserted-by":"crossref","first-page":"1994","DOI":"10.1016\/j.dam.2007.04.014","article-title":"Some decision and counting problems of the Duquenne\u2013Guigues basis of implications","volume":"156","year":"2008","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"key2020092718105211600_ref032","first-page":"200","article-title":"Knowledge representation and processing with formal concept analysis","volume":"3","year":"2013","journal-title":"Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery"},{"key":"key2020092718105211600_ref033","doi-asserted-by":"crossref","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":"key2020092718105211600_ref034","volume-title":"Formal Concept Analysis of Social Networks","year":"2017"},{"issue":"16","key":"key2020092718105211600_ref035","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"},{"issue":"16","key":"key2020092718105211600_ref036","doi-asserted-by":"crossref","first-page":"6601","DOI":"10.1016\/j.eswa.2013.05.007","article-title":"Formal concept analysis in knowledge processing: A survey on models and techniques","volume":"40","year":"2013","journal-title":"Expert Systems with Applications"},{"key":"key2020092718105211600_ref037","first-page":"201","article-title":"A concept discovery approach for fighting human trafficking and forced prostitution","volume-title":"International Conference on Conceptual Structures","year":"2011"},{"key":"key2020092718105211600_ref038","first-page":"33","article-title":"Towards a formal concept analysis approach to exploring communities on the world wide web","volume-title":"International Conference on Formal Concept Analysis","year":"2005"},{"issue":"Supplement C","key":"key2020092718105211600_ref039","first-page":"145","article-title":"Complex vague set based concept lattice","volume":"96","year":"2017","journal-title":"Chaos, Solitons & Fractals"},{"issue":"Supplement C","key":"key2020092718105211600_ref040","first-page":"52","article-title":"m-polar fuzzy graph representation of concept lattice","volume":"67","year":"2018","journal-title":"Engineering Applications of Artificial Intelligence"},{"issue":"2","key":"key2020092718105211600_ref041","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"},{"issue":"Supplement C","key":"key2020092718105211600_ref042","first-page":"437","article-title":"Bipolar fuzzy graph representation of concept lattice","volume":"288","year":"2014","journal-title":"Information Sciences"},{"key":"key2020092718105211600_ref043","first-page":"390","article-title":"Understanding social networks using formal concept analysis","volume-title":"Proceedings of the 2008 IEEE\/WIC\/ACM International Conference on Web Intelligence and Intelligent Agent Technology","year":"2008"},{"key":"key2020092718105211600_ref044","first-page":"38","article-title":"Analyzing social networks using FCA: complexity aspects","volume-title":"Web Intelligence and Intelligent Agent Technologies, 2009. WI-IAT\u201909. IEEE\/WIC\/ACM International Joint Conferences On","year":"2009"},{"key":"key2020092718105211600_ref045","volume-title":"Handbook of Graph Drawing and Visualization (Discrete Mathematics and Its Applications)","year":"2013","edition":"1st ed."},{"key":"key2020092718105211600_ref046","first-page":"49","article-title":"Computing proper implications","volume-title":"Proceedings of ICCS-2001 International Workshop on Concept Lattices-Based Theory, Methods and Tools for Knowledge Discovery in Databases (CLKDD\u201901)","year":"2001"},{"key":"key2020092718105211600_ref047","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":"2","key":"key2020092718105211600_ref048","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/s10844-013-0242-y","article-title":"Formal concept analysis approach for data extraction from a limited deep web database","volume":"41","year":"2013","journal-title":"Journal of Intelligent Information Systems"}],"container-title":["International Journal of Web Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/IJWIS-10-2017-0067\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/IJWIS-10-2017-0067\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T22:24:20Z","timestamp":1753395860000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/ijwis\/article\/14\/3\/281-298\/166985"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,20]]},"references-count":48,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,8,20]]}},"alternative-id":["10.1108\/IJWIS-10-2017-0067"],"URL":"https:\/\/doi.org\/10.1108\/ijwis-10-2017-0067","relation":{},"ISSN":["1744-0084"],"issn-type":[{"value":"1744-0084","type":"print"}],"subject":[],"published":{"date-parts":[[2018,8,20]]}}}