untitled
<OAI-PMH schemaLocation=http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd>
<responseDate>2018-01-17T12:18:49Z</responseDate>
<request identifier=oai:HAL:hal-01637554v1 verb=GetRecord metadataPrefix=oai_dc>http://api.archives-ouvertes.fr/oai/hal/</request>
<GetRecord>
<record>
<header>
<identifier>oai:HAL:hal-01637554v1</identifier>
<datestamp>2017-12-21</datestamp>
<setSpec>type:COMM</setSpec>
<setSpec>subject:info</setSpec>
<setSpec>collection:UNIV-AG</setSpec>
<setSpec>collection:BNRMI</setSpec>
</header>
<metadata><dc>
<publisher>HAL CCSD</publisher>
<title lang=en>PALM: A Parallel Mining Algorithm for Extracting Maximal Frequent Conceptual Links from Social Networks</title>
<creator>Stattner, Erick</creator>
<creator>Reynald, Eugenie</creator>
<creator>Collard, Martine</creator>
<contributor>Laboratoire de Mathématiques Informatique et Applications (LAMIA) ; Université des Antilles et de la Guyane (UAG)</contributor>
<description>International audience</description>
<source>28th International Conference on Database and Expert Systems Applications (DEXA)</source>
<source>International Conference on Database and Expert Systems Applications</source>
<coverage>Lyon, France</coverage>
<contributor>Springer</contributor>
<publisher>Springer</publisher>
<identifier>hal-01637554</identifier>
<identifier>https://hal.archives-ouvertes.fr/hal-01637554</identifier>
<source>https://hal.archives-ouvertes.fr/hal-01637554</source>
<source>Springer. International Conference on Database and Expert Systems Applications, 2017, Lyon, France. Springer, 28th International Conference on Database and Expert Systems Applications (DEXA), 28th International Conference on Database and Expert Systems Applications (DEXA), pp 259-274, 2017, 〈10.1007/978-3-319-64471-4_21〉</source>
<identifier>DOI : 10.1007/978-3-319-64471-4_21</identifier>
<relation>info:eu-repo/semantics/altIdentifier/doi/10.1007/978-3-319-64471-4_21</relation>
<language>en</language>
<subject>ACM : H.2.8.0</subject>
<subject>[INFO] Computer Science [cs]</subject>
<type>info:eu-repo/semantics/conferenceObject</type>
<type>Conference papers</type>
<description lang=en>Numerous methods have been proposed in order to perform clustering from social networks. While significant works have been carried out on the design of new approaches, able to search for various kinds of clusters, a major challenge concerns the scalability of these approaches. Indeed, given the mass of data that can now be collected from online social networks, particularly from social platforms, it is important to have efficient methods for exploring and analyzing these very large amount of data. One of the recent social network clustering approaches is the extraction of conceptual links, a new approach that performs link clustering by exploiting both the structure of the network and attributes of nodes to identify strong links between groups of nodes in which nodes share common attributes. In this paper, we focus on the optimization of the search for conceptual links. In particular, we propose PALM, a parallel algorithm that aims to improve the efficiency of the extraction by simultaneously exploring several areas of the search space. For this purpose, we begin by demonstrating that the solution space forms a concept lattice. Then, we propose an approach that explores in parallel the branches of the lattice while reducing the search space based on various properties of conceptual links. We demonstrate the efficiency of the algorithm by comparing the performances with the original extraction approach. The results obtained show a significant gain on the computation time.</description>
<date>2017</date>
</dc>
</metadata>
</record>
</GetRecord>
</OAI-PMH>