Skip to main content

Extensional Confluences and Local Closure Operators

  • Conference paper
  • First Online:
Formal Concept Analysis (ICFCA 2015)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 9113))

Included in the following conference series:

Abstract

This work is motivated by knowledge discovery in attributed graphs. Our approach consists in extending the methodology of frequent closed pattern mining, as developed in Formal Concept Analysis (FCA), to the case where the objects in which attribute patterns may occur are the vertices of a graph, typically representing a social network. For that purpose we extend the framework of abstract concept lattices, in which the extensional space is a pointed join-subsemilattice of the powerset \(X\) of the object set, by considering as the extensional space a weaker structure called a confluence of \(X\). Confluences were recently investigated as intensional spaces in FCA. In this article we show that when the intensional space is a lattice \(L\) and the extensional space is a confluence \(F\) of \(X\), that leads to a set of closure operators, called local closure operators, whose union form the set of intensions of \(F\). We investigate the structure of the set of (extension,intension) pairs, i.e. the set of local concepts built on \((L,F)\) and related local implications. As an example, we consider the detection of all frequent k-communities in an attributed network.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    In data mining the support set of a pattern is the extension of this pattern in a set of objects

  2. 2.

    In that article, these structures were called confluence’s. We use here a more standard terminology.

  3. 3.

    A pattern is said support-closed whenever specializing the pattern decreases its extension [6].

References

  1. Soldano, H., Santini, G.: Graph abstraction for closed pattern mining in attributed network. 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, Amsterdam (2014)

    Google Scholar 

  2. Soldano, H., Ventos, V.: Abstract concept lattices. In: Jäschke, R. (ed.) ICFCA 2011. LNCS, vol. 6628, pp. 235–250. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  3. Mougel, P.-N., Rigotti, C., Gandrillon, O.: Finding collections of k-clique percolated components in attributed graphs. In: Tan, P.-N., Chawla, S., Ho, C.K., Bailey, J. (eds.) PAKDD 2012, Part II. LNCS, vol. 7302, pp. 181–192. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

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

    Article  Google Scholar 

  5. Soldano, H.: Closed patterns and abstraction beyond lattices. In: Glodeanu, C.V., Kaytoue, M., Sacarea, C. (eds.) ICFCA 2014. LNCS, vol. 8478, pp. 203–218. Springer, Heidelberg (2014)

    Chapter  Google Scholar 

  6. 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)

    Article  MATH  Google Scholar 

  7. Palla, G., Derenyi, I., Farkas, I., Vicsek, T.: Uncovering the overlapping community structure of complex networks in nature and society. Nature 435(7043), 814–818 (2005)

    Article  Google Scholar 

  8. Blyth, T.S.: Lattices and Ordered Algebraic Structures. Universitext. Springer, London (2005)

    MATH  Google Scholar 

  9. 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)

    Article  Google Scholar 

  10. Ganter, B., Kuznetsov, S.O.: Pattern structures and their projections. In: Delugach, H.S., Stumme, G. (eds.) ICCS 2001. LNCS (LNAI), vol. 2120, pp. 129–142. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  11. Negrevergne, B., Termier, A., Rousset, M.C., Méhaut, J.F.: Paraminer: a generic pattern mining algorithm for multi-core architectures. Data Min. Knowl. Disc. 28(3), 593–633 (2013)

    Article  Google Scholar 

  12. Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations. Springer, Heidelberg (1999)

    Book  MATH  Google Scholar 

  13. Kuznetsov, S.O., Samokhin, M.V.: Learning closed sets of labeled graphs for chemical applications. In: Kramer, S., Pfahringer, B. (eds.) ILP 2005. LNCS (LNAI), vol. 3625, pp. 190–208. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

Download references

Acknowledgments

Many thanks to Sylvie Borne for her help in drawing the figures.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Henry Soldano .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Soldano, H. (2015). Extensional Confluences and Local Closure Operators. In: Baixeries, J., Sacarea, C., Ojeda-Aciego, M. (eds) Formal Concept Analysis. ICFCA 2015. Lecture Notes in Computer Science(), vol 9113. Springer, Cham. https://doi.org/10.1007/978-3-319-19545-2_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-19545-2_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-19544-5

  • Online ISBN: 978-3-319-19545-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics