[go: up one dir, main page]

 
 
applsci-logo

Journal Browser

Journal Browser

Innovative Data Mining Techniques for Advanced Recommender Systems

A special issue of Applied Sciences (ISSN 2076-3417). This special issue belongs to the section "Computing and Artificial Intelligence".

Deadline for manuscript submissions: 20 May 2025 | Viewed by 896

Special Issue Editors


E-Mail Website
Guest Editor
School of Computer Science and Engineering, Northeastern University, Shenyang 110167, China
Interests: recommender systems; social computing

E-Mail Website
Guest Editor
School of Computing Technologies, RMIT University, Melbourne, VIC 3000, Australia
Interests: social network analysis and mining; data-driven machine learning; crowdsourcing data processing; recommender systems and big data processing; multimedia database and streams

E-Mail Website
Guest Editor
College of Computer Science and Technology, Zhejiang University, Hangzhou 310027, China
Interests: privacy-preserving machine learning; federated learning; trustworthy machine learning
Special Issues, Collections and Topics in MDPI journals

Special Issue Information

Dear Colleagues,

 As the digital landscape evolves, the demand for personalized user experiences has driven significant advancements in recommender systems. This Special Issue focuses on innovative data mining techniques that enhance the efficacy and accuracy of these systems across various applications, including e-commerce, content streaming, and social media. We invite contributions that explore methodologies such as collaborative filtering, content-based filtering, and hybrid approaches, alongside emerging techniques like explainable recommendation, cross-domain recommendation, and large language model-based recommendation. Additionally, we encourage authors to address challenges related to fairness in recommendation, bias in recommender systems, and the trustworthiness of recommendations. We also welcome studies on causal recommendation and contextualized recommendation. Case studies showcasing real-world applications and empirical evaluations of proposed methods are highly encouraged. By fostering a comprehensive understanding of these critical aspects, this Special Issue aims to contribute valuable insights and pave the way for future research in the rapidly evolving field of artificial intelligence.

Dr. Yue Kou
Dr. Xiangmin Zhou
Dr. Chaochao Chen
Guest Editors

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Applied Sciences is an international peer-reviewed open access semimonthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 2400 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • explainable recommendation
  • cross-domain recommendation
  • fairness in recommendation
  • bias in recommender systems
  • trustworthiness of recommendation
  • causal recommendation
  • contextualized recommendation
  • large language model-based recommendation

Benefits of Publishing in a Special Issue

  • Ease of navigation: Grouping papers by topic helps scholars navigate broad scope journals more efficiently.
  • Greater discoverability: Special Issues support the reach and impact of scientific research. Articles in Special Issues are more discoverable and cited more frequently.
  • Expansion of research network: Special Issues facilitate connections among authors, fostering scientific collaborations.
  • External promotion: Articles in Special Issues are often promoted through the journal's social media, increasing their visibility.
  • e-Book format: Special Issues with more than 10 articles can be published as dedicated e-books, ensuring wide and rapid dissemination.

Further information on MDPI's Special Issue policies can be found here.

Published Papers (2 papers)

Order results
Result details
Select all
Export citation of selected articles as:

Research

21 pages, 904 KiB  
Article
Efficient Top-k Spatial Dataset Search Processing
by Jie Sun, Hua Dai, Mingyue Zhang, Hao Zhou, Pengyue Li, Geng Yang and Lei Chen
Appl. Sci. 2025, 15(5), 2321; https://doi.org/10.3390/app15052321 - 21 Feb 2025
Viewed by 183
Abstract
In this paper, we introduce two novel top-k spatial dataset search schemes, KSDS and KSDS+. The core innovation of these schemes lies in partitioning the spatial datasets into grids and assessing similarity based on the distribution of points within these grids. This [...] Read more.
In this paper, we introduce two novel top-k spatial dataset search schemes, KSDS and KSDS+. The core innovation of these schemes lies in partitioning the spatial datasets into grids and assessing similarity based on the distribution of points within these grids. This approach provides a robust foundation for spatial dataset search. To optimize search performance, we have developed an optimized scheme that incorporates two key strategies: a GMBR-based optimization strategy and a pooling-based optimization strategy. These strategies are designed to filter datasets to significantly improve search efficiency. Our experimental results demonstrate that KSDS and KSDS+ can perform top-k spatial dataset searches with both high effectiveness and efficiency, outpacing existing methods in terms of search speed. In the future, our research will explore other similarity-calculation models to further accelerate processing times. Additionally, we aim to integrate privacy-preserving techniques to ensure secure dataset searches. These advancements are intended to enhance the practicality and efficiency of spatial dataset searches in real-world applications. Full article
(This article belongs to the Special Issue Innovative Data Mining Techniques for Advanced Recommender Systems)
Show Figures

Figure 1

Figure 1
<p>An example of top-<span class="html-italic">k</span> spatial dataset search.</p>
Full article ">Figure 2
<p>An example of grid distribution representation.</p>
Full article ">Figure 3
<p>An example of spatial datasets with zero similarity.</p>
Full article ">Figure 4
<p>An example of <math display="inline"><semantics> <mi>ϵ</mi> </semantics></math>-pooling index (<math display="inline"><semantics> <mrow> <mi>ϵ</mi> <mo>=</mo> <mn>2</mn> </mrow> </semantics></math>).</p>
Full article ">Figure 5
<p>MSE versus <span class="html-italic">c</span>.</p>
Full article ">Figure 6
<p>MSE versus <math display="inline"><semantics> <mi>σ</mi> </semantics></math>.</p>
Full article ">Figure 7
<p>MSE versus <span class="html-italic">k</span>.</p>
Full article ">Figure 8
<p>MSE versus <span class="html-italic">n</span>.</p>
Full article ">Figure 9
<p>MSE versus <span class="html-italic">u</span>.</p>
Full article ">Figure 10
<p>Time cost versus <math display="inline"><semantics> <mi>σ</mi> </semantics></math>.</p>
Full article ">Figure 11
<p>Time cost versus <span class="html-italic">k</span>.</p>
Full article ">Figure 12
<p>Time cost versus <span class="html-italic">n</span>.</p>
Full article ">Figure 13
<p>Time cost versus <span class="html-italic">u</span>.</p>
Full article ">Figure 14
<p>Time cost versus <math display="inline"><semantics> <mi>ϵ</mi> </semantics></math>.</p>
Full article ">Figure 15
<p>Pooling index cost versus <math display="inline"><semantics> <mi>ϵ</mi> </semantics></math>.</p>
Full article ">
21 pages, 546 KiB  
Article
Discreetly Exploiting Inter-Session Information for Session-Based Recommendation
by Jian Sun, Zihan Wang, Gang Wu, Haotong Wang, Baiyou Qiao and Donghong Han
Appl. Sci. 2025, 15(4), 2151; https://doi.org/10.3390/app15042151 - 18 Feb 2025
Viewed by 234
Abstract
Limited intra-session information has constrained the performance of early Graph Neural Network (GNN)-based session-based recommendation (SBR) models. To address this issue, researchers have increasingly incorporated inter-session information to improve next-item prediction. Although such additional information can provide valuable cues, it may also introduce [...] Read more.
Limited intra-session information has constrained the performance of early Graph Neural Network (GNN)-based session-based recommendation (SBR) models. To address this issue, researchers have increasingly incorporated inter-session information to improve next-item prediction. Although such additional information can provide valuable cues, it may also introduce undesirable interference. However, existing approaches often fail to effectively extract relevant information while filtering out extraneous interference, largely owing to incomplete modeling of inter-session dependencies. Specifically, inter-session connections have been examined merely at the item level, overlooking more intricate distinctions and associations between sessions. Moreover, current methods rely exclusively on similarity as the metric for evaluating inter-session dependencies, overlooking their multidimensional complexity. In this work, we propose a GNN-based SBR model that discreetly exploits inter-session information (DEISI). To overcome the first limitation, we introduce factor-level inter-session dependencies using disentangled representation learning, enabling the capture of finer-grained interactions. To address the second limitation, we design a novel metric named “stability” to complement similarity, providing an additional perspective on inter-session relationships. Consequently, DEISI constructs more detailed and reliable inter-session dependencies. Extensive experiments on three benchmark datasets demonstrate the superior performance of DEISI over state-of-the-art models. Full article
(This article belongs to the Special Issue Innovative Data Mining Techniques for Advanced Recommender Systems)
Show Figures

Figure 1

Figure 1
<p>Overview of DEISI.</p>
Full article ">Figure 2
<p>Details for weight update with stability.</p>
Full article ">Figure 3
<p>Impact of the number of factors (<span class="html-italic">k</span>).</p>
Full article ">Figure 4
<p>P@20 and M@20 on Yoochoose of long and short sessions.</p>
Full article ">Figure 5
<p>P@20 and M@20 on Nowplaying of long and short sessions.</p>
Full article ">Figure 6
<p>Performance of I3GN and I3GN-W on Nowplaying.</p>
Full article ">Figure 7
<p>Performance of COTREC and COTREC-W on Diginetica.</p>
Full article ">
Back to TopTop