nach oben

Erschienen in:

2022 | OriginalPaper | Buchkapitel

Experiments on F-Restricted Bi-pattern Mining

verfasst von : Guillaume Santini, Henry Soldano, Stella Zevio

Erschienen in: Complex Networks & Their Applications X

Verlag: Springer International Publishing

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config

KI-gestützte Suche

Aus

Abstract

Bi-pattern mining has been previously introduced to mine attributed networks in which nodes may have two roles, as bi-partite or directed networks. A bi-pattern is then made of a pair of attribute patterns, and has a pair of support sets to figure the occurrences of the bi-pattern. Restricted bi-pattern mining has then been introduced to enforce both components of a bi-pattern to share part of their attribute content, so leading to a reduced bi-pattern space. The definition of a new closure operator allows then to enumerate such closed restricted bi-patterns. The presentation was theoretical and no experiments were provided. Our contribution is practical, it displays experiments comparing efficiency and results of restricted bi-pattern mining to their unrestricted bi-pattern mining counterparts.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

über 102.000 Bücher
über 537 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Finance + Banking
Management + Führung
Marketing + Vertrieb
Maschinenbau + Werkstoffe
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 390 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Maschinenbau + Werkstoffe

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 340 Zeitschriften

aus folgenden Fachgebieten:

Bauwesen + Immobilien
Business IT + Informatik
Finance + Banking
Management + Führung
Marketing + Vertrieb
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Vorheriges Kapitel Analyzing Escalations in Militarized Interstate Disputes Using Motifs in Temporal Networks

Nächstes Kapitel Finding Colorful Paths in Temporal Graphs

d[e] is the image of e by d, i.e. \(d[e]=\{d(v) | v \in e\}\).

An atom a in a (finite) ordered set A with a minimum \(\bot \) is an element greater than \(\bot \) and such that there is no other element between \(\bot \) and a.

Available at https://lipn.univ-paris13.fr/MinerLC/.

Silva, A., Meira, W., Jr., Zaki, M.J.: Mining attribute-structure correlated patterns in large attributed graphs. Proc. VLDB Endow. 5(5), 466–477 (2012)CrossRef

Galbrun, E., Gionis, A., Tatti, N.: Overlapping community detection in labeled graphs. Data Min. Knowl. Discov. 28(5–6), 1586–1610 (2014)MathSciNetCrossRef

Atzmueller, M., Doerfel, S., Mitzlaff, F.: Description-oriented community detection using exhaustive subgroup discovery. Inf. Sci. 329, 965–984 (2016)CrossRef

Soldano, H., Santini, G.: Graph abstraction for closed pattern mining in attributed networks. In: Schaub, T., Friedrich, G., O’Sullivan, B. (eds.) European Conference in Artificial Intelligence (ECAI). Frontiers in Artificial Intelligence and Applications, vol. 263, pp. 849–854. IOS Press (2014)

Seidman, S.B.: Network structure and minimum degree. Soc. Netw. 5, 269–287 (1983)MathSciNetCrossRef

Batagelj, V., Zaversnik, M.: Fast algorithms for determining (generalized) core groups in social networks. Adv. Data Anal. Classif. 5(2), 129–145 (2011)MathSciNetCrossRefMATH

Borgatti, S.P., Everett, M.G.: Network analysis of 2-mode data. Soc. Netw. 19(3), 243–269 (1997)CrossRef

Soldano, H., Santini, G., Bouthinon, D., Bary, S., Lazega, E.: Bi-pattern mining of attributed networks. Appl. Netw. Sci. 4(1), 37 (2019)CrossRef

Zevio, S., Santini, G., Soldano, H., Zargayouna, H., Charnois, T.: A combination of semantic annotation and graph mining for expert finding in scholarly data. In: Proceedings of the Graph Embedding and Mining (GEM) Workshop at ECML PKDD (2020)

10.

Santini, G., Soldano, H., Zevio, S.: Restricted bi-pattern mining. In: Braun, T., Gehrke, M., Hanika, T., Hernandez, N. (eds.) ICCS 2021. LNCS (LNAI), vol. 12879, pp. 200–207. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-86982-3_15CrossRef

11.

Kleinberg, J.M.: Authoritative sources in a hyperlinked environment. J. ACM (JACM) 46(5), 604–632 (1999)MathSciNetCrossRefMATH

12.

Pernelle, N., Rousset, M.-C., Soldano, H., Ventos, V.: Zoom: a nested Galois lattices-based system for conceptual clustering. J. Exp. Theor. Artif. Intell. 2/3(14), 157–187 (2002)CrossRefMATH

13.

Boley, M., Horváth, T., Poigné, A., Wrobel, S.: Listing closed sets of strongly accessible set systems with applications to data mining. Theor. Comput. Sci. 411(3), 691–700 (2010)MathSciNetCrossRefMATH

14.

Davey, B., Priestley, H.: Introduction to Lattices and Order, 2nd edn. Cambridge University Press, Cambridge (2002)CrossRefMATH

15.

Soldano, H., Santini, G., Bouthinon, D.: Attributed graph pattern set selection under a distance constraint. In: Cherifi, H., Gaito, S., Mendes, J.F., Moro, E., Rocha, L.M. (eds.) COMPLEX NETWORKS 2019. SCI, vol. 882, pp. 228–241. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-36683-4_19CrossRef

16.

Newman, M.E.J.: Modularity and community structure in networks. Proc. Natl. Acad. Sci. 103(23), 8577–8582 (2006)CrossRef

17.

Soldano, H., Santini, G., Bouthinon, D., Lazega, E.: Hub-authority cores and attributed directed network mining. In: International Conference on Tools with Artificial Intelligence (ICTAI), Boston, MA, USA, 7–9 November 2017, pp. 1120–1127. IEEE Computer Society (2017)

Titel: Experiments on F-Restricted Bi-pattern Mining
verfasst von: Guillaume Santini
Henry Soldano
Stella Zevio
Verlag: Springer International Publishing
Buch: Complex Networks & Their Applications X
Print ISBN: 978-3-030-93408-8

Electronic ISBN: 978-3-030-93409-5

Copyright-Jahr: 2022
DOI: https://doi.org/10.1007/978-3-030-93409-5_45

Springer Professional

Abstract

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Springer Professional "Technik"

Springer Professional "Wirtschaft"

Premium Partner