{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T06:09:39Z","timestamp":1769148579386,"version":"3.49.0"},"reference-count":35,"publisher":"Emerald","issue":"1","license":[{"start":{"date-parts":[[2019,9,23]],"date-time":"2019-09-23T00:00:00Z","timestamp":1569196800000},"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":[[2019,9,23]]},"abstract":"<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Purpose<\/jats:title>\n<jats:p>The purpose of this paper is to present an algorithm for detecting communities in social networks.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Design\/methodology\/approach<\/jats:title>\n<jats:p>The majority of existing methods of community detection in social networks are based on structural information, and they neglect the content information. In this paper, the authors propose a novel approach that combines the content and structure information to discover more meaningful communities in social networks. To integrate the content information in the process of community detection, the authors propose to exploit the texts involved in social networks to identify the users\u2019 topics of interest. These topics are detected based on the statistical and semantic measures, which allow us to divide the users into different groups so that each group represents a distinct topic. Then, the authors perform links analysis in each group to discover the users who are highly interconnected (communities).<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Findings<\/jats:title>\n<jats:p>To validate the performance of the approach, the authors carried out a set of experiments on four real life data sets, and they compared their method with classical methods that ignore the content information.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Originality\/value<\/jats:title>\n<jats:p>The experimental results demonstrate that the quality of community structure is improved when we take into account the content and structure information during the procedure of community detection.<\/jats:p>\n<\/jats:sec>","DOI":"10.1108\/ijwis-06-2019-0030","type":"journal-article","created":{"date-parts":[[2019,10,3]],"date-time":"2019-10-03T09:18:04Z","timestamp":1570094284000},"page":"79-93","source":"Crossref","is-referenced-by-count":6,"title":["A new algorithm for detecting communities in social networks based on content and structure information"],"prefix":"10.1108","volume":"16","author":[{"given":"ELyazid","family":"Akachar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Brahim","family":"Ouhbi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bouchra","family":"Frikh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"140","reference":[{"key":"key2020042309454890400_ref001","first-page":"513","article-title":"Static community detection algorithms for evolving networks","year":"2010"},{"issue":"10","key":"key2020042309454890400_ref002","doi-asserted-by":"crossref","first-page":"P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","article-title":"Fast unfolding of communities in large networks","volume":"2008","year":"2008","journal-title":"Journal of Statistical Mechanics: Theory and Experiment"},{"issue":"3","key":"key2020042309454890400_ref003","doi-asserted-by":"crossref","first-page":"033403","DOI":"10.1088\/1742-5468\/2016\/03\/033403","article-title":"A divisive spectral method for network community detection","volume":"2016","year":"2016","journal-title":"Journal of Statistical Mechanics: Theory and Experiment"},{"issue":"10","key":"key2020042309454890400_ref004","doi-asserted-by":"crossref","first-page":"P10012","DOI":"10.1088\/1742-5468\/2004\/10\/P10012","article-title":"Detecting network communities: a new systematic and efficient algorithm","volume":"2004","year":"2004","journal-title":"Journal of Statistical Mechanics: Theory and Experiment"},{"key":"key2020042309454890400_ref005","volume-title":"OntologyLine: A New Framework for Learning Non-Taxonomic Relations of Domain Ontology","year":"2016"},{"issue":"3","key":"key2020042309454890400_ref006","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1108\/IJWIS-04-2017-0024","article-title":"Learning domain taxonomies: the TaxoLine approach","volume":"13","year":"2017","journal-title":"International Journal of Web Information Systems"},{"key":"key2020042309454890400_ref007","first-page":"257","article-title":"A comparative study of some algorithms for detecting communities in social networks","year":"2016"},{"issue":"3\/5","key":"key2020042309454890400_ref008","first-page":"75","article-title":"Community detection in graphs","volume":"486","year":"2010","journal-title":"Physics Reports"},{"key":"key2020042309454890400_ref009","first-page":"1","article-title":"Community detection and recommender systems","volume-title":"Encyclopedia of Social Network Analysis and Mining","year":"2017"},{"issue":"12","key":"key2020042309454890400_ref010","doi-asserted-by":"crossref","first-page":"7821","DOI":"10.1073\/pnas.122653799","article-title":"Community structure in social and biological networks","volume":"99","year":"2002","journal-title":"Proceedings of the National Academy of Sciences of Sciences"},{"key":"key2020042309454890400_ref011","volume-title":"Advances in Minimum Description Length: theory and Applications","year":"2005"},{"issue":"6","key":"key2020042309454890400_ref012","doi-asserted-by":"crossref","first-page":"785","DOI":"10.1109\/TKDE.2008.141","article-title":"Communities and emerging semantics in semantic link network: discovery and learning","volume":"21","year":"2009","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"1","key":"key2020042309454890400_ref013","first-page":"P0102","article-title":"Identification of overlapping communities and their hierarchy by locally calculating community-changing resolution levels","volume":"2011","year":"2010","journal-title":"Journal of Statistical Mechanics: Theory and Experiment"},{"issue":"9","key":"key2020042309454890400_ref014","doi-asserted-by":"crossref","first-page":"1098","DOI":"10.1109\/JRPROC.1952.273898","article-title":"A method for the construction of minimum-redundancy codes","volume":"40","year":"1952","journal-title":"Proceedings of the IRE"},{"issue":"3","key":"key2020042309454890400_ref015","doi-asserted-by":"crossref","first-page":"033015","DOI":"10.1088\/1367-2630\/11\/3\/033015","article-title":"Detecting the overlapping and hierarchical community structure in complex networks","volume":"11","year":"2009","journal-title":"New Journal of Physics"},{"issue":"4","key":"key2020042309454890400_ref016","doi-asserted-by":"crossref","first-page":"e18961","DOI":"10.1371\/journal.pone.0018961","article-title":"Finding statistically significant communities in networks","volume":"6","year":"2011","journal-title":"PLoS One"},{"key":"key2020042309454890400_ref017","article-title":"Detecting highly overlapping community structure by greedy clique expansion","year":"2010"},{"issue":"23","key":"key2020042309454890400_ref018","doi-asserted-by":"crossref","first-page":"8577","DOI":"10.1073\/pnas.0601602103","article-title":"Modularity and community structure in networks","volume":"103","year":"2006","journal-title":"Proceedings of the National Academy of Sciences"},{"issue":"5","key":"key2020042309454890400_ref019","doi-asserted-by":"crossref","first-page":"052315","DOI":"10.1103\/PhysRevE.94.052315","article-title":"Equivalence between modularity optimization and maximum likelihood methods for community detection","volume":"94","year":"2016","journal-title":"Physical Review E"},{"issue":"6","key":"key2020042309454890400_ref020","doi-asserted-by":"crossref","first-page":"066133","DOI":"10.1103\/PhysRevE.69.066133","article-title":"Fast algorithm for detecting community structure in networks","volume":"69","year":"2004","journal-title":"Physical Review E"},{"issue":"2","key":"key2020042309454890400_ref021","first-page":"026113","article-title":"Finding and evaluating community structure in networks","volume":"69","year":"2003","journal-title":"Physical Review E"},{"issue":"7043","key":"key2020042309454890400_ref022","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1038\/nature03607","article-title":"Uncovering the overlapping community structure of complex networks in nature and society","volume":"435","year":"2005","journal-title":"Nature"},{"key":"key2020042309454890400_ref023","first-page":"2008","article-title":"Social topic models for community extraction","volume":"8","year":"2008","journal-title":"The 2nd SNA-KDD Workshop"},{"key":"key2020042309454890400_ref024","volume-title":"Survey on Social Community Detection","year":"2013"},{"key":"key2020042309454890400_ref025","article-title":"Computing communities in large networks using random walks","year":"2005"},{"key":"key2020042309454890400_ref035","first-page":"534","article-title":"Community detection with edge content in social media networks","year":"2012"},{"issue":"3","key":"key2020042309454890400_ref026","doi-asserted-by":"crossref","first-page":"036106","DOI":"10.1103\/PhysRevE.76.036106","article-title":"Near linear time algorithm to detect community structures in large-scale networks","volume":"76","year":"2007","journal-title":"Physical Review E"},{"issue":"4","key":"key2020042309454890400_ref027","first-page":"1118","article-title":"Maps of random walks on complex networks reveal community structure","volume":"105","year":"2007","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"key2020042309454890400_ref028","doi-asserted-by":"crossref","first-page":"785","DOI":"10.1016\/j.future.2018.06.010","article-title":"Iterated greedy algorithm for performing community detection in social networks","volume":"88","year":"2018","journal-title":"Future Generation Computer Systems"},{"key":"key2020042309454890400_ref029","volume-title":"Social Network Analysis","year":"1994"},{"issue":"4","key":"key2020042309454890400_ref030","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2501654.2501657","article-title":"Overlapping community detection in networks","volume":"45","year":"2013","journal-title":"ACM Computing Surveys"},{"key":"key2020042309454890400_ref031","first-page":"927","article-title":"Combining link and content for community detection","volume-title":"Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining \u2013 KDD \u201909","year":"2009"},{"issue":"5","key":"key2020042309454890400_ref032","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1109\/TKDE.2007.190740","article-title":"Text clustering with feature selection by using statistical data","volume":"20","year":"2008","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"5","key":"key2020042309454890400_ref033","doi-asserted-by":"crossref","first-page":"6078","DOI":"10.1016\/j.eswa.2011.12.003","article-title":"Feature subset selection with cumulate conditional mutual information minimization","volume":"39","year":"2012","journal-title":"Expert Systems with Applications"},{"key":"key2020042309454890400_ref034","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1016\/j.knosys.2011.07.017","article-title":"Topic oriented community detection through social objects and link analysis in social networks","volume":"26","year":"2012","journal-title":"Knowledge-Based 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-06-2019-0030\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/IJWIS-06-2019-0030\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T22:24:09Z","timestamp":1753395849000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/ijwis\/article\/16\/1\/79-93\/164028"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,23]]},"references-count":35,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,9,23]]}},"alternative-id":["10.1108\/IJWIS-06-2019-0030"],"URL":"https:\/\/doi.org\/10.1108\/ijwis-06-2019-0030","relation":{},"ISSN":["1744-0084","1744-0084"],"issn-type":[{"value":"1744-0084","type":"print"},{"value":"1744-0084","type":"print"}],"subject":[],"published":{"date-parts":[[2019,9,23]]}}}