<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE ArticleSet PUBLIC "-//NLM//DTD PubMed 2.7//EN" "https://dtd.nlm.nih.gov/ncbi/pubmed/in/PubMed.dtd">
<ArticleSet>
<Article>
<Journal>
				<PublisherName>Shahrood University of Technology</PublisherName>
				<JournalTitle>Journal of AI and Data Mining</JournalTitle>
				<Issn>2322-5211</Issn>
				<Volume>13</Volume>
				<Issue>1</Issue>
				<PubDate PubStatus="epublish">
					<Year>2025</Year>
					<Month>01</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>An Evaluation of New Meta-heuristics for Virtual Machine Placement in Cloud Data Centers</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>1</FirstPage>
			<LastPage>10</LastPage>
			<ELocationID EIdType="pii">3387</ELocationID>
			
<ELocationID EIdType="doi">10.22044/jadm.2025.14987.2597</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Mohsen</FirstName>
					<LastName>Kiani</LastName>
<Affiliation>Department of Computer Science, Khansar Campus, University of Isfahan, Isfahan, Iran.</Affiliation>

</Author>
<Author>
					<FirstName>Mohammad Reza</FirstName>
					<LastName>Khayyambashi</LastName>
<Affiliation>Department of Software Engineering, Faculty of Computer Engineering, University of Isfahan, Isfahan, Iran.</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2024</Year>
					<Month>09</Month>
					<Day>03</Day>
				</PubDate>
			</History>
		<Abstract>The present study investigates the effectiveness of several new meta-heuristic (MH) methods in solving virtual machine (VM) to physical machine (PM) placement (VMP) in cloud data centers. More specifically, Coati optimization algorithm (COA) is properly adapted for solving VMP by introducing several operators for the phases of the algorithm. Several emerging and classic meta-heuristics are also included in the evaluations, including genetic algorithm, chemical reaction optimization, Harris hawk optimization (HHO), and electron valley optimizer (EVO). Two main parameters are included in our evaluations, including power consumption and resource wastage. The algorithms are evaluated in terms of their ability to reduce power consumption and resource wastage in VMP, and also in terms of their execution times. A set of evaluations with synthetic VMs are performed. The results indicate that all MHs perform almost similarly, while emerging methods (COA, HHO, EVO) have a marginal benefit.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Cloud Computing</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Coati Optimization Algorithm</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Cloud Date Center</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Virtual Machine</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://jad.shahroodut.ac.ir/article_3387_c72067f4141aad0d3b3fa15c025b012c.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>Shahrood University of Technology</PublisherName>
				<JournalTitle>Journal of AI and Data Mining</JournalTitle>
				<Issn>2322-5211</Issn>
				<Volume>13</Volume>
				<Issue>1</Issue>
				<PubDate PubStatus="epublish">
					<Year>2025</Year>
					<Month>01</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Enhancing the Quality of Scientific Writing Using Advanced Language Models: Automated Evaluation and Proofreading</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>11</FirstPage>
			<LastPage>24</LastPage>
			<ELocationID EIdType="pii">3388</ELocationID>
			
<ELocationID EIdType="doi">10.22044/jadm.2025.15482.2661</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Amir Ali</FirstName>
					<LastName>Kharazmi</LastName>
<Affiliation>Faculty of Computer Engineering and IT, Shahrood University of Technology, Shahrood, Iran.</Affiliation>

</Author>
<Author>
					<FirstName>Hamid</FirstName>
					<LastName>Hassanpour</LastName>
<Affiliation>Faculty of Computer Engineering and IT, Shahrood University of Technology, Shahrood, Iran.</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2024</Year>
					<Month>12</Month>
					<Day>18</Day>
				</PubDate>
			</History>
		<Abstract>Advancements in artificial intelligence have produced powerful language models that enhance scientific writing through automated evaluation and proofreading. Effective use of these models relies on prompt engineering—the precise formulation of requests—which directly influences output quality. As the saying goes, &quot;Asking correctly is half of knowledge,&quot; emphasizing the importance of well-crafted prompts. In this study, we introduce a novel approach utilizing the simple language model Gemma-7b-it to improve scientific writing. By detailing the specific characteristics and structures of each section of a scientific paper, we prompt the model to evaluate and proofread text for clarity, coherence, and adherence to academic standards. Our method comprises three stages: initial evaluation, feedback-based proofreading, and iterative refinement using textual gradient optimization. Tested on a dataset of 25 scientific articles, expert evaluations confirm that this method achieves significant enhancements in abstract quality. These findings demonstrate that meticulous prompt engineering can enable simpler language models to produce results comparable to advanced models like GPT-4, underscoring the critical role of prompt optimization in achieving high-quality scientific writing.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Artificial intelligence</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Natural Language Processing</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Prompt Optimization</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Gradient-based Optimization</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://jad.shahroodut.ac.ir/article_3388_f76987d680ed59462ecc3eb09f09dd07.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>Shahrood University of Technology</PublisherName>
				<JournalTitle>Journal of AI and Data Mining</JournalTitle>
				<Issn>2322-5211</Issn>
				<Volume>13</Volume>
				<Issue>1</Issue>
				<PubDate PubStatus="epublish">
					<Year>2025</Year>
					<Month>01</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Improving the Efficiency of Semantic Segmentation Implemented in Spiking Neural Networks</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>25</FirstPage>
			<LastPage>39</LastPage>
			<ELocationID EIdType="pii">3393</ELocationID>
			
<ELocationID EIdType="doi">10.22044/jadm.2025.15076.2612</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Elahe</FirstName>
					<LastName>Yadolahi</LastName>
<Affiliation>Electrical and Computer Engineering Department, Semnan University, Semnan, Iran</Affiliation>

</Author>
<Author>
					<FirstName>Sheis</FirstName>
					<LastName>Abolmaali</LastName>
<Affiliation>Electrical and Computer Engineering Department, Semnan University, Semnan, Iran</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2024</Year>
					<Month>09</Month>
					<Day>23</Day>
				</PubDate>
			</History>
		<Abstract>Semantic segmentation is a critical task in computer vision, focused on extracting and analyzing detailed visual information. Traditional artificial neural networks (ANNs) have made significant strides in this area, but spiking neural networks (SNNs) are gaining attention for their energy efficiency and biologically inspired time-based processing. However, existing SNN-based methods for semantic segmentation face challenges in achieving high accuracy due to limitations such as quantization errors and suboptimal membrane potential distribution. This research introduces a novel spiking approach based on Spiking-DeepLab, incorporating a Regularized Membrane Potential Loss (RMP-Loss) to address these challenges. Built upon the DeepLabv3 architecture, the proposed model leverages RMP-Loss to enhance segmentation accuracy by optimizing the membrane potential distribution in SNNs. By optimizing the storage of membrane potentials, where values are stored only at the final time step, the model significantly reduces memory usage and processing time. This enhancement not only improves the computational efficiency but also boosts the accuracy of semantic segmentation, enabling more accurate temporal analysis of network behavior. The proposed model also demonstrates better robustness against noise, maintaining its accuracy under varying levels of Gaussian noise, which is common in real-world scenarios. The proposed approach demonstrates competitive performance on standard datasets, showcasing its potential for energy-efficient image processing applications.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Supervised learning</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Image Processing</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">semantic segmentation</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">spiking neural networks</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">RMP-Loss</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://jad.shahroodut.ac.ir/article_3393_6037549ae335d77c3bf29966568ebd58.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>Shahrood University of Technology</PublisherName>
				<JournalTitle>Journal of AI and Data Mining</JournalTitle>
				<Issn>2322-5211</Issn>
				<Volume>13</Volume>
				<Issue>1</Issue>
				<PubDate PubStatus="epublish">
					<Year>2025</Year>
					<Month>01</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>What Drives House Prices? A Linear Regression Approach to Size, Condition, and Features</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>41</FirstPage>
			<LastPage>51</LastPage>
			<ELocationID EIdType="pii">3389</ELocationID>
			
<ELocationID EIdType="doi">10.22044/jadm.2025.15529.2668</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Ju</FirstName>
					<LastName>Xiaolin</LastName>
<Affiliation>School of Artificial Intelligence and Computer Science, Nantong University, Nantong, China</Affiliation>

</Author>
<Author>
					<FirstName>Vaskar</FirstName>
					<LastName>Chakma</LastName>
<Affiliation>School of Artificial Intelligence and Computer Science, Nantong University, Nantong, China</Affiliation>

</Author>
<Author>
					<FirstName>Misbahul</FirstName>
					<LastName>Amin</LastName>
<Affiliation>School of Artificial Intelligence and Computer Science, Nantong University, Nantong, China</Affiliation>

</Author>
<Author>
					<FirstName>Arkhid Chakma</FirstName>
					<LastName>Joy</LastName>
<Affiliation>School of Information and Management Systems Engineering, Nagaoka University of Technology, Japan.</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2024</Year>
					<Month>12</Month>
					<Day>31</Day>
				</PubDate>
			</History>
		<Abstract>This research examines the key factors influencing house prices, focusing on how size, condition, and structural features contribute to property valuation. Using a dataset from Washington State, USA, covering the year 2014 with over 4,600 entries, a multivariate analysis was conducted with a Linear Regression model to assess the relationships between crucial features such as square footage, number of bedrooms, bathrooms, floors, and additional structural elements like garage presence and yard size. The analysis revealed that square footage and bathrooms exhibit the strongest positive correlations with house prices (both with correlation values of 0.76, statistically significant at p &lt; 0.05), indicating their substantial impact on property valuation. In contrast, factors like condition and view demonstrated weaker correlations, suggesting a more limited influence. The Linear Regression model explained 75% of the variation in house prices (R2 = 0.75), with validation conducted using a holdout test set to ensure generalizability. While the model effectively highlights key price determinants, its limitations in handling non-linear relationships and sensitivity to outliers were addressed through data transformation and outlier removal. Compared to prior studies, this research reinforces established findings on square footage and bathrooms while providing new insights into the comparatively lower impact of property condition. Future work could explore advanced predictive models, such as non-linear regression and machine learning techniques, to better capture complex relationships and improve forecasting accuracy. These findings offer valuable insights for buyers, sellers, and industry professionals, emphasizing the importance of a data-driven approach to understanding house price dynamics.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">House Price Prediction</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Linear Regression</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">multivariate analysis</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Property Features</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Market Valuation</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://jad.shahroodut.ac.ir/article_3389_ed9a79d57420c14278b0f64e4cf7a9f5.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>Shahrood University of Technology</PublisherName>
				<JournalTitle>Journal of AI and Data Mining</JournalTitle>
				<Issn>2322-5211</Issn>
				<Volume>13</Volume>
				<Issue>1</Issue>
				<PubDate PubStatus="epublish">
					<Year>2025</Year>
					<Month>01</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Analyzing the Performance of the Red Deer Optimization Algorithm in Comparison to Other Metaheuristic Algorithms</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>53</FirstPage>
			<LastPage>61</LastPage>
			<ELocationID EIdType="pii">3390</ELocationID>
			
<ELocationID EIdType="doi">10.22044/jadm.2025.14868.2586</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Soheil</FirstName>
					<LastName>Rezashoar</LastName>
<Affiliation>Department of Transportation Planning, Faculty of Engineering, Imam Khomeini International University, Qazvin, Iran.</Affiliation>

</Author>
<Author>
					<FirstName>Amir Abbas</FirstName>
					<LastName>Rassafi</LastName>
<Affiliation>Department of Transportation Planning, Faculty of Engineering, Imam Khomeini International University, Qazvin, Iran.</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2024</Year>
					<Month>08</Month>
					<Day>01</Day>
				</PubDate>
			</History>
		<Abstract>This study performs a thorough comparative analysis of the Red Deer Optimization Algorithm (RDOA) in comparison to five well-established metaheuristic algorithms: Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Differential Evolution (DE), Artificial Bee Colony (ABC), and Whale Optimization Algorithm (WOA). The main objective is to evaluate the performance of RDOA on a range of benchmark problems, including essential unimodal and sophisticated multimodal functions. The methodology incorporates hyperparameters optimization for each algorithm to optimize performance and assesses them on six standard benchmark problems (Sphere, Rosenbrock, Bohachevsky, Griewank, Rastrigin, and Eggholder). Convergence plots are examined to demonstrate the rate at which convergence occurs and the level of stability achieved. The results demonstrate that RDOA performs well compared to other algorithms in all benchmarks and excels in dealing with multimodal functions. However, the selection of an algorithm should be based on the specific characteristics of the problem, taking into account their distinct advantages.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Optimization</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Metaheuristic</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Nature Inspired</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Red Deer Optimization Algorithm</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">RDOA</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://jad.shahroodut.ac.ir/article_3390_c1844e9f27bae20eeaade290313f9fdb.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>Shahrood University of Technology</PublisherName>
				<JournalTitle>Journal of AI and Data Mining</JournalTitle>
				<Issn>2322-5211</Issn>
				<Volume>13</Volume>
				<Issue>1</Issue>
				<PubDate PubStatus="epublish">
					<Year>2025</Year>
					<Month>01</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Applying Intuitionistic Fuzzy Sets to Improve Fuzzy Content-based Image Retrieval Systems</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>63</FirstPage>
			<LastPage>73</LastPage>
			<ELocationID EIdType="pii">3365</ELocationID>
			
<ELocationID EIdType="doi">10.22044/jadm.2025.14597.2568</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Monireh</FirstName>
					<LastName>Azimi Hemat</LastName>
<Affiliation>Department of Computer science, Faculty of Mathematics and Computer, Shahid Bahonar University of Kerman, Kerman, Iran.</Affiliation>

</Author>
<Author>
					<FirstName>Ezat</FirstName>
					<LastName>Valipour</LastName>
<Affiliation>Department of Applied Mathematics, Faculty of Mathematics and Computer, Shahid Bahonar University of Kerman, Kerman, Iran.</Affiliation>

</Author>
<Author>
					<FirstName>Laya</FirstName>
					<LastName>Ali Ahmadipoor</LastName>
<Affiliation>Department of Computer science, Faculty of Mathematics and Computer, Shahid Bahonar University of Kerman, Kerman, Iran.</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2024</Year>
					<Month>07</Month>
					<Day>29</Day>
				</PubDate>
			</History>
		<Abstract>Visual features extracted from images in content-based image retrieval systems are inherently ambiguous. Consequently, applying fuzzy sets for image indexing in image retrieval systems has improved eﬃciency. In this article, the intuitionistic fuzzy sets are used to enhance the performance of the Fuzzy Content-Based Image Retrieval (F-CBIR) system. To this aim, an Intuitionistic Fuzzy Content-Based Image Retrieval (IF-CBIR) is proposed by applying intuitionistic fuzzy generators on fuzzy sets. Due to the diversity of the intuitionistic fuzzy distance measure, several are assessed in IF-CBIR; in these assessments, the measure with higher performance is identiﬁed. Finally, the proposed IF-CBIR and the existing crisp CBIR and F-CBIR simulate on Corel 5K and Corel 10K databases. The results show that our proposed method has higher (10-15%) precision compared to the mentioned methods.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Image Retrieval</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Feature extraction</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Fuzzy image retrieval</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Intuitionistic fuzzy image retrieval</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">HSV color space</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://jad.shahroodut.ac.ir/article_3365_9f103e3110d02ffb0b850ca36702cd21.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>Shahrood University of Technology</PublisherName>
				<JournalTitle>Journal of AI and Data Mining</JournalTitle>
				<Issn>2322-5211</Issn>
				<Volume>13</Volume>
				<Issue>1</Issue>
				<PubDate PubStatus="epublish">
					<Year>2025</Year>
					<Month>01</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Hybrid Image Inpainting: Combining Low-rank Minimization and Spline-based Approach</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>75</FirstPage>
			<LastPage>84</LastPage>
			<ELocationID EIdType="pii">3394</ELocationID>
			
<ELocationID EIdType="doi">10.22044/jadm.2025.14744.2576</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Kimia</FirstName>
					<LastName>Peyvandi</LastName>
<Affiliation>Faculty of Computer Science, Semnan University, Semnan, Iran.</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2024</Year>
					<Month>07</Month>
					<Day>07</Day>
				</PubDate>
			</History>
		<Abstract>Image inpainting is one of the important topics in the field of image processing, and various methods have been proposed in this area. However, this problem still faces multiple challenges, as an inpainting algorithm may perform well for a specific class of images but may have poor performance for other images. In this paper, we attempt to decompose the image into a low-rank component and a sparse component using (Principal Component Analysis) PCA, and then independently restore each component. For inpainting the low-rank component, we use an algorithm based on low-rank minimization, and for restoring the sparse component, we use the concept of splines. Using splines, we can effectively restore edges and lines, whereas the restoration of these regions is challenging in most algorithms. Also, in restoring the low-rank component, we construct a tensor at each step and approximate the missing pixels in the tensor, thereby significantly improving the efficiency of the low-rank minimization idea in image inpainting. Finally, we have applied our proposed method to restore various types of images, which demonstrates the effectiveness of our proposed method compared to other inpainting methods based on PSNR and SSIM.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Target region</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Spline</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Low-rank minimization</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Tensor</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://jad.shahroodut.ac.ir/article_3394_7ccd83f8496e1e55a9429daf38332ca0.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>Shahrood University of Technology</PublisherName>
				<JournalTitle>Journal of AI and Data Mining</JournalTitle>
				<Issn>2322-5211</Issn>
				<Volume>13</Volume>
				<Issue>1</Issue>
				<PubDate PubStatus="epublish">
					<Year>2025</Year>
					<Month>01</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>DOSTE: Document Similarity Matching considering Informative Name Entities</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>85</FirstPage>
			<LastPage>94</LastPage>
			<ELocationID EIdType="pii">3391</ELocationID>
			
<ELocationID EIdType="doi">10.22044/jadm.2025.15383.2641</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Milad</FirstName>
					<LastName>Allhgholi</LastName>
<Affiliation>School of Computer engineering, Iran University of Science and Technology, Tehran, Iran.</Affiliation>

</Author>
<Author>
					<FirstName>Hossein</FirstName>
					<LastName>Rahmani</LastName>
<Affiliation>School of Computer engineering, Iran University of Science and Technology, Tehran, Iran.</Affiliation>

</Author>
<Author>
					<FirstName>Amirhossein</FirstName>
					<LastName>Derakhshan</LastName>
<Affiliation>School of Computer engineering, Iran University of Science and Technology, Tehran, Iran.</Affiliation>

</Author>
<Author>
					<FirstName>Saman</FirstName>
					<LastName>Mohammadi Raouf</LastName>
<Affiliation>School of Computer engineering, Iran University of Science and Technology, Tehran, Iran.</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2024</Year>
					<Month>12</Month>
					<Day>14</Day>
				</PubDate>
			</History>
		<Abstract>Document similarity matching is essential for efficient text retrieval, plagiarism detection, and content analysis. Existing studies in this field can be categorized into three approaches: statistical analysis, deep learning, and hybrid approaches. However, to the best of our knowledge, none have incorporated the importance of named entities into their methodologies. In this paper, we propose DOSTE, a method that first extracts name entities and then utilizes them to enhance document similarity matching through statistical and graph-based analysis. Empirical results indicate that DOSTE achieves better results by emphasizing named entities, resulting in an average improvement of 9% in the average recall metric compared to baseline methods. Also, DOSTE unlike LLM-based approaches, does not require extensive GPU resources. Additionally, non-empirical interpretations of the results indicate that DOSTE is particularly effective in identifying similarity in short documents and complex document comparisons.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Document similarity</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Name entities</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Entities graph</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://jad.shahroodut.ac.ir/article_3391_8c45090f97a2eea5635ec2bec2d44866.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>Shahrood University of Technology</PublisherName>
				<JournalTitle>Journal of AI and Data Mining</JournalTitle>
				<Issn>2322-5211</Issn>
				<Volume>13</Volume>
				<Issue>1</Issue>
				<PubDate PubStatus="epublish">
					<Year>2025</Year>
					<Month>01</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>A Persian Continuous Sign Language Dataset</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>95</FirstPage>
			<LastPage>105</LastPage>
			<ELocationID EIdType="pii">3366</ELocationID>
			
<ELocationID EIdType="doi">10.22044/jadm.2025.14973.2600</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Razieh</FirstName>
					<LastName>Rastgoo</LastName>
<Affiliation>Electrical and Computer Engineering Faculty, Semnan University, Semnan, Iran.</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2024</Year>
					<Month>09</Month>
					<Day>05</Day>
				</PubDate>
			</History>
		<Abstract>Sign language (SL) is the primary mode of communication within the Deaf community. Recent advances in deep learning have led to the development of various applications and technologies aimed at facilitating bidirectional communication between the Deaf and hearing communities. However, challenges remain in the availability of suitable datasets for deep learning-based models. Only a few public large-scale annotated datasets are available for sign sentences, and none exist for Persian Sign Language sentences. To address this gap, we have collected a large-scale dataset comprising 10,000 sign sentence videos corresponding to 100 Persian sign sentences. This dataset includes comprehensive annotations such as the bounding box of the detected hand, class labels, hand pose parameters, and heatmaps. A notable feature of the proposed dataset is that it contains isolated signs corresponding to the sign sentences within the dataset. To analyze the complexity of the proposed dataset, we present extensive experiments and discuss the results. More concretely, the results of the models in key sub-domains relevant to Sign Language Recognition (SLR), including hand detection, pose estimation, real-time tracking, and gesture recognition, have been included and analyzed. Moreover, the results of seven deep learning-based models on the proposed datasets have been discussed. Finally, the results of Sign Language Production (SLP) using deep generative models have been presented. We report the experimental results of these models from these sub-areas, showcasing their performance on the proposed dataset.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Sign Language Recognition (SLR)</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Sign Language Production (SLP)</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Dataset</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Generative Adversarial Network (GAN)</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Persian</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://jad.shahroodut.ac.ir/article_3366_7e771f87dab71d0bb1fae42f0e89f2b6.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>Shahrood University of Technology</PublisherName>
				<JournalTitle>Journal of AI and Data Mining</JournalTitle>
				<Issn>2322-5211</Issn>
				<Volume>13</Volume>
				<Issue>1</Issue>
				<PubDate PubStatus="epublish">
					<Year>2025</Year>
					<Month>01</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Multilingual Language Models in Persian NLP Tasks: A Performance ‎Comparison of Fine-Tuning Techniques</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>107</FirstPage>
			<LastPage>117</LastPage>
			<ELocationID EIdType="pii">3392</ELocationID>
			
<ELocationID EIdType="doi">10.22044/jadm.2025.15167.2625</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Ali Reza</FirstName>
					<LastName>Ghasemi</LastName>
<Affiliation>Artificial Intelligence Group, Faculty of Electrical and Computer Engineering, University of Kashan, Kashan, Iran.</Affiliation>

</Author>
<Author>
					<FirstName>Javad</FirstName>
					<LastName>Salimi Sartakhti</LastName>
<Affiliation>Artificial Intelligence Group, Faculty of Electrical and Computer Engineering, University of Kashan, Kashan, Iran.</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2024</Year>
					<Month>12</Month>
					<Day>09</Day>
				</PubDate>
			</History>
		<Abstract>This paper evaluates the performance of various fine-tuning methods in Persian natural language ‎processing (NLP) tasks. In low-resource languages like Persian, ‎which suffer from a lack of rich and sufficient data for training large ‎models, it is crucial to select appropriate fine-tuning techniques that ‎mitigate overfitting and prevent the model from learning weak or ‎surface-level patterns. The main goal of this research is to compare ‎the effectiveness of fine-tuning approaches such as Full-Finetune, ‎LoRA, AdaLoRA, and DoRA on model learning and task ‎performance. We apply these techniques to three different Persian ‎NLP tasks: sentiment analysis, named entity recognition (NER), and ‎span question answering (QA). For this purpose, we conduct ‎experiments on three Transformer-based multilingual models with ‎different architectures and parameter scales: BERT-base multilingual ‎‎(~168M parameters) with Encoder only structure, mT5-small ‎‎(~300M parameters) with Encoder-Decoder structure, and mGPT ‎‎(~1.4B parameters) with Decoder only structure. Each of these ‎models supports the Persian language but varies in structure and ‎computational requirements, influencing the effectiveness of ‎different fine-tuning approaches. Results indicate that fully fine-‎tuned BERT-base multilingual consistently outperforms other ‎models across all tasks in basic metrics, particularly given the unique ‎challenges of these embedding-based tasks. Additionally, lightweight ‎fine-tuning methods like LoRA and DoRA offer very competitive ‎performance while significantly reducing computational overhead ‎and outperform other models in Performance-Efficiency Score ‎introduced in the paper. This study contributes to a better ‎understanding of fine-tuning methods, especially for Persian NLP, ‎and offers practical guidance for applying Large Language Models ‎‎(LLMs) to downstream tasks in low-resource languages.‎</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Fine-Tuning Techniques</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎PEFT</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Low-Resource ‎Languages</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Multilingual ‎Language Models</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">BERT.‎</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://jad.shahroodut.ac.ir/article_3392_b93d594c21a9220c5492d11a77391e56.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
