Using formal concept analysis for mining and interpreting patient flows within a healthcare network

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4923 LNAI, Issue , 2008, Pages 263-268

  Jay, Nicolas ^a,b   Kohler, François ^b   Napoli, Amedeo ^a  

^a LORIA   (France)

^b UNIVERSITÉ DE LORRAINE   (France)

Author keywords

Formal concept analysis; Frequent itemsets; Network

Indexed keywords

DATA FLOW ANALYSIS; DATA MINING; DATABASE SYSTEMS; HEALTH CARE; NETWORK MANAGEMENT; TABU SEARCH;

FORMAL CONCEPT ANALYSIS; FREQUENT ITEMSETS; HEALTHCARE NETWORKS; ITEMSET SEARCH;

FORMAL LANGUAGES;

EID: 41549085568     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-78921-5_19     Document Type: Conference Paper

References (14)

1. Fayyad, U., Piatetsky-Shapiro, G., Smyth, P.: The KDD Process for Extracting Useful Knowledge from Volumes of Data- Communication of the ACM 29-11, 27-34 (1996)
2. Ganter, B., Wille, R.: Formal Concept Analysis: mathematical foundations. Springer, Heidelberg (1999)
3. Jay, N., Napoli, A., Kohler, F.: Cancer Patient Flows Discovery in DRG Databases. In: Proc. MIE 2006 Conf. (to appear)
4. Becker, R.A., Eick, S.G., Wilks, A.R.: Visualizing Network Data IEEE Transactions on Visualization and Computer Graphics, vol. 1, pp. 16-28 (1995)
5. Freeman, L.C., White, D.R.: Using Galois Lattices to Represent Network Data. Sociological Methodology 23, 127-146 (1993)
6. Agrawal, R., Imielinski, T., Swami, A.: Mining association rules between sets of items in large databases. In: Proc. of the ACM SIGMOD Conference on Management of Data, Washington, D.C, pp. 207-216 (May 1993)
7. Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Closed set based discovery of small covers for association rules. In: Proc. BDA conf., pp. 361-381 (1999)
8. Stumme, G.: Conceptual Knowledge Discovery with Frequent Concept Lattices. FB4-Preprint 2043, TU Darmstadt (1999)
9. Zaki, M.J., Hsiao, C.: CHARM: An Efficient Algorithm for Closed Itemset Mining. In: SDM (2002)
10. Stumme, G., Taouil, R., Bastide, Y., Pasquier, N., Lakhal, L.: Computing iceberg concept lattices with TITANIC Data Knowl. Eng., vol. 42, pp. 189-222. Elsevier Science Publishers B. V, Amsterdam (2002)
11. Duquenne, V.: Lattice analysis and the representation of handicap associations. Social Networks 18, 217-230 (1996)
12. Duquenne, V.: Latticial structures in data analysis. Theorical Computer Science 217, 407-436 (1999)
13. Valtchev, P., Grosser, D., Roume, C., Hacene, M.R.: GALICIA: An open platform for lattices. In: Using Conceptual Structures: Contributions to the 11th Intl. Conference on Conceptual Structures (ICCS 2003), Dresden, Germany, vol. 25, pp. 241-254. Shaker, Ithaca (2003)
14. Gansner, ER., North, S.C.: An open graph visualization system and its applications to software engineering. Softw. Pract. Exper. 30(11), 1203-1233 (2000)