?
Browsing publication data using tag clouds over concept lattices constructed by key-phrase extraction
P. 10–22.
In order to find research on a specific topic or to get an overview of the topics that are published at different academic venues, academics need to browse data from existing academic publications. The title and abstract of publications contains useful key-phrases indicating the topic of the publication, but these need to be directly extracted and presented in a browsable format in order to allow the user to find relevant publications. We extract key-phrases and use these to construct a concept lattice for a dataset of publications. We then present the information in an intuitive interactive tag cloud browser where navigation is supported by the underlying concept lattice.
Publication based on the results of:
In book
Vol. 1552. , Aachen: CEUR Workshop Proceedings, 2015.
Ignatov D. I., , in: 11th International Conference, AIST 2023, Yerevan, Armenia, September 28–30, 2023, Revised Selected Papers. Analysis of Images, Social Networks and Texts. Lecture Notes in Computer Science (LNCS, volume 14486).: Cham: Springer, 2024. P. 349 – 361.
This paper dates back to the asymptotic solutions of Rota’s problem on the size of maximum antichain in the set partition lattice by Canfield and Harper and others. The knowledge of asymptotic coefficients could pave the way to the asymptotic solutions of such problems as (maximal) antichain counting in partition lattices. In addition to our ...
Added: January 23, 2026
Implementation of Bug1 and Bug2 Basic Path-Planning Algorithms for a TurtleBot 3 Robot in ROS Noetic
Spektor I., Zagirov A., Safin R. et al., , in: Proceedings Of The 2024 International Conference On Artificial Life And Robotics February 22 To 25, 2024 J:Com Horutohall, Oita, Japan. 29Th Arob International Meeting Series.: ALife Robotics Corporation Ltd., 2024. P. 272–275.
Added: February 19, 2025
Saleh H., IEEE, 2023.
Estimating depth is necessary to understand and navigate the environment surrounding us. Over the years, many active sensors have been developed to measure depth, but they are expensive and require additional space for mounting. A cheaper alternative is estimating depth from a single RGB image taken by an ordinary monocular camera, which can be placed ...
Added: November 30, 2023
Ignatov D. I., Khvorykh G., Khrunin A. et al., , in: Recent Trends in Analysis of Images, Social Networks and Texts. 9th International Conference, AIST 2020, Skolkovo, Moscow, Russia, October 15–16, 2020 Revised Supplementary ProceedingsVol. 12602.: Springer, 2021. P. 185–204.
© 2021, Springer Nature Switzerland AG.Missing genotypes can affect the efficacy of machine learning approaches to identify the risk genetic variants of common diseases and traits. The problem occurs when genotypic data are collected from different experiments with different DNA microarrays, each being characterised by its pattern of uncalled (missing) genotypes. This can prevent the ...
Added: November 1, 2022
Egurnov D., Ignatov D. I., Automation and Remote Control 2022 Vol. 83 No. 6 P. 894–902
Abstract: The paper deals with the problem of triclustering in multivalued triadic contexts in termsof one multidimensional extension of formal concept analysis; triclustering can be viewed as asearch for dense subtensors in three-dimensional tensors over the field of real numbers. Twomethods are proposed for solving this problem, namely, NOAC—a version of the OACtriclustering method for ...
Added: November 1, 2022
Adashinskaya A., В кн.: BYZANTINOCAUCASICAВып. 1.: Институт востоковедения РАН, 2021. С. 133–171.
The present essay regards the interdependence between the migration of Greek artists to the locations on the shores of the Mediterranean and Black seas and the development of Genoese and Venetian navigation routes between the 13th and 15th centuries. It claims that relatively safe and fast sea travels facilitated the appearance of Byzantine, primarily Constantinopolitan, ...
Added: February 17, 2022
Safin R., Lavrenov R., Hsia K. et al., , in: 2022 International Siberian Conference on Control and Communications (SIBCON).: IEEE, 2022. Ch. 9438875.
Added: October 11, 2021
Zakiev A., Lavrenov R., Magid E. et al., Journal of Advanced Research in Dynamical and Control Systems 2019 Vol. 11 No. 8 P. 1743–1753
This paper introduces a new indoor environment exploration method, which is designed to consider robot sensory perception constraints and indoor spaces predictable structure. Our new method is compared with a greedy approach exploration. The two algorithms were implemented and tested in simulation and in real-world experiments with a Russian Servosila Engineer crawler rescue robot. Robot ...
Added: October 10, 2021
CEUR-WS.org, 2020.
The CLA conference is an international forum for researchers, practitioners and students dedicated to the practice of Formal Concept Analysis (FCA) and areas closely related to it, including data analysis and mining, information retrieval, knowledge management, knowledge engineering, logic, algebra and lattice theory.
The 15th of CLA, CLA 2020, was going to be held in Tallinn, Estonia ...
Added: October 30, 2020
Shpilman A., Kudenko D., Gaydashenko A., , in: 2018 17th IEEE International Conference on Machine Learning and Applications (ICMLA).: IEEE, 2018. P. 553–557.
Robot navigation through crowds poses a difficult challenge to AI systems, since the methods should result in fast and efficient movement but at the same time are not allowed to compromise safety. Most approaches to date were focused on the combination of pathfinding algorithms with machine learning for pedestrian walking prediction. More recently, reinforcement learning ...
Added: January 18, 2019
CEUR Workshop Proceedings, 2018.
Added: November 25, 2018
Ossadtchi A., Lebedev M., Frontiers in Systems Neuroscience 2018 Vol. 12 No. 8 P. 1–5
The discovery of place-representing neurons in the hippocampal formation has been recognized by the Nobel Committee as a paradigm shift in Neuroscience (Burgess, 2014). Here we call attention to an innovative paper of particular note (Zhang and Manahan-Vaughan, 2015) that added important findings to this field of study.
Zhang and Manahan-Vaughan investigated the contribution of olfactory ...
Added: April 17, 2018
Ignatov D. I., Semenov A., Комиссарова Д. В. et al., , in: Formal Concept Analysis of Social Networks.: Springer, 2017. Ch. 4 P. 59–96.
Multimodal clustering is an unsupervised technique for mining interesting patterns in n-ary relations or n-mode networks. Among different types of such generalised patterns one can find biclusters and formal concepts (maximal bicliques) for two-mode case, triclusters and triconcepts for three-mode case, closed n-sets for n-mode case, etc. Object-attribute biclustering (OA-biclustering) for mining large binary datatables (formal contexts or two-mode ...
Added: December 17, 2017
Masyutin A., Kashnitsky Y., , in: Foundations of Intelligent Systems.: Warsz.: Springer, 2017. P. 664–673.
The cornerstone of retail banking risk management is the estimation of the expected losses when granting a loan to the borrower. The key driver for loss estimation is probability of default (PD) of the borrower. Assessing PD lies in the area of classification problem. In this paper we apply FCA query-based classification techniques to Kaggle ...
Added: July 6, 2017
University Rennes 1, 2017.
This volume is the supplementary volume of the 14th International Conference on Formal Concept Analysis (ICFCA 2017), held from June 13th to 16th 2017, at IRISA, Rennes. The ICFCA conference series is one of the major venues for researches from the field of Formal Concept Analysis and related areas to present and discuss their recent ...
Added: June 19, 2017
Mirkin B., , in: CLA 2016: Proceedings of the Thirteenth International Conference on Concept Lattices and Their Applications. CEUR Workshop ProceedingsVol. 1624.: M.: Higher School of Economics, National Research University, 2016. P. 7–8.
Аpproximate cluster structures are those of formal concepts and n-concepts with added numerical intensity weights. The talk presents theoretical results and computational methods for approximate clustering and n-clustering as extensions of the algebraic-geometrical properties of numerical matrices (SVD and the like) to the situations where one or most of elements of the solutions to be ...
Added: March 3, 2017
Babin M. A., Kuznetsov S., Theoretical Computer Science 2017 Vol. Volume 658, Part B No. 7 January P. 316–326
Dualization of a monotone Boolean function on a finite lattice can be represented by transforming the set of its minimal 1 values to the set of its maximal 0 values. In this paper we consider finite lattices given by ordered sets of their meet and join irreducibles (i.e., as a concept lattice of a formal ...
Added: February 9, 2017
Бочаров А. А., Gnatyshak D. V., Ignatov D. I. et al., , in: CLA 2016: Proceedings of the Thirteenth International Conference on Concept Lattices and Their Applications. CEUR Workshop ProceedingsVol. 1624.: M.: Higher School of Economics, National Research University, 2016. P. 45–56.
We propose a new algorithm for consensus clustering, FCA-Consensus, based on Formal Concept Analysis. As the input, the algorithm takes T partitions of a certain set of objects obtained by k-means algorithm after T runs from different initialisations. The resulting consensus partition is extracted from an antichain of the concept lattice built on a formal ...
Added: October 24, 2016
Kuznetsov S., Makhalova T., , in: CLA 2016: Proceedings of the Thirteenth International Conference on Concept Lattices and Their Applications. CEUR Workshop ProceedingsVol. 1624.: M.: Higher School of Economics, National Research University, 2016. P. 245–253.
Triadic concept analysis has become a popular research direction, since triadic relations give natural models of many data collections. In this paper we address the problem of selecting most interesting concepts by proposing triadic stability indices ...
Added: October 11, 2016