?
SmartTips: Online Products Recommendations System Based on Analyzing Customers Reviews
Applied Sciences (Switzerland). 2022. Vol. 12. No. 17. Article 8823.
Ali N., Alshahrani A., Alghamdi A., Novikov B.
Online customers’ opinions represent a significant resource for both customers and enterprises to extract much information that helps them make the right decision. Finding relevant data while searching the internet is a big challenge for web users, known as the “Problem of Information Overload”. Recommender systems have been recognized as a promising way of solving such problems. In this paper, a product recommendation system called “SmartTips” is introduced. The proposed model is built based on aspect-based sentiment analysis, which exploits customers’ feedback and applies the aspect term extraction model to rate various products and extract user preferences as well. Several factors were considered, including readers’ votes, aspect term frequency, opinion words’ frequencies, etc. We tested our model on benchmark datasets that are widely used, and the results show that it outperforms the baseline methods regarding the mean squared errors of generated predictions.
International Joint Conferences on Artificial Intelligence, 2026.
Added: October 1, 2026
Ryumina E., Aksenov A., Сысоев Д. С. et al., IEEE Computer Society, 2026.
Ambivalence/hesitancy recognition in unconstrained videos is a challenging problem due to the subtle, multimodal, and context-dependent nature of this behavioral state. In this paper, a multimodal approach for video-level ambivalence/hesitancy recognition is presented for the 10th ABAW Competition. The proposed approach integrates four complementary modalities: scene, face, audio, and text. Scene dynamics are captured with ...
Added: September 30, 2026
Ivanov F., Kotov F., IEEE Access 2026 Vol. 14 P. 104662–104679
U-UV codes, based on the Plotkin (U, U + V) construction, provide a unified framework that includes polar and Reed–Muller codes and enables flexible design through the choice of component codes. While modern capacity-approaching codes achieve excellent performance at large block lengths, their efficiency at short and moderate lengths remains limited, especially under low-latency constraints. ...
Added: September 30, 2026
Djambong Tenkeu H., Institute for System Programming of the RAS, 2026.
Added: September 29, 2026
Ivanashev Y., Доклады Российской академии наук. Математика, информатика, процессы управления (ранее - Доклады Академии Наук. Математика) 2026 Т. 529 С. 93–101
Язык L является нижним для релятивизируемого сложностного класса C, если CL=C. Для классов #P, GapP и SpanP известны точные нижние классы языков: Low(#P) = UP ∩ coUP, Low(GapP) = SPP и Low(SpanP) = NP ∩ coNP. В этой статье мы доказываем, что Low(TotP) = P, и приводим характеризации нижних классов функций для #P, GapP, TotP ...
Added: September 28, 2026
Piliugin L., Antropov A., Lobashev E. et al., Journal of Nuclear Materials 2026 Vol. 632 Article 156876
The effects of dislocations on the mobility of gas nanobubbles pinned to them are considered as novel unex- plored mechanisms of accelerated fission gas release and investigated using classical molecular dynamics of helium bubbles in FCC aluminum. Non-equilibrium methods are developed to calculate the mobility of a pinned bubble both along and across the dislocation ...
Added: September 28, 2026
Kashpurovich I., Oleynichenko A., Stegailov V., Supercomputing Frontiers and Innovations 2026 Vol. 13 No. 1 P. 52–73
We report a high-performance implementation of the resolution-of-the-identity Hartree–Fock method that fully exploits the permutational symmetry of three-center electron repulsion integrals (ERI). The present implementation adopts a hybrid MPI+OpenMP parallelization strategy. Two different algorithmic approaches (with and without the pre-transformation of ERIs) are compared. A custom data layout introduced previously is employed. Designed to efficiently ...
Added: September 28, 2026
Teregulov T., Loubenets E. R., / Series Quantum Physics "arXiv". 2026. No. 2609.31472.
We develop a new three-party quantum secret-sharing (QSS) protocol based on a three-qubit W state. This protocol encodes the secret-sequence bits using X gates and employs randomly selected Hadamard operations and measurement bases to generate information and security-test rounds. We evaluate the efficiency of the proposed protocol and analyze its security against an internal adversary ...
Added: September 28, 2026
Silakov D., Системный администратор 2026 С. 84–89
Social media users rarely think about what lies behind the beautiful facade of activity feeds, teeming with photos and video stories. However, the widespread popularity of such platforms generates a huge amount of all sorts of content that needs to be stored, processed quickly, and displayed, and in the era of AI, it also needs ...
Added: September 28, 2026
Prokhorov A., Wei Z., Sang H. et al., Journal of Productivity Analysis 2026 Vol. 65 P. 1–16
The stochastic frontier model (SFM) is widely employed in the analysis of productivity and efficiency, yet strict parametric forms, such as the Cobb-Douglas and Translog functions, are often assumed for modeling production, leading to potential misspecification issues. While semi- and nonparametric SFMs offer greater flexibility, they face challenges in imposing monotonicity and concavity to maintain ...
Added: September 28, 2026
Qian X., Guan X., Zhang B. et al., Journal of Global Optimization 2026
Inverse quickest path problem on networks ...
Added: September 27, 2026
Switzerland: Springer Cham, 2026.
This volume gathers selected, peer-reviewed contributions presented at the 19th Conference of the International Federation of Classification Societies (IFCS 2026), held on 14–16 July 2026 in Milan, Italy. Reflecting the volume’s motto, Navigating Complexity – Statistical Methods, Data Analysis, and Machine Learning for Actionable Insights, the papers showcase modern methodologies and real-world applications designed to extract ...
Added: September 25, 2026
Kraevskiy A., Sokolovskiy E., Prokhorov A., Emerging Markets Review 2026 No. 74 P. 1–19
Financial markets of emerging economies are vulnerable to extreme and cascading information spillovers, surges, sudden stops and reversals. With this in mind, we develop a new online early warning system (EWS) to detect what is referred to as ‘concept drift’ in machine learning, as a ‘regime shift’ in economics and as a ‘change-point’ in statistics. ...
Added: September 25, 2026
Дубич Е. В., Schagin D., Славянский форум 2026 № 2 (52) С. 560–565
The paper compares HTTP/2 and HTTP/3 for static resource transfer under software-simulated network degradation. The experiment shows that HTTP/3 is not universally faster, but it is more stable as latency and packet loss increase. ...
Added: September 25, 2026
Joulitov A.K., Lomazova I.A., Proceedings of the Institute for System Programming of the RAS 2026 Vol. 38 No. 4(2) P. 215–224
In process mining, DFG (Directly-Follows Graph) models are popular due to their simplicity and clarity. However, if a process is acyclic but contains concurrent events, standard algorithms for discovering DFG models can generate "fake" cycles that do not actually exist in the event log. These cycles hinder the analysis of information processes, significantly reducing the ...
Added: September 24, 2026
Добрина Д. Н., Nesterenko A., Прикладная дискретная математика. Приложение 2026 № 19 С. 151–159
Работа содержит результаты формального анализа криптографических механизмов, входящих в состав проекта методических рекомендаций «Защищенный универсальный протокол передачи данных и управления микросхемой интеллектуальной карты» (протокол SECUNDA). Получена формальная модель и перечень трудноразрешимых математических задач, трудоёмкостью решения которых можно оценить стойкость используемых криптографических механизмов. ...
Added: September 24, 2026
I.I. Sergeev, I.A. Lomazova, Modeling and Analysis of Information Systems 2026 Vol. 33 No. 3 P. 394–419
Object-centric process mining has emerged as a powerful paradigm for analyzing event data involving multiple interacting business objects. Existing discovery techniques often rely on object-centric Petri nets with fixed arc multiplicities, limiting their ability to represent parametric resource consumption and production patterns and to capture quantitative dependencies between interacting object types. In this paper, we ...
Added: September 24, 2026
Ivan Bulychev, Savchenko A., AI 2026 Vol. 7 No. 9 Article 380
Recent advances in large language model (LLM) agents have shown promise for autonomous decision-making in recommender systems. However, existing approaches suffer from two fundamental limitations: flat agent memories that conflate different information modalities and prohibitive computational costs that prevent scaling beyond a few hundred users. We propose Hybrid-GraphRAG, a recommender system that integrates hierarchical agent ...
Added: September 24, 2026
Snegirev A., Sychev S., Futures 2026 Vol. 183 P. 1–22
This study addresses the systemic identification and categorization of risks associated with AI development, arising from tensions between technological evolution and institutional, infrastructural, and economic contexts. Drawing on a constructionist methodology, we interpret technological risks as constitutive elements of expert communities' images of the future. Through in-depth interviews with 100 AI experts, proportionally representing corporate, ...
Added: September 23, 2026
Kalicheva V., Kirina M., , in: Speech and Computer. 28th International Conference, SPECOM 2026, Ohrid, North Macedonia, September 17–18, 2026, Proceedings, Part I.: Springer, 2027. P. 320–337.
The rapid expansion of the online education market has produced large volumes of unstructured data—course reviews containing detailed evaluations of specific educational components. Aspect-based sentiment analysis (ABSA) makes it possible to move from a holistic assessment of the educational experience to an analysis of its individual constituents, identifying particular aspects of learning and students’ attitudes ...
Added: September 20, 2026
Grishina E., Stepan Kuznetsov, Tsyganov A. et al., , in: KDD '26: Proceedings of the 32th ACM SIGKDD Conference on Knowledge Discovery and Data Mining.: Association for Computing Machinery (ACM), 2026. P. 1310–1321.
The ranking of recommendation algorithms is a challenging problem since model performance is sensitive to dataset characteristics such as sparsity, sequential structure, and scale. This drives a demand for a proper methodology for fair comparison between algorithms. Naive aggregation of performance metrics (e.g., averaging NDCG over benchmarks) can yield misleading rankings, undermining practical selection. To ...
Added: August 7, 2026
Tyuryakova-Matveeva D., Цифровые гуманитарные исследования 2026 № 1 С. 4–26
The article explores cultural references in the works of Andrei Voznesensky by analyzing the personalities he mentions. A total of 1,678 works were processed, including poetry, prose, and early unpublished poems. NER methods based on Natasha, spaCy, and LLM Grok tools made it possible to study the frequency of mentions of famous people and their ...
Added: May 31, 2026
Ankudinov I., Социология: методология, методы, математическое моделирование 2025 № 61 С. 165–203
The changing political mood of Russians is a constant subject of interest for sociological agencies. With the development of the Internet, conventional questionnaire research began to be supplemented by online surveys and, despite some skepticism, by social media mining. This article attempts to adjust an accidental web-sample so as to bring its estimates closer to ...
Added: April 22, 2026
Чудинова О. С., Первицкая Л. А., Ramenskaya A., Индустриальная экономика 2026 № 1 С. 65–78
This article is devoted to the development of an algorithm for analyzing news information using machine learning methods implemented in Python libraries. The choice of tools used at each stage of the algorithm is justified by calculating metrics for the quality of the solution to the corresponding machine learning problems. The algorithm’s results are presented ...
Added: April 20, 2026