Николенко Сергей Игоревич
Факультет компьютерных наук
Профессиональные интересы
Должности
- Профессор — Факультет компьютерных наук, Департамент анализа данных и искусственного интеллекта
Био
- · Начал работать в НИУ ВШЭ в 2023 году.
Образование
- 2009 · Кандидат физико-математических наук: Санкт-Петербургский государственный университет, специальность 01.01.06 «Математическая логика, алгебра и теория чисел», тема диссертации: Новые конструкции криптографических примитивов, основанные на полугруппах, группах и линейной алгебре
- 2005 · Специалитет: Санкт-Петербургский государственный университет, специальность «Математика», квалификация «Математик»
Опыт работы
- · 2005-2008: : аспирант, лаборатория математической логики ПОМИ РАН, Санкт-Петербург
- · 2006-2010: : ассистент, СПбГУ ИТМО, Санкт-Петербург
- · 2008-2010: : старший научный сотрудник, Центр речевых технологий, Санкт-Петербург
- · 2011-2012: : старший научный сотрудник, Лаборатория алгоритмической биологии, СПбАУ РАН, Санкт-Петербург
- · 2011-2014: : директор по разработкам, Surfingbird, Москва. 2008-...: доцент, СПбАУ РАН, Санкт-Петербург. 2008-...: научный сотрудник, лаборатория математической логики ПОМИ РАН, Санкт-Петербург
Награды и поощрения
- · Надбавка за публикацию в международном рецензируемом научном издании (2021–2022, 2020–2022, 2018–2020)
- · Надбавка за статью в зарубежном рецензируемом журнале (2015–2017, 2013–2015)
- · Лучший преподаватель — 2020–2021, 2017
Гранты и проекты
- — · на соискание учёной степени кандидата наук
Идентификаторы исследователя
- ORCID:
0000-0001-7787-2251 - ResearcherID:
I-7696-2013 - SPIN РИНЦ:
8186-1253 - Google Scholar: http://scholar.google.ru/citations?&user=_lk95cEAAAAJ
- Scopus AuthorID:
13608710100
Публикации (89)
Efficient Demand Assignment in Multi-Connected Microgrids with a Shared Central Grid
2013 в печати · CHAPTER · en
With the proliferation of distributed generation, an electrical load can be satisfied either by a centralized generator or by local/nearby distributed generators. Given a set of resource demands in a collection of geographically co-located microgrids connected to the central grid, each such demand characterized by a power level and a duration. We study algorithms that allocate generation resources to demands by configuring switched paths from sources to loads. We consider the case when each demand can be met by two generators, one of them representing the central grid and thus shared among all demands.
Semi-supervised Tag Extraction in a Web Recommender System
2013 · CHAPTER · en
An important characteristic feature of recommender systems for web pages is the abundance of textual information in and about the items being recommended (web pages). To improve recommendations and enhance user experience, we propose to use automatic tag (keyword) extraction for web pages entering the recommender system. We present a novel tag extraction algorithm that employs semi-supervised classification based on a dataset consisting of pre-tagged documents and (for the most part) partially tagged documents whose tags are automatically mined from the content. We also compare several classification algorithms for tag extraction in this context.
A New Recommender System for the Interactive Radionetwork FMHost
2012 · CHAPTER · en
We describe a new recommender system for the Russian interactive radio network FMhost. The new recommender model combines collaborative and user-based approaches. The system extracts information from tags of listened tracks for matching user and radio station profiles and follows an adaptive online learning strategy based on user history. We also provide some basic examples and describe the quality of service evaluation methodology.
Модель рекомендательной системы для интерактивного радиосервиса FMhost
2012 · CHAPTER · ru
Представлена модель новой рекомендательной системы для интерактивного радиосервиса FMhost. Новая рекомендательная модель сочетает коллаборативный и основанный на поведении пользователя подходы. Приводятся результаты предварительного анализа данных и описывается методика оценивания качества.
Online Recommender System for Radio Station Hosting
2012 · CHAPTER · en
Представлена модель новой рекомендательной системы для интерактивного радиосервиса FMhost. Новая рекомендательная модель сочетает коллаборативный и основанный на поведении пользователя подходы. Приводятся результаты предварительного анализа данных и описывается методика оценивания качества.
SPAdes: A New Genome Assembly Algorithm and Its Applications to Single-Cell Sequencing
2012 · ARTICLE · en
The lion's share of bacteria in various environments cannot be cloned in the laboratory and thus cannot be sequenced using existing technologies. A major goal of single-cell genomics is to complement gene-centric metagenomic data with whole-genome assemblies of uncultivated organisms. Assembly of single-cell data is challenging because of highly non-uniform read coverage as well as elevated levels of sequencing errors and chimeric reads. We describe SPAdes, a new assembler for both single-cell and standard (multicell) assembly, and demonstrate that it improves on the recently released E+V−SC assembler (specialized for single-cell data) and on popular assemblers Velvet and SoapDeNovo (for multicell data). SPAdes generates single-cell assemblies, providing information about genomes of uncultivatable bacteria that vastly exceeds what may be obtained via traditional metagenomics studies. SPAdes is available online (http://bioinf.spbau.ru/spades). It is distributed as open source software.
A Taxonomy of Semi-FIFO Policies
2012 · CHAPTER · en
Modern network processors (NPs) increasingly deal with packets that require heterogeneous processing. We consider the problem of managing a bounded size input queue buffer where each packet requires several rounds of processing before it can be transmitted out. The goal of admission control policies is to maximize the total number of successfully transmitted packets. Usually the transmission order of the packets is induced by the processing order. However, processing order can have a significant impact on the performance of buffer management policies even if the order of transmission is fixed. For this reason we decouple processing order from transmission order and restrict our transmission order to First-In-First-Out (FIFO) but allow for different orders of packet processing, introducing the class of such policies as Semi-FIFO. In this work, we build a taxonomy of Semi-FIFO policies and provide worst case guarantees for different processing orders. We consider various special cases and properties of Semi-FIFO policies, e.g., greedy, work-conserving, lazy, and push-out policies, and show how these properties affect performance. Further, we conduct a comprehensive simulation study that validates our results.
A New Click Model for Relevance Prediction in Web Search
2012 · CHAPTER · en
We present a new click model for processing click logs and predicting relevance and appeal for query–document pairs in search results. Our model is a simplified version of the task-centric click model but outperforms it in an experimental comparison.
FIFO Queueing Policies for Packets with Heterogeneous Processing
2012 · CHAPTER · en
We consider the problem of managing a bounded size First-In-First-Out (FIFO) queue buffer, where each incoming unit-sized packet requires several rounds of processing before it can be transmitted out. Our objective is to maximize the total number of successfully transmitted packets. We consider both push-out (when the policy is permitted to drop already admitted packets) and non-push-out cases. In particular, we provide analytical guarantees for the throughput performance of our algorithms. We further conduct a comprehensive simulation study which experimentally validates the predicted theoretical behaviour.
A Two-Step Soft Segmentation Procedure for MALDI Imaging Mass Spectrometry Data
2012 · CHAPTER · en
We propose a new method for soft spatial segmentation of matrix assisted laser desorption/ionization imaging mass spectrometry (MALDI-IMS) data which is based on probabilistic clustering with subsequent smoothing. Clustering of spectra is done with the Latent Dirichlet Allocation (LDA) model. Then, clustering results are smoothed with a Markov random field (MRF) resulting in a soft probabilistic segmentation map. We show several extensions of the basic MRF model specifically tuned for MALDI-IMS data segmentation. We describe a highly parallel implementation of the smoothing algorithm based on GraphLab framework and show experimental results.
Курсы (3)
-
Машинное обучение · 4 раза
2025/2026, 2024/2025, 2023/2024, 2022/2023 · Магистратура / Маго-лего · рус
-
Deep Generative Models
2022/2023 · Маго-лего / Нижний Новгород · Анг
-
01.04.02. Прикладная математика и информатика
2022/2023 · Магистратура · рус