Skip to main content

A Conceptual Approach for Relational IR: Application to Legal Collections

  • 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

Everyone who works in the legal field is faced with the complexity of documentary sources of law, that are highly interrelated and interdependent of each others. It is essential for legal practitioners to rely on systems that retrieve all the sources related to the legal cases they are working on and not only the most relevant ones. The challenge for legal IR is to achieve exhaustivity and handle this complexity by retrieving documents on the basis of the semantic content and the intertextual relationships. This work proposes an IR approach for legal sources that goes beyond existing systems. It is based on Formal and Relational Concept Analysis to structure, query and browse collections of legal documents.

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.

    www.legifrance.gouv.fr/.

  2. 2.

    www.legislation.gov.uk/.

  3. 3.

    Lattices are build using Galicia platform [17].

  4. 4.

    Various types of scaling can be defined but we rely only on the existential one here.

  5. 5.

    If the query graph has a focus, the node corresponding to the first focus variable is chosen as root. Otherwise the root node is chosen arbitrarly.

References

  1. Azmeh, Z., Rouane, M-H., Huchard, M., Napoli, A., Valtchev, P.: Querying relational concept lattices. In: Proceedings of the 8th International Conference on Concept Lattices and their Applications (CLA 2011), Nancy, France, pp. 377–392, October 2011

    Google Scholar 

  2. Bourcier, D.: Sciences juridiques et complexitë. Un nouveau modéle d’analyse. Droit et Cultures 61(1), 37–53 (2011)

    Google Scholar 

  3. Brin, S., Page, L.: The anatomy of a large-scale hypertextual web search engine. In: Proceedings of the Seventh International Conference on World Wide Web (WWW7), pp. 107–117 (1998)

    Google Scholar 

  4. Carpineto, C., Romano, G.: Using concept lattices for text retrieval and mining. In: Ganter, B., Stumme, G., Wille, R. (eds.) Formal Concept Analysis. LNCS (LNAI), vol. 3626, pp. 161–179. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  5. Codocedo, V., Lykourentzou, I., Napoli, A.: A semantic approach to concept lattice-based information retrieval. Ann. Math. Artif. Intell. 72(1–2), 169–195 (2014)

    Article  MATH  MathSciNet  Google Scholar 

  6. Ferré, S.: Camelis: a logical information system to organise and browse a collection of documents. Int. J. Gen. Syst. 38(4), 379–403 (2009)

    Article  MATH  Google Scholar 

  7. Fowler, J.H., Johnson, T.R., Spriggs, J.F., Jeon, S., Wahlbeck, P.J.: Network analysis and the law: measuring the legal importance of precedents at the u.s. supreme court. Polit. Anal. 15, 324–346 (2007)

    Article  Google Scholar 

  8. Ganter, B., Stumme, G., Wille, R. (eds.): Formal Concept Analysis, Foundations and Applications. LNCS (LNAI), vol. 3626. Springer, Heidelberg (2005)

    MATH  Google Scholar 

  9. Godin, R., Missaoui, R., Alaoui, H.: Incremental concept formation algorithms based on galois (concept) lattices. Comput. Intell. 11, 246–267 (1995)

    Article  Google Scholar 

  10. Huchard, M., Hacene, M.R., Roume, C., Valtchev, P.: Relational concept discovery in structured datasets. Ann. Math. Artif. Intell. 49, 39–76 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  11. Kotters, J.: Object configuration browsing in relational databases. In: Jäschke, R. (ed.) ICFCA 2011. LNCS, vol. 6628, pp. 151–166. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  12. Messai, N., Devignes, M.-D., Napoli, A., Smaïl-Tabbone, M.: Querying a bioinformatic data sources registry with concept lattices. In: Dau, F., Mugnier, M.-L., Stumme, G. (eds.) ICCS 2005. LNCS (LNAI), vol. 3596, pp. 323–336. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  13. Mimouni, N., Fernàndez, M., Nazarenko, A., Bourcier, D., Salotti, S.: A relational approach for information retrieval on XML legal sources. In: International Conference on Artificial Intelligence and Law, (ICAIL), Rome, Italy, pp. 212–216 (2013)

    Google Scholar 

  14. Priss, U.: Faceted knowledge representation. Electron. Trans. Artif. Intell. 4(C), 21–33 (2000)

    MathSciNet  Google Scholar 

  15. Romain, B., Mazzega, P., Bourcier, D.: A network approach to the french system of legal codes- part i: analysis of a dense network. J. Artif. Intell. Law 19, 333–355 (2011)

    Article  Google Scholar 

  16. Rouane, M.H., Huchard, M., Napoli, A., Valtchev, P.: Relational concept analysis: mining concept lattices from multi-relational data. Ann. Math. Artif. Intell. 67(1), 81–108 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  17. Valtchev, P., Grosser, D., Roume, C., Hacene, M.R.: Galicia: an open platform for lattices. In: Using Conceptual Structures (ICCS 2003), pp. 241–254. Shaker Verlag (2003)

    Google Scholar 

  18. Winkels, R., de Ruyter, J.: Survival of the fittest: network analysis of dutch supreme court cases. In: Palmirani, M., Pagallo, U., Casanovas, P., Sartor, G. (eds.) AICOL-III 2011. LNCS, vol. 7639, pp. 106–115. Springer, Heidelberg (2012)

    Google Scholar 

  19. Wray, T., Eklund, P.W.: Exploring the information space of cultural collections using formal concept analysis. In: Jäschke, R. (ed.) ICFCA 2011. LNCS, vol. 6628, pp. 251–266. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

Download references

Acknowledgments

This work has been partially funded by the Légilocal project (French Single Inter-Ministry Fund, FUI-9, 2010–2013) and is supported by Labex EFL (French National Research Agency, ANR-10-LABX-0083).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Nada Mimouni .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Mimouni, N., Nazarenko, A., Salotti, S. (2015). A Conceptual Approach for Relational IR: Application to Legal Collections. 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_19

Download citation

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

  • 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