On mining complex sequential data by means of FCA and pattern structures

References

• Adda, Mehdi, Petko Valtchev, Rokia Missaoui, and Chabane Djeraba. 2010. “A Framework for Mining Meaningful Usage Patterns within a Semantically Enhanced Web Portal.” In Proceedings of the 3rd C* Conference on Computer Science and Software Engineering, C3S2E’10, 138–147. New York: ACM.
   Google Scholar
• Agrawal, Rakesh, and Ramakrishnan Srikant. 1995. “Mining Sequential Patterns.” In Proceedings of the Eleventh International Conference on Data Engineering, ICDE’95, 3–14. Washington, DC: IEEE Computer Society.
   Google Scholar
• Ayres, Jay, Jason Flannick, Johannes Gehrke, and Tomi Yiu. 2002. “Sequential Pattern Mining Using a Bitmap Representation. In Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD’02, 429–435. New York: ACM.
   Google Scholar
• Balcázar, José L., and Gemma Casas-Garriga. 2005. “On Horn Axiomatizations for Sequential Data. In Database Theory -- ICDT 2005, Vol. 3363 of Lecture Notes in Computer Science, edited by Thomas Eiter and Leonid Libkin, 215–229. Berlin: Springer.
   Google Scholar
• Buzmakov, Aleksey, Elias Egho, Nicolas Jay, Sergei O. Kuznetsov, Amedeo Napoli, and Chedy Ra\"{i}ssi. 2013. "On Projections of Sequential Pattern Structures (with an Application on Care Trajectories)." In Proceedings of 10th International Conference on Concept Lattices and their Applications, 199–208. La Rochelle.
   Google Scholar
• Casas-Garriga, Gemma. 2005. “Summarizing Sequential Data with Closed Partial Orders.” In Proceedings of the 5th SIAM International Conference on Data Mining (SDM’05), 380–391. Newport Beach, CA: SIAM.
   Google Scholar
• Chiu, Ding Ying, Yi Hung Wu, and Arbee L. P. Chen. 2004. “An Efficient Algorithm for Mining Frequent Sequences by a New Strategy without Support Counting.” In ICDE, 375–386. Washington, DC: IEEE Computer Society.
   Google Scholar
• Ding, Bolin, David Lo, Jiawei Han, and Siau Cheng Khoo. 2009. “Efficient Mining of Closed Repetitive Gapped Subsequences from a Sequence Database.” In Proceedings of IEEE 25th International Conference on Data Engineering, March, 1024–1035. IEEE. Washington, DC: IEEE Computer Society.
   Google Scholar
• Egho, Elias, Nicolas Jay, Chedy Raïssi, Dino Ienco, Pascal Poncelet, Maguelonne Teisseire, and Amedeo Napoli. 2014. “A Contribution to the Discovery of Multidimensional Patterns in Healthcare Trajectories.” Journal of Intelligent Information Systems 42 (2): 283–305.
   Web of Science ®Google Scholar
• Egho, Elias, Chedy Raïssi, Nicolas Jay, and Amedeo Napoli. 2014. “Mining Heterogeneous Multidimensional Sequential Patterns.” In ECAI 2014–21st European Conference on Artificial Intelligence, 279–284. Amsterdam: IOS Press.
   Google Scholar
• Ferré, Sébastien. 2007. “The Efficient Computation of Complete and Concise Substring Scales with Suffix Trees.” In Formal Concept Analysis SE -- 7. Vol. 4390 of Lecture Notes in Computer Science, edited by Sergei O. Kuznetsov and Stefan Schmidt, 98–113. Berlin: Springer.
   Google Scholar
• Fetter, R. B., Y. Shin, J. L. Freeman, R. F. Averill, and J. D. Thompson. 1980. “Case Mix Definition by Diagnosis-related Groups.” Medical Care 18 (2): 1–53.
   Google Scholar
• Ganter, Bernhard, and Sergei O. Kuznetsov. 2001. “Pattern Structures and their Projections.” In Conceptual Structures: Broadening the Base. Vol. 2120 of Lecture Notes in Computer Science, edited by Harry S. Delugach and Gerd Stumme, 129–142. Berlin, Heidelberg: Springer.
   Google Scholar
• Ganter, Bernhard, and Rudolf Wille. 1999. Formal Concept Analysis: Mathematical Foundations. 1st ed.Berlin: Springer.
   Google Scholar
• Han, Jiawei, Jian Pei, Behzad Mortazavi-Asl, Qiming Chen, Umeshwar Dayal, and Meichun Hsu. 2000. “FreeSpan: Frequent Pattern-projected Sequential Pattern Mining.” In Proceedings of the 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 355–359. New York: ACM.
   Google Scholar
• Klimushkin, Mikhail, Sergei A. Obiedkov, and Camille Roth. 2010. “Approaches to the Selection of Relevant Concepts in the Case of Noisy Data.” In Proceedings of the 8th International Conference on Formal Concept Analysis, ICFCA’10, 255–266. Berlin: Springer.
   Google Scholar
• Kuznetsov, Sergei O. 1999. “Learning of Simple Conceptual Graphs from Positive and Negative Examples.” In Principles of Data Mining and Knowledge Discovery SE -- 47. Vol. 1704 of Lecture Notes in Computer Science, edited by Jan M. Żytkow and Jan Rauch, 384–391. Berlin, Heidelberg: Springer.
   Google Scholar
• Kuznetsov, Sergei O. 2007. “On Stability of a Formal Concept.” Annals of Mathematics and Artificial Intelligence 49 (1–4): 101–115.
   Web of Science ®Google Scholar
• Masseglia, Florent, Fabienne Cathala, and Pascal Poncelet. 1998. “The PSP Approach for Mining Sequential Patterns.” In Principles of Data Mining and Knowledge Discovery, Lecture Notes in Computer Science, edited by Jan M. Żytkow and Mohamed Quafafou, Vol. 1510, 176–184. Berlin: Springer.
   Google Scholar
• Merwe, Dean van der, Sergei Obiedkov, and Derrick Kourie. 2004. “AddIntent: A New Incremental Algorithm for Constructing Concept Lattices.” In Vol. 2961 ofConcept Lattices. edited by Gerhard Goos, Juris Hartmanis, Jan Leeuwen and Peter Eklund, 372–385. Berlin: Springer.
   Google Scholar
• Mooney, Carl H., and John F. Roddick. 2013. “Sequential Pattern Mining -- Approaches and Algorithms.” ACM Computing Surveys 45: 1–39.
   Web of Science ®Google Scholar
• Pei, Jian, Jiawei Han, Behzad Mortazavi-Asl,, Helen Pinto, Qiming Chen, Umeshwar Dayal, and Meichun Hsu. 2001a. “PrefixSpan: Mining Sequential Patterns by Prefix-projected Growth.” In ICDE, 215–224. Washington, DC: IEEE Computer Society.
   Google Scholar
• Pei, Jian, Jiawei Han, B. Mortazavi-Asl, H. Pinto, Qiming Chen, U. Dayal, and Mei-Chun Hsu. 2001b. “PrefixSpan Mining Sequential Patterns Efficiently by Prefix Projected Pattern Growth.” In 17th International Conference on Data Engineering, 215–226. Washington, DC: IEEE Computer Society.
   Google Scholar
• Pinto, Helen, Jiawei Han, Jian Pei, Ke Wang, Qiming Chen, and Umeshwar Dayal. 2001. “Multi-dimensional Sequential Pattern Mining.” In CIKM, 81–88. New York, NY: ACM.
   Google Scholar
• Plantevit, Marc, Anne Laurent, Dominique Laurent, Maguelonne Teisseire, and Yeow Wei Choong. 2010. “Mining Multidimensional and Multilevel Sequential Patterns.” ACM Transactions on Knowledge Discovery from Data 4 (1): 1–37.
   Web of Science ®Google Scholar
• Raïssi, Chedy, Toon Calders, and Pascal Poncelet. 2008. “Mining Conjunctive Sequential Patterns.” Data Mining and Knowledge Discovery 17 (1): 77–93.
   Web of Science ®Google Scholar
• Roth, Camille, Sergei Obiedkov, and Derrick G. Kourie. 2008. “On Succinct Representation of Knowledge Community Taxonomies with Formal Concept Analysis.” International Journal of Foundations of Computer Science 19 (2): 383–404.
   Web of Science ®Google Scholar
• Salvemini, Eliana, Fabio Fumarola, Donato Malerba, and Jiawei Han. 2011. “FAST Sequence Mining Based on Sparse Id-lists.” In Proceedings of the 19th International Conference on Foundations of Intelligent Systems, ISMIS’11, 316–325. Berlin, Heidelberg: Springer-Verlag.
   Google Scholar
• Srikant, Ramakrishnan, and Rakesh Agrawal. 1996. “Mining Sequential Patterns: Generalizations and Performance Improvements.” In Proceedings of the 5th International Conference on Extending Database Technology: Advances in Database Technology, EDBT’96, 3–17. London: Springer-Verlag.
   Google Scholar
• Tsumoto, Shusaku, Haruko Iwata, Shoji Hirano, and Yuko Tsumoto. 2014. “Similarity-based Behavior and Process Mining of Medical Practices.” Future Generation Computer Systems 33: 21–31.
   Web of Science ®Google Scholar
• Yan, Xifeng, Jiawei Han, and Ramin Afshar. 2003. “CloSpan: Mining Closed Sequential Patterns in Large Databases.” In Proceedings of SIAM International Conference on Data Mining (SDM’03), 166–177. Newport Beach, CA: SIAM.
   Google Scholar
• Yang, Zhenglu, Masaru Kitsuregawa, and Yitong Wang. 2006. “PAID: Mining Sequential Patterns by Passed Item Deduction in Large Databases.” In IDEAS, 113–120. Washington, DC: IEEE Computer Society.
   Google Scholar
• Yu, Chung-Ching, and Yen-Liang Chen. 2005. “Mining Sequential Patterns from Multidimensional Sequence Data.” IEEE Transactions on Knowledge and Data Engineering 17 (1): 136–140.
   Web of Science ®Google Scholar
• Zaki, Mohammed J. 2001. “SPADE: An Efficient Algorithm for Mining Frequent Sequences.” Machine Learning 42 (1--2): 31–60.
   Web of Science ®Google Scholar