Concept-based chatbot for interactive query refinement in product search
Proceedings of the 9th International Workshop "What can FCA do for Artificial Intelligence?" (FCA4AI 2021)
Vol. 2972. , CEUR-WS, 2021
, in: CLA 2013 Proceedings of the Tenth International Conference on Concept Lattices and Their Applications. .: La Rochelle: Laboratory L3i, University of La Rochelle, 2013.. P. 199-210.
In this paper, we are interested in the analysis of sequential data and we propose an original framework based on FCA. For that, we introduce sequential pattern structures, an original specification of pattern structures for dealing with sequential data. Sequential pattern structures are given by a subsumption operation between set of sequences, based on subsequence ...
Added: October 22, 2015
International Journal of General Systems 2016 Vol. 45 No. 2 P. 135-159
Nowadays data-sets are available in very complex and heterogeneous ways. Mining of such data collections is essential to support many real-world applications ranging from healthcare to marketing. In this work, we focus on the analysis of “complex” sequential data by means of interesting sequential patterns. We approach the problem using the elegant mathematical framework of ...
Added: February 25, 2016
International Journal of General Systems 2020 Vol. 49 No. 8 P. 785-818
Order and lattice theory provides convenient mathematical tools for pattern mining, in particular for condensed irredundant representations of pattern spaces and their efficient generation. Formal Concept Analysis (FCA) offers a generic framework, called pattern structures, to formalize many types of patterns, such as itemsets, intervals, graphs, and sequence sets. Moreover, FCA provides generic algorithms to generate irredundantly all ...
Added: January 25, 2021
, in: Machine Learning and Knowledge Discovery in Databases. European Conference, ECML PKDD 2015, Porto, Portugal, September 7-11, 2015, Proceedings. * III. Vol. 9286.: Dordrecht, L., Heidelberg, NY, Cham: Springer, 2015.. P. 227-231.
This article aims at presenting recent advances in Formal Concept Analysis (2010-2015), especially when the question is dealing with complex data (numbers, graphs, sequences, etc.) in domains such as databases (functional dependencies), data-mining (local pattern discovery), information retrieval and information fusion. As these advances are mainly published in artificial intelligence and FCA dedicated venues, a ...
Added: October 23, 2015
, in: Machine Learning and Knowledge Discovery in Databases. European Conference, ECML PKDD 2015, Porto, Portugal, September 7-11, 2015, Proceedings. * 2. Vol. 9285.: Dordrecht, L., Cham, Heidelberg, NY: Springer, 2015.. P. 157-172.
In pattern mining, the main challenge is the exponential explosion of the set of patterns. Typically, to solve this problem, a constraint for pattern selection is introduced. One of the first constraints proposed in pattern mining is support (frequency) of a pattern in a dataset. Frequency is an anti-monotonic function, i.e., given an infrequent pattern, ...
Added: October 22, 2015
, in: 2017 IEEE 17th International Conference on Data Mining (ICDM). .: New Orleans: IEEE, 2017.. Ch. 89. P. 757-762.
A scalable method for mining graph patterns stable under subsampling is proposed. The existing subsample stability and robustness measures are not antimonotonic according to definitions known so far. We study a broader notion of antimonotonicity for graph patterns, so that measures of subsample stability become antimonotonic. Then we propose gSOFIA for mining the most subsample-stable graph patterns. The ...
Added: September 26, 2017
, in: Proceedings of the International Workshop "What can FCA do for Artificial Intelligence?" (FCA4AI at ECAI 2016). .: M.: [б.и.], 2016.. P. 89-96.
FCA is a mathematical formalism having many applications in data mining and knowledge discovery. Originally it deals with binary data tables. However, there is a number of extensions that enrich stan dard FCA. In this paper we consider two important extensions: fuzzy FCA and pattern structures, and discuss the relation between them. In particular we introduce a scaling procedure that ...
Added: October 14, 2016
Discrete Applied Mathematics 2018 Vol. 249 P. 2-17
With an increased interest in machine processable data and with the progress of semantic technologies, many datasets are now published in the form of RDF triples for constituting the so-called Web of Data. Data can be queried using SPARQL but there are still needs for integrating, classifying and exploring the data for data analysis and ...
Added: September 26, 2017
, in: Proceedings of the Fifth International Scientific Conference "Intelligent Information Technologies for Industry" (IITI'21). Vol. 330.: Springer, 2022.. P. 410-420.
Added: October 28, 2021
, in: CLA 2016: Proceedings of the Thirteenth International Conference on Concept Lattices and Their Applications. CEUR Workshop Proceedings. Vol. 1624.: M.: Higher School of Economics, National Research University, 2016.. P. 85-96.
FCA is a mathematical formalism having many applications in data mining and knowledge discovery. Originally it deals with binary data tables. However, there is a number of extensions that enrich stan- dard FCA. In this paper we consider two important extensions: fuzzy FCA and pattern structures, and discuss the relation between them. In particular we ...
Added: October 14, 2016
, in: RAAI 2020 Russian Advances in Artificial Intelligence 2020 Selected Contributions of the "Russian Advances in Artificial Intelligence" Track at RCAI 2020 co-located with 18th Russian Conference on Artificial Intelligence (RCAI 2020). Vol. 2648.: CEUR-WS, 2020.. P. 144-156.
Information retrieval (IR) chatbot is a special class of virtual assistants, which is widely used nowadays in customer support services. However, the work of modern IR retrieval systems is limited by simple queries to the database, which does not utilize all the potential of interaction with the user. In this paper we implement an FCA-based ...
Added: September 15, 2020
Proceedings of the 9th International Symposium on Intelligent Distributed Computing – IDC'2015, Guimarães, Portugal, October 2015 ...
Added: October 19, 2015
, in: Formal Concept Analysis. 13th International Conference, ICFCA 2015, Nerja, Spain, June 23-26, 2015, Proceedings. Vol. 9113.: Springer, 2015.. P. 153-168.
In this paper we explore the possibility of defining an original pattern structure for managing syntactic trees. More precisely, we are interested in the extraction of relations such as drug-drug interactions (DDIs) in medical texts where sentences are represented as syntactic trees. In this specific pattern structure, called STPS, the similarity operator is based on ...
Added: October 22, 2015
, in: Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015, Buenos Aires, Argentina, July 25-31, 2015. .: Palo Alto: AAAI Press, 2015.. P. 823-829.
The popularization and quick growth of Linked Open Data (LOD) has led to challenging aspects regarding quality assessment and data exploration of the RDF triples that shape the LOD cloud. Particularly, we are interested in the completeness of data and its potential to provide concept definitions in terms of necessary and sufficient conditions. In this ...
Added: October 22, 2015
, in: Communications in Computer and Information Science. Information Retrieval. 10th Russian Summer School, RuSSIR 2016, Saratov, Russia, August 22-26, 2016, Revised Selected Papers. .: Springer, 2016..
A method for fuzzy full text search is proposed. The method follows a popular two-stage scheme with a novel second stage: a prelim inary search stage using an n-gram inverted index and, at the second stage, relevance checking between the query and documents using fre quency annotated suffix trees (ASTs). The ASTs are built for all docu ments of the ...
Added: December 13, 2016
В кн.: Социология и общество: социальное неравенство и социальная справедливость (Екатеринбург , 19-21 октября 2016 года). Материалы V Всероссийского социологического конгресса. .: М.: Российское общество социологов, 2016.. С. 9601-9615.
In this paper, we summarize the results of recent studies on the application of pattern mining and machine learning to the analysis of demographic sequences. The main goal is the demonstration of demographers’ needs, including next-event prediction and the extraction of interesting patterns from substantial datasets of demographic data, which cannot be handled by conventional ...
Added: November 24, 2016
, in: CLA 2016: Proceedings of the Thirteenth International Conference on Concept Lattices and Their Applications. CEUR Workshop Proceedings. Vol. 1624.: M.: Higher School of Economics, National Research University, 2016.. P. 217-229.
A comparison of different treatment strategies does not always result in determining the best one for all patients, one needs to study subgroups of patients with significant difference in efficiency between treatment strategies. To solve this problem an approach to subgroups generation is proposed, where data are described in terms of a pattern structure and ...
Added: October 12, 2016
This book constitutes the proceedings of the 15th International Conference on Formal Concept Analysis, ICFCA 2019, held in Frankfurt am Main, Germany, in June 2019. The 15 full papers and 5 short papers presented in this volume were carefully reviewed and selected from 36 submissions. The book also contains four invited contributions in full paper length. The ...
Added: October 29, 2019
Theoretical Computer Science is mathematical and abstract in spirit, but it derives its motivation from practical and everyday computation. Its aim is to understand the nature of computation and, as a consequence of this understanding, provide more efficient methodologies. All papers introducing or studying mathematical, logic and formal concepts and methods are welcome, provided that their motivation is ...
Added: October 29, 2020
, in: Analysis of Images, Social Networks and Texts. 8th International Conference, AIST 2019, Kazan, Russia, July 17–19, 2019, Revised Selected Papers. Communications in Computer and Information Science. Vol. 1086.: Springer, 2020.. P. 143-153.
Added: October 26, 2019
, in: Proceedings of the International Workshop "What can FCA do for Artificial Intelligence?" (FCA4AI at ECAI 2016). .: M.: [б.и.], 2016.. P. 105-112.
Decision tree learning is one of the most popular classifica- tion techniques. However, by its nature it is a greedy approach to finding a classification hypothesis that optimizes some information-based crite- rion. It is very fast but may lead to finding suboptimal classification hy- potheses. Moreover, in spite of decision trees being easily interpretable, ensembles ...
Added: October 6, 2016
, in: Supplementary Proceedings ICFCA 2019 Conference and Workshops. Vol. 2378.: CEUR Workshop Proceedings, 2019.. P. 137-151.
This paper presents further development of distributed multimodal clustering. We introduce a new version of multimodal clustering algorithm for distributed processing in Apache Hadoop on computer clusters. Its implementation allows a user to conduct clustering on data with modality greater than two. We provide time and space complexity of the algorithm and justify its relevance. ...
Added: October 31, 2019
, in: Proceedings of the International Workshop "What can FCA do for Artificial Intelligence?" (FCA4AI at IJCAI 2015). .: Buenos Aires: [б.и.], 2015.. P. 35-42.
Usually web search results are represented as long list of document snippets. It is difficult for users to navigate through this collection of text. We propose clustering method that uses pattern structure constructed on augmented syntactic parse trees. In addition, we compare our method to other clustering methods and demonstrate the limitations of the competitive methods. ...
Added: October 11, 2016
, in: Formal Concept Analysis: 14th International Conference, ICFCA 2017, Rennes, France, June 13-16, 2017, Proceedings. Vol. 10308.: Cham: Springer, 2017.. P. 72-88.
We revisit the notion of probably approximately correct implication bases from the literature and present a first formulation in the language of formal concept analysis, with the goal to investigate whether such bases represent a suitable substitute for exact implication bases in practical use cases. To this end, we quantitatively examine the behavior of probably approximately correct ...
Added: June 25, 2017