• A
  • A
  • A
  • ABC
  • ABC
  • ABC
  • А
  • А
  • А
  • А
  • А
Regular version of the site
Article
Efficient indexing of peptides for database search using Tide

Acquaye F. L., Kertesz-Farkas A., Stafford Noble W.

Journal of Proteome Research. 2023. Vol. 22. No. 2. P. 577-584.

Article
Mint: MDL-based approach for Mining INTeresting Numerical Pattern Sets

Makhalova T., Kuznetsov S., Napoli A.

Data Mining and Knowledge Discovery. 2022. P. 108-145.

Book chapter
Modeling Generalization in Domain Taxonomies Using a Maximum Likelihood Criterion

Zhirayr Hayrapetyan, Nascimento S., Trevor F. et al.

In bk.: Information Systems and Technologies: WorldCIST 2022, Volume 2. Iss. 469. Springer, 2022. P. 141-147.

Book chapter
Ontology-Controlled Automated Cumulative Scaffolding for Personalized Adaptive Learning

Dudyrev F., Neznanov A., Anisimova K.

In bk.: Artificial Intelligence in Education. Posters and Late Breaking Results, Workshops and Tutorials, Industry and Innovation Tracks, Practitioners’ and Doctoral Consortium -23rd International Conference, AIED 2022, Durham, UK, July 27–31, 2022, Proceedings, Part II. Springer, 2022. P. 436-439.

Book chapter
Triclustering in Big Data Setting

Egurnov D., Точилкин Д. С., Ignatov D. I.

In bk.: Complex Data Analytics with Formal Concept Analysis. Springer, 2022. P. 239-258.

Article
Triclusters of Close Values for the Analysis of 3D Data

Egurnov D., Ignatov D. I.

Automation and Remote Control. 2022. Vol. 83. No. 6. P. 894-902.

Article
Deep Convolutional Neural Networks Help Scoring Tandem Mass Spectrometry Data in Database-Searching Approaches

Kudriavtseva P., Kashkinov M., Kertész-Farkas A.

Journal of Proteome Research. 2021. Vol. 20. No. 10. P. 4708-4717.

Article
Language models for some extensions of the Lambek calculus

Kanovich M., Kuznetsov S., Scedrov A.

Information and Computation. 2022. Vol. 287.

Workshop on Theoretical Computer Science

Sergei O. Kuznetsov, the head of Data Analysis and Artificial Intelligence, gave a talk on ‘'Symbolic machine learning as dualizing monotone Boolean functions”

A natural problem setting in machine learning is shown to be equivalent to the problem of dualizing a monotone boolean function. The most classical form of dualization setting is converting a DNF to CNF. The complexity of a solution depends on particular machine learning setting, which defines the type of the structure where dualization takes place. Several intractability and tractability results are discussed.

The full programm of the workshop can be found here: https://cs.hse.ru/big-data/tcs-lab/tcs2016/