Sergei Obiedkov

ORCID: 0000-0003-1497-4001
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Rough Sets and Fuzzy Logic
  • Semantic Web and Ontologies
  • Logic, Reasoning, and Knowledge
  • Data Management and Algorithms
  • Data Mining Algorithms and Applications
  • Bayesian Modeling and Causal Inference
  • Constraint Satisfaction and Optimization
  • Multi-Criteria Decision Making
  • Advanced Algebra and Logic
  • Natural Language Processing Techniques
  • Machine Learning and Algorithms
  • Biomedical Text Mining and Ontologies
  • Access Control and Trust
  • Security and Verification in Computing
  • Service-Oriented Architecture and Web Services
  • Business Process Modeling and Analysis
  • Language, Metaphor, and Cognition
  • Economic Theory and Institutions
  • Political Economy and Marxism
  • Educational Technology and Assessment
  • Algorithms and Data Compression
  • Model-Driven Software Engineering Techniques
  • Political Theory and Influence
  • Text and Document Classification Technologies
  • Spam and Phishing Detection

Technische Universität Dresden
2004-2023

Center for Systems Biology Dresden
2023

National Research University Higher School of Economics
2010-2021

University of Pretoria
2006-2008

Moscow Institute of Physics and Technology
2007

Russian State University for the Humanities
2001-2002

Recently concept lattices became widely used tools for intelligent data analysis. In this paper, several algorithms that generate the set of all formal concepts and diagram graphs are considered. Some modifications wellknown proposed. Algorithmic complexity is studied both theoretically (in worst case) experimentally. Conditions preferable use some given in terms density/sparseness underlying contexts. Principles comparing practical performance discussed.

10.1080/09528130210164170 article EN Journal of Experimental & Theoretical Artificial Intelligence 2002-04-01

We present an application of formal concept analysis aimed at representing a meaningful structure knowledge communities in the form lattice-based taxonomy. The taxonomy groups together agents (community members) who develop set notions. If no constraints are imposed on how it is built, community may become extremely complex and difficult to analyze. consider two approaches building concise representation, respecting underlying structural relationships while hiding superfluous information:...

10.1142/s0129054108005735 article EN International Journal of Foundations of Computer Science 2008-04-01

10.1007/s10472-007-9057-2 article EN Annals of Mathematics and Artificial Intelligence 2007-07-04

10.1016/j.dam.2007.04.014 article EN publisher-specific-oa Discrete Applied Mathematics 2007-05-09

10.1016/j.scico.2008.09.015 article EN publisher-specific-oa Science of Computer Programming 2008-11-15

10.1007/s10472-013-9353-y article EN Annals of Mathematics and Artificial Intelligence 2013-05-08

10.1016/j.dam.2019.02.036 article EN publisher-specific-oa Discrete Applied Mathematics 2019-03-22
Coming Soon ...