Book
Интеллектуализация обработки информации: 8-я международная конференция. Республика Кипр, г. Пафос, 17–24 октября 2010 г.: Сборник докладов
М.: МАКС Пресс, 2010.
Academic editor:
К. В. Воронцов
Chapters
Игнатов Д. И., Каминская А. Ю., Кузнецов С. О. и др. В кн.: Интеллектуализация обработки информации: 8-я международная конференция. Республика Кипр, г. Пафос, 17–24 октября 2010 г.: Сборник докладов. М.: МАКС Пресс, 2010. С. 140-143.
Added: Dec 3, 2012
Филипенков Н. В. В кн.: Интеллектуализация обработки информации: 8-я международная конференция. Республика Кипр, г. Пафос, 17–24 октября 2010 г.: Сборник докладов. М.: МАКС Пресс, 2010. С. 184-187.
Added: Dec 7, 2018
Similar publications
Савченко А. В. Системы управления и информационные технологии. 2011. Т. 44. № 2. С. 22-25.
Added: Jun 9, 2012
Леохин Ю. Л. Качество. Инновации. Образование. 2011. № 12. С. 75-82.
Added: Apr 25, 2012
Антипов Е. А. В кн.: Современные подходы к исследованию и моделированию в экономике, финансах и бизнесе: Материалы 5-й Ежегодной конференции Европейского университета в Санкт-Петербурге и Санкт-Петербургского экономико-математического института РАН. Вып. 5. СПб.: Европейский университет в Санкт-Петербурге, 2011. С. 14-15.
Added: Oct 4, 2012
Edited by: В. Стрижов М.: Торус Пресс, 2018.
The volume contains the abstracts of the 12th International Conference "Intelligent Data Processing: Theory and Applications". The conference is organized by the Russian Academy of Sciences, the Federal Research Center "Informatics and Control" of the Russian Academy of Sciences and the Scientific and Coordination Center "Digital Methods of Data Mining". The conference has being held biennially since 1989. It is one of the most recognizable scientific forums on data mining, machine learning, pattern recognition, image analysis, signal processing, and discrete analysis. The Organizing Committee of IDP-2018 is grateful to Forecsys Co. and CFRS Co. for providing assistance in the conference preparation and execution. The conference is funded by RFBR, grant 18-07-20075. The conference website http://mmro.ru/en/.
Added: Oct 9, 2018
Гостев И. М. В кн.: Распределенные вычисления и ГРИД-технологии в науке и образовании. Труды 5-й международной конференции Дубна, 16-21 июля 2012 г.. Дубна: Объединенный институт ядерных исследований, 2012. С. 274-279.
Added: Jul 19, 2013
Ozhegov E. M., Ozhegova A. Economics/EC. WP BRP. Высшая школа экономики, 2017. No. WP BRP 174/EC/2017.
In this research we analyze new approach for prediction of demand. In the studied market of performing arts the observed demand is limited by capacity of the house. Then one needs to account for demand censorhip to obtain unbiased estimates of demand funnction parameters. The presence of consumer segments with dierent purposes of going to the theatre and willingness-to-pay for performance and ticket characteristics causes a heterogeneity in theatre demand. We propose an estimator for prediction of demand that accounts for both demand censorhip and preferences heterogeneity. The estimator is based on the idea of classiffication and regression trees and bagging prediction aggregation extended for prediction of censored data. Our algorithm predicts and combines predictions for both discrete and continuous parts of censored data.We show that our estimator performs better in terms of prediction accuracy compared with estimators which accounts either for censorship, or heterogeneity only. The proposed approach is helpful for finding product segments and optimal price setting.
Added: Sep 20, 2017
Novikov A., Trofimov M., Oseledets I. stat :: arxiv :: Cornell University. stat :: arxiv :: Cornell University. stat :: arxiv :: Cornell University, 2017
Modeling interactions between features improves the performance of machine learning solutions in many domains (e.g. recommender systems or sentiment analysis). In this paper, we introduce Exponential Machines (ExM), a predictor that models all interactions of every order. The key idea is to represent an exponentially large tensor of parameters in a factorized format called Tensor Train (TT). The Tensor Train format regularizes the model and lets you control the number of underlying parameters. To train the model, we develop a stochastic version of Riemannian optimization, which allows us to fit tensors with 2^30 entries. We show that the model achieves state-of-the-art performance on synthetic data with high-order interactions.
Added: Sep 19, 2016
Завертяева М. А., Паршаков П. А., Ясницкий Л. Н. В кн.: Искусственный интеллект: Философия, методология, инновации. Материалы III Всероссийской конференции студентов, аспирантов и молодых ученых, г. Москва, МИРЭА, 11-13 ноября 2009 года. М.: Связь-принт, 2009. С. 299-302.
Added: Nov 10, 2012
Bartunov S., Кондрашкин Д. А., Osokin A. et al. Computation and language. arXiv:1502.07257. Arxiv.org, 2015
Recently proposed Skip-gram model is a powerful method for learning high-dimensional word representations that capture rich semantic relationships between words. However, Skip-gram as well as most prior work on learning word representations does not take into account word ambiguity and maintain only single representation per word. Although a number of Skip-gram modifications were proposed to overcome this limitation and learn multi-prototype word representations, they either require a known number of word meanings or learn them using greedy heuristic approaches. In this paper we propose the Adaptive Skip-gram model which is a nonparametric Bayesian extension of Skip-gram capable to automatically learn the required number of representations for all words at desired semantic resolution. We derive efficient online variational learning algorithm for the model and empirically demonstrate its efficiency on word-sense induction task.
Added: Nov 5, 2015
Савченко А. В., Савченко В. В. Известия высших учебных заведений. Радиоэлектроника. 2005. № 3. С. 10-18.
Added: Jun 9, 2012
Goncharuk N. B., Kudryashov Y. arxiv.org. math. Cornell University, 2015. No. 1504.03313.
In this article we prove in a new way that a generic polynomial vector field in ℂ² possesses countably many homologically independent limit cycles. The new proof needs no estimates on integrals, provides thinner exceptional set for quadratic vector fields, and provides limit cycles that stay in a bounded domain.
Added: Apr 15, 2015
В. В. Лебедев Известия РАН. Серия математическая. 2010. Т. 74. № 2. С. 131-164.
We consider certain spaces of functions on the circle, which naturally appear in harmonic analysis, and superposition operators on these spaces. We study the following question: which functions have the property that each their superposition with a homeomorphism of the circle belongs to a given space? We also study the multidimensional case.
Added: Apr 12, 2012
В. В. Лебедев Математические заметки. 2011. Т. 90. № 3. С. 394-407.
We consider the spaces of functions on the m-dimensional torus, whose Fourier transform is p -summable. We obtain estimates for the norms of the exponential functions deformed by a C1 -smooth phase. The results generalize to the multidimensional case the one-dimensional results obtained by the author earlier in “Quantitative estimates in the Beurling—Helson theorem”, Sbornik: Mathematics, 201:12 (2010), 1811 – 1836.
Added: Apr 12, 2012
Bauwens B., Makhlin A., Vereshchagin N. et al. Electronic Colloquium on Computational Complexity. Technical report. Hasso-Plattner-Institut, 2013. No. TR13-007.
Given a machine $U$, a $c$-short program for $x$ is a string $p$ such that $U(p)=x$ and the length of $p$ is bounded by $c$ + (the length of a shortest program for $x$). We show that for any universal machine, it is possible to compute in polynomial time on input $x$ a list of polynomial size guaranteed to contain a $O(\log |x|)$-short program for $x$. We also show that there exist computable functions that map every $x$ to a list of size $O(|x|^2)$ containing a $O(1)$-short program for $x$ and this is essentially optimal because we prove that such a list must have size $\Omega(|x|^2)$. Finally we show that for some machines, computable lists containing a shortest program must have length $\Omega(2^{|x|})$.
Added: Dec 14, 2013
Timorin V., Blokh A., Oversteegen L. et al. arxiv.org. math. Cornell University, 2013. No. 1305.5788.
According to a recent paper \cite{bopt13}, polynomials from the closure $\ol{\phd}_3$ of the {\em Principal Hyperbolic Domain} ${\rm PHD}_3$ of the cubic connectedness locus have a few specific properties. The family $\cu$ of all polynomials with these properties is called the \emph{Main Cubioid}. In this paper we describe the set $\cu^c$ of laminations which can be associated to polynomials from $\cu$.
Added: Oct 6, 2013
В. В. Лебедев Математический сборник. 2010. Т. 201. № 12. С. 103-130.
We consider the spaces of function on the circle whose Fourier transform is p-summable. We obtain estimates for the norms of exponential functions deformed by a C1 -smooth phase.
Added: Apr 12, 2012
Ивченко Г. И., Медведев Ю. И. М.: ЛКИ, 2010.
Added: Apr 12, 2012
Черников Б. В., Ильин В. В. М.: Издательский дом «Форум», 2010.
Added: Nov 29, 2012
Added: Jan 12, 2014
Ч. 1. М.: Энергоатомиздат, 2011.
Added: Feb 7, 2013
Лемешко Н. В., Захарова С. С. Труды Научно-исследовательского института радио. 2013. № 1. С. 40-45.
Added: Dec 16, 2013
Захарова С. С., Лемешко Н. В. Труды Научно-исследовательского института радио. 2012. № 4. С. 48-54.
Added: Dec 16, 2013
Edited by: А. Михайлов Вып. 14. М.: Социологический факультет МГУ, 2012.
Added: Mar 14, 2013
Roman Budylin. arxiv.org. math. Cornell University, 2014
We study some extension of a discrete Heisenberg group coming from the theory of loop-groups and find invariants of conjugacy classes in this group. In some cases including the case of the integer Heisenberg group we make these invariants more explicit.
Added: Nov 14, 2014