<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	xmlns:media="http://search.yahoo.com/mrss/" >

<channel>
	<title>Volume-3 Issue-1, May 2023 &#8211; Indian Journal of Data Mining (IJDM)</title>
	<atom:link href="https://www.ijdm.latticescipub.com/portfolio_entries/volume-3-issue-1-may-2023/feed/" rel="self" type="application/rss+xml" />
	<link>https://www.ijdm.latticescipub.com</link>
	<description>Exploring Innovation &#124; ISSN: 2582-9246 (Online) &#124; A Periodical Journal &#124; Reg. No: C/1383209 &#124; Published by Lattice Science Publication (LSP)</description>
	<lastBuildDate>Fri, 29 Dec 2023 09:52:00 +0000</lastBuildDate>
	<language>en-US</language>
	<sy:updatePeriod>
	hourly	</sy:updatePeriod>
	<sy:updateFrequency>
	1	</sy:updateFrequency>
	<generator>https://wordpress.org/?v=6.9.4</generator>

<image>
	<url>https://www.ijdm.latticescipub.com/wp-content/uploads/2021/03/cropped-IJDM-WFS-32x32.png</url>
	<title>Volume-3 Issue-1, May 2023 &#8211; Indian Journal of Data Mining (IJDM)</title>
	<link>https://www.ijdm.latticescipub.com</link>
	<width>32</width>
	<height>32</height>
</image> 
	<item>
		<title>B1630113223</title>
		<link>https://www.ijdm.latticescipub.com/portfolio-item/b1630113223/</link>
		
		<dc:creator><![CDATA[IJDM Journal]]></dc:creator>
		<pubDate>Wed, 20 Dec 2023 10:17:02 +0000</pubDate>
				<guid isPermaLink="false">https://www.ijdm.latticescipub.com/?post_type=portfolio&#038;p=1005</guid>

					<description><![CDATA[<p>The Indian Journal of Data Mining (IJDM) has ISSN 2582-9246 (online), an open-access, peer-reviewed, periodical half-yearly international journal, which is published by Lattice Science Publication (LSP) in May and November. The journal aims to publish high-quality peer–reviewed original articles in the area of Data Mining that covers Data Mining, Data Science, Big Data, Data Warehouse, Visualization, Security, Privacy, Big DaaS, Scalable Computing, Cloud Computing, Knowledge Discovery, Integration, Transformation, Information Retrieval, Social Data and Semantics, Mining Functions, Data Regression, Data Classification, Anomaly Detection, Data Clustering, Data Association, Data Cleaning, Feature Selection and Extraction, Data Mining Algorithms, Apriori Decision Tree, Generalized Linear Models, k-Means, Minimum Description Length, Naive Bayes Non-Negative Matrix Factorization, 0-Cluster, Support Vector Machines, Data Preparation, Mining Unstructured Data, Artificial Intelligence, Future Directions and Challenges in Data Mining and Industrial Challenges in Data Mining. #Data Mining #Data Science #Big Data #Data Warehouse #Visualization #Security #Privacy #Big DaaS #Scalable Computing #Cloud Computing #Knowledge Discovery #Integration #Transformation #Information Retrieval #Social Data and Semantics #Mining Functions #Data Regression #Data Classification #Anomaly Detection #Data Clustering #Data Association #Data Regression #Data Cleaning #Feature Selection and Extraction #Data Mining Algorithms #Apriori #Decision Tree #Generalized Linear Models #k-Means #Minimum Description Length #Naive Bayes #Non-Negative Matrix Factorization #0-Cluster #Support Vector Machines #Data Preparation #Mining Unstructured Data #Artificial Intelligence #Future Directions and Challenges in Data Mining #Industrial Challenges in Data Mining #PhD ademic #Scopus #SCI #LatticeScience #Springer, #ScienceDirect #IEEE #Mendeley #Research #Scholarship #UGC #SSRN #LatticeScience #ESCI #Science #Journal #Conference #SSRN #PubLons #PhD #Academic #Scopus #SCI #LatticeScience #Springer, #ScienceDirect #IEEE #Mendeley #Research #Scholarship #UGC #SSRN #LatticeScience #ESCI #Science #Journal #Conference #SSRN #PubLons</p>
<p>The post <a rel="nofollow" href="https://www.ijdm.latticescipub.com/portfolio-item/b1630113223/">B1630113223</a> appeared first on <a rel="nofollow" href="https://www.ijdm.latticescipub.com">Indian Journal of Data Mining (IJDM)</a>.</p>
]]></description>
										<content:encoded><![CDATA[<p>The Indian Journal of Data Mining (IJDM) has ISSN 2582-9246 (online), an open-access, peer-reviewed, periodical half-yearly international journal, which is published by Lattice Science Publication (LSP) in May and November. The journal aims to publish high-quality peer–reviewed original articles in the area of Data Mining that covers Data Mining, Data Science, Big Data, Data Warehouse, Visualization, Security, Privacy, Big DaaS, Scalable Computing, Cloud Computing, Knowledge Discovery, Integration, Transformation, Information Retrieval, Social Data and Semantics, Mining Functions, Data Regression, Data Classification, Anomaly Detection, Data Clustering, Data Association, Data Cleaning, Feature Selection and Extraction, Data Mining Algorithms, Apriori Decision Tree, Generalized Linear Models, k-Means, Minimum Description Length, Naive Bayes Non-Negative Matrix Factorization, 0-Cluster, Support Vector Machines, Data Preparation, Mining Unstructured Data, Artificial Intelligence, Future Directions and Challenges in Data Mining and Industrial Challenges in Data Mining. #Data Mining #Data Science #Big Data #Data Warehouse #Visualization #Security #Privacy #Big DaaS #Scalable Computing #Cloud Computing #Knowledge Discovery #Integration #Transformation #Information Retrieval #Social Data and Semantics #Mining Functions #Data Regression #Data Classification #Anomaly Detection #Data Clustering #Data Association #Data Regression #Data Cleaning #Feature Selection and Extraction #Data Mining Algorithms #Apriori #Decision Tree #Generalized Linear Models #k-Means #Minimum Description Length #Naive Bayes #Non-Negative Matrix Factorization #0-Cluster #Support Vector Machines #Data Preparation #Mining Unstructured Data #Artificial Intelligence #Future Directions and Challenges in Data Mining #Industrial Challenges in Data Mining #PhD ademic #Scopus #SCI #LatticeScience #Springer, #ScienceDirect #IEEE #Mendeley #Research #Scholarship #UGC #SSRN #LatticeScience #ESCI #Science #Journal #Conference #SSRN #PubLons #PhD #Academic #Scopus #SCI #LatticeScience #Springer, #ScienceDirect #IEEE #Mendeley #Research #Scholarship #UGC #SSRN #LatticeScience #ESCI #Science #Journal #Conference #SSRN #PubLons</p>
<p><script type='application/json' class='__iawmlf-post-loop-links'>[{"id":68,"href":"https:\/\/crossmark.crossref.org\/dialog\/?doi=10.54105\/ijdm.B1630.053123&domain=https:\/\/www.ijdm.latticescipub.com","archived_href":"","redirect_href":"","checks":[],"broken":false,"last_checked":null,"process":"done"},{"id":69,"href":"http:\/\/www.doi.org\/10.54105\/ijdm.B1630.053123","archived_href":"","redirect_href":"https:\/\/www.doi.org\/10.54105\/ijdm.B1630.053123","checks":[],"broken":false,"last_checked":null,"process":"done"},{"id":38,"href":"https:\/\/www.openaccess.nl\/en\/open-publications","archived_href":"http:\/\/web-wp.archive.org\/web\/20241228104058\/https:\/\/www.openaccess.nl\/en\/open-publications","redirect_href":"","checks":[{"date":"2025-12-15 07:42:09","http_code":404},{"date":"2025-12-24 01:36:22","http_code":404},{"date":"2025-12-27 02:44:38","http_code":404},{"date":"2025-12-30 15:14:56","http_code":404},{"date":"2026-01-05 18:12:37","http_code":404},{"date":"2026-01-15 11:06:59","http_code":404},{"date":"2026-02-04 08:22:15","http_code":404},{"date":"2026-02-14 08:10:05","http_code":404},{"date":"2026-02-19 05:54:05","http_code":404},{"date":"2026-02-23 07:08:31","http_code":503},{"date":"2026-02-28 23:19:13","http_code":404},{"date":"2026-03-04 06:47:05","http_code":404},{"date":"2026-05-01 09:55:59","http_code":404},{"date":"2026-05-04 15:59:09","http_code":404},{"date":"2026-05-07 20:17:04","http_code":404}],"broken":true,"last_checked":{"date":"2026-05-07 20:17:04","http_code":404},"process":"done"},{"id":32,"href":"https:\/\/citation.crosscite.org","archived_href":"http:\/\/web-wp.archive.org\/web\/20250115122456\/https:\/\/citation.crosscite.org:443\/","redirect_href":"","checks":[{"date":"2025-12-15 07:41:44","http_code":200},{"date":"2025-12-24 01:36:19","http_code":200},{"date":"2025-12-27 02:44:39","http_code":200},{"date":"2025-12-30 15:14:56","http_code":200},{"date":"2026-01-05 18:12:38","http_code":200},{"date":"2026-01-15 11:06:59","http_code":200},{"date":"2026-02-04 08:22:16","http_code":200},{"date":"2026-02-19 05:54:07","http_code":200},{"date":"2026-02-23 07:08:42","http_code":200},{"date":"2026-02-28 23:19:14","http_code":200},{"date":"2026-03-04 06:47:04","http_code":200},{"date":"2026-05-01 09:55:59","http_code":200},{"date":"2026-05-04 15:59:09","http_code":200},{"date":"2026-05-07 20:17:03","http_code":200}],"broken":false,"last_checked":{"date":"2026-05-07 20:17:03","http_code":200},"process":"done"},{"id":70,"href":"https:\/\/zenodo.org\/records\/10441432","archived_href":"http:\/\/web-wp.archive.org\/web\/20250430223005\/https:\/\/zenodo.org\/records\/10441432","redirect_href":"","checks":[{"date":"2025-12-15 07:52:56","http_code":200},{"date":"2025-12-30 15:14:57","http_code":200},{"date":"2026-02-21 03:55:10","http_code":200},{"date":"2026-05-04 04:36:31","http_code":200}],"broken":false,"last_checked":{"date":"2026-05-04 04:36:31","http_code":200},"process":"done"},{"id":35,"href":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0","archived_href":"http:\/\/web-wp.archive.org\/web\/20251214135420\/https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/","redirect_href":"","checks":[{"date":"2025-12-15 07:41:55","http_code":206},{"date":"2025-12-18 10:23:22","http_code":206},{"date":"2025-12-21 16:20:58","http_code":206},{"date":"2025-12-25 04:25:35","http_code":206},{"date":"2025-12-28 10:27:20","http_code":206},{"date":"2025-12-31 10:31:38","http_code":206},{"date":"2026-01-03 16:18:58","http_code":206},{"date":"2026-01-06 22:52:52","http_code":206},{"date":"2026-01-10 04:22:26","http_code":206},{"date":"2026-01-13 04:30:10","http_code":206},{"date":"2026-01-16 04:44:46","http_code":206},{"date":"2026-01-19 10:55:45","http_code":206},{"date":"2026-01-22 11:38:42","http_code":206},{"date":"2026-01-26 01:39:21","http_code":206},{"date":"2026-01-29 04:02:21","http_code":206},{"date":"2026-02-01 04:22:36","http_code":206},{"date":"2026-02-04 04:23:13","http_code":206},{"date":"2026-02-07 09:27:05","http_code":206},{"date":"2026-02-10 13:06:21","http_code":206},{"date":"2026-02-13 14:07:27","http_code":206},{"date":"2026-02-16 16:14:18","http_code":206},{"date":"2026-02-19 16:16:30","http_code":206},{"date":"2026-02-22 22:21:48","http_code":206},{"date":"2026-02-26 04:20:53","http_code":206},{"date":"2026-03-01 09:04:08","http_code":206},{"date":"2026-03-04 09:36:43","http_code":206},{"date":"2026-05-01 04:45:09","http_code":206},{"date":"2026-05-04 10:21:45","http_code":206},{"date":"2026-05-07 16:15:30","http_code":206}],"broken":false,"last_checked":{"date":"2026-05-07 16:15:30","http_code":206},"process":"done"}]</script><div  class='flex_column av-2xelpp-175cf38f324753b01c197825e8dce24d av_one_full  avia-builder-el-0  avia-builder-el-no-sibling  first flex_column_div  '     ><div  class='av_promobox av-lqdmdaa7-ab56eba3c38fa85fc8c4c66c5fade8db avia-button-yes  avia-builder-el-1  avia-builder-el-no-sibling '><div class='avia-promocontent'></p>
<p style="text-align: justify;"><span style="font-family: 'times new roman', times, serif;"><span style="font-size: 14pt;"><strong><span style="font-size: 18pt;">Myers-Briggs Personality Prediction<a href="https://crossmark.crossref.org/dialog/?doi=10.54105/ijdm.B1630.053123&amp;domain=https://www.ijdm.latticescipub.com"><img decoding="async" id="crossmark-icon" class="alignnone" src="https://crossmark-cdn.crossref.org/widget/v2.0/logos/CROSSMARK_Color_horizontal.svg" alt="CROSSMARK Color horizontal" width="150" height="33"></a></span><br />
</strong>Rohith Muralidharan<span style="font-size: 12pt;"><sup><strong>1</strong></sup></span>, Neenu Kuriakose<span style="font-size: 12pt;"><sup><strong>2</strong></sup></span>, Sangeetha J<span style="font-size: 12pt;"><sup><strong>3</strong></sup></span></span></span></p>
<p style="text-align: justify;"><span style="font-size: 12pt;"><span style="font-family: 'times new roman', times, serif;">
<style type="text/css" data-created_by="avia_inline_auto" id="style-css-av-a9b4g-b4f12ce60498e06e77e78fa4e9e11d0b">
.av_font_icon.av-a9b4g-b4f12ce60498e06e77e78fa4e9e11d0b{
color:#4392e8;
border-color:#4392e8;
}
.avia-svg-icon.av-a9b4g-b4f12ce60498e06e77e78fa4e9e11d0b svg:first-child{
stroke:#4392e8;
fill:#4392e8;
}
.av_font_icon.av-a9b4g-b4f12ce60498e06e77e78fa4e9e11d0b .av-icon-char{
font-size:20px;
line-height:20px;
}
</style>
<span  class='av_font_icon av-a9b4g-b4f12ce60498e06e77e78fa4e9e11d0b avia_animate_when_visible av-icon-style- avia-icon-pos-left avia-iconfont avia-font-entypo-fontello avia-icon-animate'><span class='av-icon-char' data-av_icon='' data-av_iconfont='entypo-fontello' aria-hidden="true" data-avia-icon-tooltip="rohith519@gmail.com"></span></span><sup><strong>1</strong></sup>Rohith Muralidharan, Department of Computer Science, St. Albert’s College (Autonomous), Ernakulam, India.<br />
</span></span></p>
<p style="text-align: justify;"><span style="font-size: 12pt;"><span style="font-family: 'times new roman', times, serif;">
<style type="text/css" data-created_by="avia_inline_auto" id="style-css-av-a9b4g-3-b2c2bf05ba40e648772a513c29facf3d">
.av_font_icon.av-a9b4g-3-b2c2bf05ba40e648772a513c29facf3d{
color:#4392e8;
border-color:#4392e8;
}
.avia-svg-icon.av-a9b4g-3-b2c2bf05ba40e648772a513c29facf3d svg:first-child{
stroke:#4392e8;
fill:#4392e8;
}
.av_font_icon.av-a9b4g-3-b2c2bf05ba40e648772a513c29facf3d .av-icon-char{
font-size:20px;
line-height:20px;
}
</style>
<span  class='av_font_icon av-a9b4g-3-b2c2bf05ba40e648772a513c29facf3d avia_animate_when_visible av-icon-style- avia-icon-pos-left avia-iconfont avia-font-entypo-fontello avia-icon-animate'><span class='av-icon-char' data-av_icon='' data-av_iconfont='entypo-fontello' aria-hidden="true" data-avia-icon-tooltip="neenuannaa@gmail.com"></span></span><sup><strong>2</strong></sup>Neenu Kuriakose, Department of Computer Science, St. Albert’s College (Autonomous), Ernakulam, India.<br />
</span></span></p>
<p style="text-align: justify;"><span style="font-size: 12pt;"><span style="font-family: 'times new roman', times, serif;">
<style type="text/css" data-created_by="avia_inline_auto" id="style-css-av-a9b4g-2-0642ba04aa471226b9ed2879395035a0">
.av_font_icon.av-a9b4g-2-0642ba04aa471226b9ed2879395035a0{
color:#4392e8;
border-color:#4392e8;
}
.avia-svg-icon.av-a9b4g-2-0642ba04aa471226b9ed2879395035a0 svg:first-child{
stroke:#4392e8;
fill:#4392e8;
}
.av_font_icon.av-a9b4g-2-0642ba04aa471226b9ed2879395035a0 .av-icon-char{
font-size:20px;
line-height:20px;
}
</style>
<span  class='av_font_icon av-a9b4g-2-0642ba04aa471226b9ed2879395035a0 avia_animate_when_visible av-icon-style- avia-icon-pos-left avia-iconfont avia-font-entypo-fontello avia-icon-animate'><span class='av-icon-char' data-av_icon='' data-av_iconfont='entypo-fontello' aria-hidden="true" data-avia-icon-tooltip="sangiprathap@gmail.com"></span></span><sup><strong>3</strong></sup>Sangeetha J, Department of Computer Science, St. Albert’s College (Autonomous), Ernakulam, India. </span></span></p>
<p style="text-align: justify;"><span style="font-size: 12pt;"><span style="font-family: 'times new roman', times, serif;">Manuscript received on 28 April 2023 <strong>|</strong> Revised Manuscript received on 08May 2023<strong> |</strong> Manuscript Accepted on 15 May 2023 <strong>|</strong> Manuscript published on 30 December 2023 </span><strong style="font-family: 'times new roman', times, serif;">|</strong><span style="font-family: 'times new roman', times, serif;"> PP: 11-19 </span><strong style="font-family: 'times new roman', times, serif;">|</strong><span style="font-family: 'times new roman', times, serif;"> Volume-3 Issue-1 May 2023 </span><strong style="font-family: 'times new roman', times, serif;">|</strong><span style="font-family: 'times new roman', times, serif;"> Retrieval Number: 100.1/ijdm.B1630113223 </span><strong style="font-family: 'times new roman', times, serif;">| </strong><span style="font-family: 'times new roman', times, serif;">DOI: </span><a style="font-family: &#039;times new roman&#039;, times, serif;" href="http://www.doi.org/10.54105/ijdm.B1630.053123" rel="noopener" target="_blank">10.54105/ijdm.B1630.053123</a></span></p>
<p style="text-align: justify;"><span style="font-family: 'times new roman', times, serif;"><span style="font-size: 12pt;"> <i class="fa fa-unlock-alt" style="color: blue;"></i><a href="https://www.openaccess.nl/en/open-publications" target="_blank" rel="noopener"> Open Access</a><strong> |</strong> <i class="far fa-file-alt" style="color: blue;"></i><a href="https://www.ijdm.latticescipub.com/ethics-policies/"> Editorial and Publishing Policies</a> | <i class="fa fa-quote-right" style="color: blue;"></i> <a href="https://citation.crosscite.org/" target="_blank" rel="noopener">Cite</a> <strong>|</strong> <i class="fa fa-plus" style="color: blue;" aria-hidden="true"></i><a href="https://zenodo.org/records/10441432" target="_blank" rel="noopener"> Zenodo</a> <strong>|</strong> <i class="fa fa-database" style="color: blue;" aria-hidden="true"></i><a href="https://www.ijdm.latticescipub.com/indexing/"> Indexing and Abstracting</a></span><span style="font-size: 10pt;"><span style="font-size: 12pt;"><br />
<span style="font-size: 10pt;"> © The Authors. Published by Lattice Science Publication (LSP). This is an <a href="https://www.openaccess.nl/en/open-publications" target="_blank" rel="noopener">open-access</a> article under the CC-BY-NC-ND license <a href="https://creativecommons.org/licenses/by-nc-nd/4.0/" target="_blank" rel="noopener">(http://creativecommons.org/licenses/by-nc-nd/4.0/)</a></span></span></span></span></p>
<p style="text-align: justify;"><span style="font-family: 'times new roman', times, serif; font-size: 14pt;"><strong>Abstract:</strong> The Myers-Briggs Type Indicator (MBTI) is one of the most commonly used tool for assessing an individual&#8217;s personality. This tool allows us to identify the psychological proclivity in the way they take decisions and perceive the world. MBTI has it’s applications spread across several fields which include career development and personal growth. This test consists of a set of questions which are specifically designed to evaluate and measure an individual&#8217;s choices based on four dichotomies &#8211; Extraversion (E) vs. Introversion (I), Sensing (S) vs. Intuition (N), Thinking (T) vs. Feeling (F), and Judging (J) vs. Perceiving (P). Myers-Briggs Personality Prediction project aims to develop and deploy a system using machine learning which is capable of predicting one&#8217;s MBTI personality type based on their online written interactions such as social media posts, comments, blogs etc. This project has significant implications for various applications, including improving customer experience, optimizing team dynamics, and developing personalized coaching programs. Through this project, we hope to gain a deeper understanding of how language use and personality type are related and to develop a robust tool for personality prediction.<br />
</span></p>
<p style="text-align: justify;"><span style="font-family: 'times new roman', times, serif; font-size: 12pt;"><span style="font-size: 14pt;"><strong>Keywords:</strong> <span style="font-family: 'times new roman', times, serif; font-size: 14pt;">Python, Machine Learning, XG Boost, Supervised learning.</span></span><br />
<span style="font-size: 14pt;"> <strong>Article of the Scope:</strong> <span style="font-family: 'times new roman', times, serif; font-size: 14pt;">Machine Learning</span></span><br />
</span></p>
<p>
</div><div  class='avia-button-wrap av-lqdmdaa7-ef5fea744f78aa9d0d34fc5d7313d6f8-wrap avia-button-right '><a href="https://www.ijdm.latticescipub.com/wp-content/uploads/papers/v3i1/B1630113223.pdf" class="avia-button av-lqdmdaa7-ef5fea744f78aa9d0d34fc5d7313d6f8 av-link-btn avia-icon_select-yes-left-icon avia-size-medium avia-position-right avia-color-theme-color" aria-label="Download PDF"><span class='avia_button_icon avia_button_icon_left avia-iconfont avia-font-entypo-fontello' data-av_icon='' data-av_iconfont='entypo-fontello' ></span><span class='avia_iconbox_title' >Download PDF</span></a></div></div></div></p>
<p>The post <a rel="nofollow" href="https://www.ijdm.latticescipub.com/portfolio-item/b1630113223/">B1630113223</a> appeared first on <a rel="nofollow" href="https://www.ijdm.latticescipub.com">Indian Journal of Data Mining (IJDM)</a>.</p>
]]></content:encoded>
					
		
		
			</item>
		<item>
		<title>A1625053123</title>
		<link>https://www.ijdm.latticescipub.com/portfolio-item/a1625053123/</link>
		
		<dc:creator><![CDATA[IJDM Journal]]></dc:creator>
		<pubDate>Sat, 21 Jan 2023 11:04:45 +0000</pubDate>
				<guid isPermaLink="false">https://www.ijdm.latticescipub.com/?post_type=portfolio&#038;p=756</guid>

					<description><![CDATA[<p>The Indian Journal of Data Mining (IJDM) has ISSN 2582-9246 (online), an open-access, peer-reviewed, periodical half-yearly international journal, which is published by Lattice Science Publication (LSP) in May and November. The journal aims to publish high-quality peer–reviewed original articles in the area of Data Mining that covers Data Mining, Data Science, Big Data, Data Warehouse, Visualization, Security, Privacy, Big DaaS, Scalable Computing, Cloud Computing, Knowledge Discovery, Integration, Transformation, Information Retrieval, Social Data and Semantics, Mining Functions, Data Regression, Data Classification, Anomaly Detection, Data Clustering, Data Association, Data Cleaning, Feature Selection and Extraction, Data Mining Algorithms, Apriori Decision Tree, Generalized Linear Models, k-Means, Minimum Description Length, Naive Bayes Non-Negative Matrix Factorization, 0-Cluster, Support Vector Machines, Data Preparation, Mining Unstructured Data, Artificial Intelligence, Future Directions and Challenges in Data Mining and Industrial Challenges in Data Mining. #Data Mining #Data Science #Big Data #Data Warehouse #Visualization #Security #Privacy #Big DaaS #Scalable Computing #Cloud Computing #Knowledge Discovery #Integration #Transformation #Information Retrieval #Social Data and Semantics #Mining Functions #Data Regression #Data Classification #Anomaly Detection #Data Clustering #Data Association #Data Regression #Data Cleaning #Feature Selection and Extraction #Data Mining Algorithms #Apriori #Decision Tree #Generalized Linear Models #k-Means #Minimum Description Length #Naive Bayes #Non-Negative Matrix Factorization #0-Cluster #Support Vector Machines #Data Preparation #Mining Unstructured Data #Artificial Intelligence #Future Directions and Challenges in Data Mining #Industrial Challenges in Data Mining #PhD ademic #Scopus #SCI #LatticeScience #Springer, #ScienceDirect #IEEE #Mendeley #Research #Scholarship #UGC #SSRN #LatticeScience #ESCI #Science #Journal #Conference #SSRN #PubLons #PhD #Academic #Scopus #SCI #LatticeScience #Springer, #ScienceDirect #IEEE #Mendeley #Research #Scholarship #UGC #SSRN #LatticeScience #ESCI #Science #Journal #Conference #SSRN #PubLons</p>
<p>The post <a rel="nofollow" href="https://www.ijdm.latticescipub.com/portfolio-item/a1625053123/">A1625053123</a> appeared first on <a rel="nofollow" href="https://www.ijdm.latticescipub.com">Indian Journal of Data Mining (IJDM)</a>.</p>
]]></description>
										<content:encoded><![CDATA[<p>The Indian Journal of Data Mining (IJDM) has ISSN 2582-9246 (online), an open-access, peer-reviewed, periodical half-yearly international journal, which is published by Lattice Science Publication (LSP) in May and November. The journal aims to publish high-quality peer–reviewed original articles in the area of Data Mining that covers Data Mining, Data Science, Big Data, Data Warehouse, Visualization, Security, Privacy, Big DaaS, Scalable Computing, Cloud Computing, Knowledge Discovery, Integration, Transformation, Information Retrieval, Social Data and Semantics, Mining Functions, Data Regression, Data Classification, Anomaly Detection, Data Clustering, Data Association, Data Cleaning, Feature Selection and Extraction, Data Mining Algorithms, Apriori Decision Tree, Generalized Linear Models, k-Means, Minimum Description Length, Naive Bayes Non-Negative Matrix Factorization, 0-Cluster, Support Vector Machines, Data Preparation, Mining Unstructured Data, Artificial Intelligence, Future Directions and Challenges in Data Mining and Industrial Challenges in Data Mining. #Data Mining #Data Science #Big Data #Data Warehouse #Visualization #Security #Privacy #Big DaaS #Scalable Computing #Cloud Computing #Knowledge Discovery #Integration #Transformation #Information Retrieval #Social Data and Semantics #Mining Functions #Data Regression #Data Classification #Anomaly Detection #Data Clustering #Data Association #Data Regression #Data Cleaning #Feature Selection and Extraction #Data Mining Algorithms #Apriori #Decision Tree #Generalized Linear Models #k-Means #Minimum Description Length #Naive Bayes #Non-Negative Matrix Factorization #0-Cluster #Support Vector Machines #Data Preparation #Mining Unstructured Data #Artificial Intelligence #Future Directions and Challenges in Data Mining #Industrial Challenges in Data Mining #PhD ademic #Scopus #SCI #LatticeScience #Springer, #ScienceDirect #IEEE #Mendeley #Research #Scholarship #UGC #SSRN #LatticeScience #ESCI #Science #Journal #Conference #SSRN #PubLons #PhD #Academic #Scopus #SCI #LatticeScience #Springer, #ScienceDirect #IEEE #Mendeley #Research #Scholarship #UGC #SSRN #LatticeScience #ESCI #Science #Journal #Conference #SSRN #PubLons</p>
<p><script type='application/json' class='__iawmlf-post-loop-links'>[{"id":96,"href":"https:\/\/crossmark.crossref.org\/dialog\/?doi=10.54105\/ijdm.A1625.053123&domain=www.ijdm.latticescipub.com","archived_href":"","redirect_href":"","checks":[],"broken":false,"last_checked":null,"process":"done"},{"id":97,"href":"http:\/\/www.doi.org\/10.54105\/ijdm.A1625.053123","archived_href":"","redirect_href":"https:\/\/www.doi.org\/10.54105\/ijdm.A1625.053123","checks":[],"broken":false,"last_checked":null,"process":"done"},{"id":38,"href":"https:\/\/www.openaccess.nl\/en\/open-publications","archived_href":"http:\/\/web-wp.archive.org\/web\/20241228104058\/https:\/\/www.openaccess.nl\/en\/open-publications","redirect_href":"","checks":[{"date":"2025-12-15 07:42:09","http_code":404},{"date":"2025-12-24 01:36:22","http_code":404},{"date":"2025-12-27 02:44:38","http_code":404},{"date":"2025-12-30 15:14:56","http_code":404},{"date":"2026-01-05 18:12:37","http_code":404},{"date":"2026-01-15 11:06:59","http_code":404},{"date":"2026-02-04 08:22:15","http_code":404},{"date":"2026-02-14 08:10:05","http_code":404},{"date":"2026-02-19 05:54:05","http_code":404},{"date":"2026-02-23 07:08:31","http_code":503},{"date":"2026-02-28 23:19:13","http_code":404},{"date":"2026-03-04 06:47:05","http_code":404},{"date":"2026-05-01 09:55:59","http_code":404},{"date":"2026-05-04 15:59:09","http_code":404},{"date":"2026-05-07 20:17:04","http_code":404}],"broken":true,"last_checked":{"date":"2026-05-07 20:17:04","http_code":404},"process":"done"},{"id":32,"href":"https:\/\/citation.crosscite.org","archived_href":"http:\/\/web-wp.archive.org\/web\/20250115122456\/https:\/\/citation.crosscite.org:443\/","redirect_href":"","checks":[{"date":"2025-12-15 07:41:44","http_code":200},{"date":"2025-12-24 01:36:19","http_code":200},{"date":"2025-12-27 02:44:39","http_code":200},{"date":"2025-12-30 15:14:56","http_code":200},{"date":"2026-01-05 18:12:38","http_code":200},{"date":"2026-01-15 11:06:59","http_code":200},{"date":"2026-02-04 08:22:16","http_code":200},{"date":"2026-02-19 05:54:07","http_code":200},{"date":"2026-02-23 07:08:42","http_code":200},{"date":"2026-02-28 23:19:14","http_code":200},{"date":"2026-03-04 06:47:04","http_code":200},{"date":"2026-05-01 09:55:59","http_code":200},{"date":"2026-05-04 15:59:09","http_code":200},{"date":"2026-05-07 20:17:03","http_code":200}],"broken":false,"last_checked":{"date":"2026-05-07 20:17:03","http_code":200},"process":"done"},{"id":98,"href":"https:\/\/zenodo.org\/record\/8013352","archived_href":"","redirect_href":"https:\/\/zenodo.org\/records\/8013352","checks":[],"broken":false,"last_checked":null,"process":"done"},{"id":35,"href":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0","archived_href":"http:\/\/web-wp.archive.org\/web\/20251214135420\/https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/","redirect_href":"","checks":[{"date":"2025-12-15 07:41:55","http_code":206},{"date":"2025-12-18 10:23:22","http_code":206},{"date":"2025-12-21 16:20:58","http_code":206},{"date":"2025-12-25 04:25:35","http_code":206},{"date":"2025-12-28 10:27:20","http_code":206},{"date":"2025-12-31 10:31:38","http_code":206},{"date":"2026-01-03 16:18:58","http_code":206},{"date":"2026-01-06 22:52:52","http_code":206},{"date":"2026-01-10 04:22:26","http_code":206},{"date":"2026-01-13 04:30:10","http_code":206},{"date":"2026-01-16 04:44:46","http_code":206},{"date":"2026-01-19 10:55:45","http_code":206},{"date":"2026-01-22 11:38:42","http_code":206},{"date":"2026-01-26 01:39:21","http_code":206},{"date":"2026-01-29 04:02:21","http_code":206},{"date":"2026-02-01 04:22:36","http_code":206},{"date":"2026-02-04 04:23:13","http_code":206},{"date":"2026-02-07 09:27:05","http_code":206},{"date":"2026-02-10 13:06:21","http_code":206},{"date":"2026-02-13 14:07:27","http_code":206},{"date":"2026-02-16 16:14:18","http_code":206},{"date":"2026-02-19 16:16:30","http_code":206},{"date":"2026-02-22 22:21:48","http_code":206},{"date":"2026-02-26 04:20:53","http_code":206},{"date":"2026-03-01 09:04:08","http_code":206},{"date":"2026-03-04 09:36:43","http_code":206},{"date":"2026-05-01 04:45:09","http_code":206},{"date":"2026-05-04 10:21:45","http_code":206},{"date":"2026-05-07 16:15:30","http_code":206}],"broken":false,"last_checked":{"date":"2026-05-07 16:15:30","http_code":206},"process":"done"}]</script><div  class='flex_column av-anfto-e5061495fe49ae372d63a824a8d421e4 av_one_full  avia-builder-el-0  avia-builder-el-no-sibling  first flex_column_div  '     ><div  class='av_promobox av-ld5ufz4h-196cc01b42967f08903515e4381e05f8 avia-button-yes  avia-builder-el-1  avia-builder-el-no-sibling '><div class='avia-promocontent'></p>
<p style="text-align: justify;"><span style="font-family: 'times new roman', times, serif;"><span style="font-size: 14pt;"><strong><span style="font-size: 18pt;">Human Computer Interaction in Education<a href="https://crossmark.crossref.org/dialog/?doi=10.54105/ijdm.A1625.053123&amp;domain=www.ijdm.latticescipub.com"><img decoding="async" id="crossmark-icon" class="alignnone" src="https://crossmark-cdn.crossref.org/widget/v2.0/logos/CROSSMARK_Color_horizontal.svg" alt="CROSSMARK Color horizontal" width="150" height="33"></a></span><br />
</strong>Ananya Khurana<span style="font-size: 10pt;"><sup><strong>1</strong></sup></span>, Rohan Raj<span style="font-size: 10pt;"><sup><strong>2</strong></sup></span>, Satender Kumar<span style="font-size: 10pt;"><sup><strong>3</strong></sup></span>, Neha Garg<span style="font-size: 10pt;"><sup><strong>4</strong></sup></span></span></span></p>
<p style="text-align: justify;"><span style="font-size: 12pt;"><span style="font-family: 'times new roman', times, serif;">
<style type="text/css" data-created_by="avia_inline_auto" id="style-css-av-a9b4g-b4f12ce60498e06e77e78fa4e9e11d0b">
.av_font_icon.av-a9b4g-b4f12ce60498e06e77e78fa4e9e11d0b{
color:#4392e8;
border-color:#4392e8;
}
.avia-svg-icon.av-a9b4g-b4f12ce60498e06e77e78fa4e9e11d0b svg:first-child{
stroke:#4392e8;
fill:#4392e8;
}
.av_font_icon.av-a9b4g-b4f12ce60498e06e77e78fa4e9e11d0b .av-icon-char{
font-size:20px;
line-height:20px;
}
</style>
<span  class='av_font_icon av-a9b4g-b4f12ce60498e06e77e78fa4e9e11d0b avia_animate_when_visible av-icon-style- avia-icon-pos-left avia-iconfont avia-font-entypo-fontello avia-icon-animate'><span class='av-icon-char' data-av_icon='' data-av_iconfont='entypo-fontello' aria-hidden="true" data-avia-icon-tooltip="ananyakhurana2401@gmail.com"></span></span><sup><strong>1</strong></sup>Ananya Khurana, Department of Computer Science and Engineering, Manav Rachna International Institute of Research and Studies, Faridabad (Haryana), India.</span></span></p>
<p style="text-align: justify;"><span style="font-size: 12pt;"><span style="font-family: 'times new roman', times, serif;">
<style type="text/css" data-created_by="avia_inline_auto" id="style-css-av-a9b4g-4-d7581b9c11eb4a650426121e75c7ce4e">
.av_font_icon.av-a9b4g-4-d7581b9c11eb4a650426121e75c7ce4e{
color:#4392e8;
border-color:#4392e8;
}
.avia-svg-icon.av-a9b4g-4-d7581b9c11eb4a650426121e75c7ce4e svg:first-child{
stroke:#4392e8;
fill:#4392e8;
}
.av_font_icon.av-a9b4g-4-d7581b9c11eb4a650426121e75c7ce4e .av-icon-char{
font-size:20px;
line-height:20px;
}
</style>
<span  class='av_font_icon av-a9b4g-4-d7581b9c11eb4a650426121e75c7ce4e avia_animate_when_visible av-icon-style- avia-icon-pos-left avia-iconfont avia-font-entypo-fontello avia-icon-animate'><span class='av-icon-char' data-av_icon='' data-av_iconfont='entypo-fontello' aria-hidden="true" data-avia-icon-tooltip="rohanraj091099@gmail.com"></span></span><sup><strong>2</strong></sup>Rohan Raj, Department of Computer Science and Engineering, Manav Rachna International Institute of Research and Studies, Faridabad (Haryana), India.</span></span></p>
<p style="text-align: justify;"><span style="font-size: 12pt;"><span style="font-family: 'times new roman', times, serif;">
<style type="text/css" data-created_by="avia_inline_auto" id="style-css-av-a9b4g-3-b2c2bf05ba40e648772a513c29facf3d">
.av_font_icon.av-a9b4g-3-b2c2bf05ba40e648772a513c29facf3d{
color:#4392e8;
border-color:#4392e8;
}
.avia-svg-icon.av-a9b4g-3-b2c2bf05ba40e648772a513c29facf3d svg:first-child{
stroke:#4392e8;
fill:#4392e8;
}
.av_font_icon.av-a9b4g-3-b2c2bf05ba40e648772a513c29facf3d .av-icon-char{
font-size:20px;
line-height:20px;
}
</style>
<span  class='av_font_icon av-a9b4g-3-b2c2bf05ba40e648772a513c29facf3d avia_animate_when_visible av-icon-style- avia-icon-pos-left avia-iconfont avia-font-entypo-fontello avia-icon-animate'><span class='av-icon-char' data-av_icon='' data-av_iconfont='entypo-fontello' aria-hidden="true" data-avia-icon-tooltip="satenderk8700@gmail.com"></span></span><sup><strong>3</strong></sup>Satender Kumar, Department of Computer Science and Engineering, Manav Rachna International Institute of Research and Studies, Faridabad (Haryana), India.</span></span></p>
<p style="text-align: justify;"><span style="font-size: 12pt;"><span style="font-family: 'times new roman', times, serif;">
<style type="text/css" data-created_by="avia_inline_auto" id="style-css-av-a9b4g-2-0642ba04aa471226b9ed2879395035a0">
.av_font_icon.av-a9b4g-2-0642ba04aa471226b9ed2879395035a0{
color:#4392e8;
border-color:#4392e8;
}
.avia-svg-icon.av-a9b4g-2-0642ba04aa471226b9ed2879395035a0 svg:first-child{
stroke:#4392e8;
fill:#4392e8;
}
.av_font_icon.av-a9b4g-2-0642ba04aa471226b9ed2879395035a0 .av-icon-char{
font-size:20px;
line-height:20px;
}
</style>
<span  class='av_font_icon av-a9b4g-2-0642ba04aa471226b9ed2879395035a0 avia_animate_when_visible av-icon-style- avia-icon-pos-left avia-iconfont avia-font-entypo-fontello avia-icon-animate'><span class='av-icon-char' data-av_icon='' data-av_iconfont='entypo-fontello' aria-hidden="true" data-avia-icon-tooltip="nehagarg.fet@mriu.edu.in"></span></span><sup><strong>4</strong></sup>Ms. Neha Garg, Department of Computer Science and Engineering, Manav Rachna International Institute of Research and Studies, Faridabad (Haryana), India.</span></span></p>
<p style="text-align: justify;"><span style="font-size: 12pt;"><span style="font-family: 'times new roman', times, serif;">Manuscript received on 04 January 2023<strong> |</strong> Revised Manuscript received on 16 January 2023<strong> |</strong> Manuscript Accepted on 15 May 2023<strong> |</strong> Manuscript published on 30 May 2023 </span><strong style="font-family: 'times new roman', times, serif;">|</strong><span style="font-family: 'times new roman', times, serif;"> PP: 6-9 </span><strong style="font-family: 'times new roman', times, serif;">|</strong><span style="font-family: 'times new roman', times, serif;"> Volume-3 Issue-1 May 2023 </span><strong style="font-family: 'times new roman', times, serif;">|</strong><span style="font-family: 'times new roman', times, serif;"> Retrieval Number: 100.1/ijdm.A1625053123 </span><strong style="font-family: 'times new roman', times, serif;">| </strong><span style="font-family: 'times new roman', times, serif;">DOI: </span><a style="font-family: &#039;times new roman&#039;, times, serif;" href="http://www.doi.org/10.54105/ijdm.A1625.053123" rel="noopener" target="_blank">10.54105/ijdm.A1625.053123</a></span></p>
<p style="text-align: justify;"><span style="font-family: 'times new roman', times, serif;"><span style="font-size: 12pt;"> <i class="fa fa-unlock-alt" style="color: blue;"></i><a href="https://www.openaccess.nl/en/open-publications" target="_blank" rel="noopener"> Open Access</a><strong> |</strong> <i class="far fa-file-alt" style="color: blue;"></i><a href="https://www.ijdm.latticescipub.com/ethics-policies/"> Editorial and Publishing Policies</a> | <i class="fa fa-quote-right" style="color: blue;"></i> <a href="https://citation.crosscite.org/" target="_blank" rel="noopener">Cite</a> <strong>|</strong> <i class="fa fa-plus" style="color: blue;" aria-hidden="true"></i><a href="https://zenodo.org/record/8013352" target="_blank" rel="noopener"> Zenodo</a> <strong>|</strong> <i class="fa fa-database" style="color: blue;" aria-hidden="true"></i><a href="https://www.ijdm.latticescipub.com/indexing/"> Indexing and Abstracting</a></span><span style="font-size: 10pt;"><span style="font-size: 12pt;"><br />
<span style="font-size: 10pt;"> © The Authors. Published by Lattice Science Publication (LSP). This is an <a href="https://www.openaccess.nl/en/open-publications" target="_blank" rel="noopener">open-access</a> article under the CC-BY-NC-ND license <a href="https://creativecommons.org/licenses/by-nc-nd/4.0/" target="_blank" rel="noopener">(http://creativecommons.org/licenses/by-nc-nd/4.0/)</a></span></span></span></span></p>
<p style="text-align: justify;"><span style="font-family: 'times new roman', times, serif; font-size: 14pt;"><strong>Abstract:</strong> Human-Computer Interaction (HCI) is no longer the sole study of information technology or computer science but now it has covered the area of medical, entertainment, etc. As the application of HCI is increasing, so is the requirement of students to work in a multidisciplinary environment. Making students comfortable working in a multidisciplinary environment is not an easy task. The students are required to make pretty much aware and comfortable with the underlying problem statement. The evolution of HCI in education is to make sure that students can understand the concepts and working of the model in a more effective way. The goal of this project is to create a web-based e-Learning tool, ‘Path Finding Visualizer’. It refers to computing an optimal route between the specified start node and goal nodes visualizing shortest path algorithms. The conceptual application of the project is illustrated by the implementation of algorithms like Dijkstra’s, A*, and DFS. The end product is a web application so that any user can easily see and learn the working of the algorithms through perceivable visualizations. The user-friendliness of the project provides the user with easy instructions on how to operate it. The initial results of using the application show promised benefits of the e-Learning tool towards students getting a good understanding of shortest paths algorithms.  </span></p>
<p style="text-align: justify;"><span style="font-family: 'times new roman', times, serif; font-size: 12pt;"><span style="font-size: 14pt;"><strong>Keywords:</strong> Path Finding Visualizer, Graph, Education, Data Structures</span><br />
<span style="font-size: 14pt;"> <strong>Article of the Scope:</strong> Visualization</span><br />
</span></p>
<p>
</div><div  class='avia-button-wrap av-ld5ufz4h-8994bc6f1db5b314269d69fca6ccfd1d-wrap avia-button-right '><a href="https://www.ijdm.latticescipub.com/wp-content/uploads/papers/v3i1/A1625053123.pdf" class="avia-button av-ld5ufz4h-8994bc6f1db5b314269d69fca6ccfd1d av-link-btn avia-icon_select-yes-left-icon avia-size-medium avia-position-right avia-color-theme-color" aria-label="Download PDF"><span class='avia_button_icon avia_button_icon_left avia-iconfont avia-font-entypo-fontello' data-av_icon='' data-av_iconfont='entypo-fontello' ></span><span class='avia_iconbox_title' >Download PDF</span></a></div></div></div></p>
<p>The post <a rel="nofollow" href="https://www.ijdm.latticescipub.com/portfolio-item/a1625053123/">A1625053123</a> appeared first on <a rel="nofollow" href="https://www.ijdm.latticescipub.com">Indian Journal of Data Mining (IJDM)</a>.</p>
]]></content:encoded>
					
		
		
			</item>
		<item>
		<title>A1624053123</title>
		<link>https://www.ijdm.latticescipub.com/portfolio-item/a1624053123/</link>
		
		<dc:creator><![CDATA[IJDM Journal]]></dc:creator>
		<pubDate>Sat, 24 Dec 2022 07:39:24 +0000</pubDate>
				<guid isPermaLink="false">https://www.ijdm.latticescipub.com/?post_type=portfolio&#038;p=711</guid>

					<description><![CDATA[<p>The Indian Journal of Data Mining (IJDM) has ISSN 2582-9246 (online), an open-access, peer-reviewed, periodical half-yearly international journal, which is published by Lattice Science Publication (LSP) in May and November. The journal aims to publish high-quality peer–reviewed original articles in the area of Data Mining that covers Data Mining, Data Science, Big Data, Data Warehouse, Visualization, Security, Privacy, Big DaaS, Scalable Computing, Cloud Computing, Knowledge Discovery, Integration, Transformation, Information Retrieval, Social Data and Semantics, Mining Functions, Data Regression, Data Classification, Anomaly Detection, Data Clustering, Data Association, Data Cleaning, Feature Selection and Extraction, Data Mining Algorithms, Apriori Decision Tree, Generalized Linear Models, k-Means, Minimum Description Length, Naive Bayes Non-Negative Matrix Factorization, 0-Cluster, Support Vector Machines, Data Preparation, Mining Unstructured Data, Artificial Intelligence, Future Directions and Challenges in Data Mining and Industrial Challenges in Data Mining. #Data Mining #Data Science #Big Data #Data Warehouse #Visualization #Security #Privacy #Big DaaS #Scalable Computing #Cloud Computing #Knowledge Discovery #Integration #Transformation #Information Retrieval #Social Data and Semantics #Mining Functions #Data Regression #Data Classification #Anomaly Detection #Data Clustering #Data Association #Data Regression #Data Cleaning #Feature Selection and Extraction #Data Mining Algorithms #Apriori #Decision Tree #Generalized Linear Models #k-Means #Minimum Description Length #Naive Bayes #Non-Negative Matrix Factorization #0-Cluster #Support Vector Machines #Data Preparation #Mining Unstructured Data #Artificial Intelligence #Future Directions and Challenges in Data Mining #Industrial Challenges in Data Mining #PhD ademic #Scopus #SCI #LatticeScience #Springer, #ScienceDirect #IEEE #Mendeley #Research #Scholarship #UGC #SSRN #LatticeScience #ESCI #Science #Journal #Conference #SSRN #PubLons #PhD #Academic #Scopus #SCI #LatticeScience #Springer, #ScienceDirect #IEEE #Mendeley #Research #Scholarship #UGC #SSRN #LatticeScience #ESCI #Science #Journal #Conference #SSRN #PubLons</p>
<p>The post <a rel="nofollow" href="https://www.ijdm.latticescipub.com/portfolio-item/a1624053123/">A1624053123</a> appeared first on <a rel="nofollow" href="https://www.ijdm.latticescipub.com">Indian Journal of Data Mining (IJDM)</a>.</p>
]]></description>
										<content:encoded><![CDATA[<p>The Indian Journal of Data Mining (IJDM) has ISSN 2582-9246 (online), an open-access, peer-reviewed, periodical half-yearly international journal, which is published by Lattice Science Publication (LSP) in May and November. The journal aims to publish high-quality peer–reviewed original articles in the area of Data Mining that covers Data Mining, Data Science, Big Data, Data Warehouse, Visualization, Security, Privacy, Big DaaS, Scalable Computing, Cloud Computing, Knowledge Discovery, Integration, Transformation, Information Retrieval, Social Data and Semantics, Mining Functions, Data Regression, Data Classification, Anomaly Detection, Data Clustering, Data Association, Data Cleaning, Feature Selection and Extraction, Data Mining Algorithms, Apriori Decision Tree, Generalized Linear Models, k-Means, Minimum Description Length, Naive Bayes Non-Negative Matrix Factorization, 0-Cluster, Support Vector Machines, Data Preparation, Mining Unstructured Data, Artificial Intelligence, Future Directions and Challenges in Data Mining and Industrial Challenges in Data Mining. #Data Mining #Data Science #Big Data #Data Warehouse #Visualization #Security #Privacy #Big DaaS #Scalable Computing #Cloud Computing #Knowledge Discovery #Integration #Transformation #Information Retrieval #Social Data and Semantics #Mining Functions #Data Regression #Data Classification #Anomaly Detection #Data Clustering #Data Association #Data Regression #Data Cleaning #Feature Selection and Extraction #Data Mining Algorithms #Apriori #Decision Tree #Generalized Linear Models #k-Means #Minimum Description Length #Naive Bayes #Non-Negative Matrix Factorization #0-Cluster #Support Vector Machines #Data Preparation #Mining Unstructured Data #Artificial Intelligence #Future Directions and Challenges in Data Mining #Industrial Challenges in Data Mining #PhD ademic #Scopus #SCI #LatticeScience #Springer, #ScienceDirect #IEEE #Mendeley #Research #Scholarship #UGC #SSRN #LatticeScience #ESCI #Science #Journal #Conference #SSRN #PubLons #PhD #Academic #Scopus #SCI #LatticeScience #Springer, #ScienceDirect #IEEE #Mendeley #Research #Scholarship #UGC #SSRN #LatticeScience #ESCI #Science #Journal #Conference #SSRN #PubLons</p>
<p><script type='application/json' class='__iawmlf-post-loop-links'>[{"id":141,"href":"https:\/\/crossmark.crossref.org\/dialog\/?doi=10.54105\/ijdm.A1624.053123&domain=www.ijdm.latticescipub.com","archived_href":"","redirect_href":"","checks":[],"broken":false,"last_checked":null,"process":"done"},{"id":142,"href":"http:\/\/www.doi.org\/10.54105\/ijdm.A1624.053123","archived_href":"","redirect_href":"https:\/\/www.doi.org\/10.54105\/ijdm.A1624.053123","checks":[],"broken":false,"last_checked":null,"process":"done"},{"id":38,"href":"https:\/\/www.openaccess.nl\/en\/open-publications","archived_href":"http:\/\/web-wp.archive.org\/web\/20241228104058\/https:\/\/www.openaccess.nl\/en\/open-publications","redirect_href":"","checks":[{"date":"2025-12-15 07:42:09","http_code":404},{"date":"2025-12-24 01:36:22","http_code":404},{"date":"2025-12-27 02:44:38","http_code":404},{"date":"2025-12-30 15:14:56","http_code":404},{"date":"2026-01-05 18:12:37","http_code":404},{"date":"2026-01-15 11:06:59","http_code":404},{"date":"2026-02-04 08:22:15","http_code":404},{"date":"2026-02-14 08:10:05","http_code":404},{"date":"2026-02-19 05:54:05","http_code":404},{"date":"2026-02-23 07:08:31","http_code":503},{"date":"2026-02-28 23:19:13","http_code":404},{"date":"2026-03-04 06:47:05","http_code":404},{"date":"2026-05-01 09:55:59","http_code":404},{"date":"2026-05-04 15:59:09","http_code":404},{"date":"2026-05-07 20:17:04","http_code":404}],"broken":true,"last_checked":{"date":"2026-05-07 20:17:04","http_code":404},"process":"done"},{"id":32,"href":"https:\/\/citation.crosscite.org","archived_href":"http:\/\/web-wp.archive.org\/web\/20250115122456\/https:\/\/citation.crosscite.org:443\/","redirect_href":"","checks":[{"date":"2025-12-15 07:41:44","http_code":200},{"date":"2025-12-24 01:36:19","http_code":200},{"date":"2025-12-27 02:44:39","http_code":200},{"date":"2025-12-30 15:14:56","http_code":200},{"date":"2026-01-05 18:12:38","http_code":200},{"date":"2026-01-15 11:06:59","http_code":200},{"date":"2026-02-04 08:22:16","http_code":200},{"date":"2026-02-19 05:54:07","http_code":200},{"date":"2026-02-23 07:08:42","http_code":200},{"date":"2026-02-28 23:19:14","http_code":200},{"date":"2026-03-04 06:47:04","http_code":200},{"date":"2026-05-01 09:55:59","http_code":200},{"date":"2026-05-04 15:59:09","http_code":200},{"date":"2026-05-07 20:17:03","http_code":200}],"broken":false,"last_checked":{"date":"2026-05-07 20:17:03","http_code":200},"process":"done"},{"id":143,"href":"https:\/\/zenodo.org\/record\/8013205","archived_href":"","redirect_href":"https:\/\/zenodo.org\/records\/8013205","checks":[],"broken":false,"last_checked":null,"process":"done"},{"id":35,"href":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0","archived_href":"http:\/\/web-wp.archive.org\/web\/20251214135420\/https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/","redirect_href":"","checks":[{"date":"2025-12-15 07:41:55","http_code":206},{"date":"2025-12-18 10:23:22","http_code":206},{"date":"2025-12-21 16:20:58","http_code":206},{"date":"2025-12-25 04:25:35","http_code":206},{"date":"2025-12-28 10:27:20","http_code":206},{"date":"2025-12-31 10:31:38","http_code":206},{"date":"2026-01-03 16:18:58","http_code":206},{"date":"2026-01-06 22:52:52","http_code":206},{"date":"2026-01-10 04:22:26","http_code":206},{"date":"2026-01-13 04:30:10","http_code":206},{"date":"2026-01-16 04:44:46","http_code":206},{"date":"2026-01-19 10:55:45","http_code":206},{"date":"2026-01-22 11:38:42","http_code":206},{"date":"2026-01-26 01:39:21","http_code":206},{"date":"2026-01-29 04:02:21","http_code":206},{"date":"2026-02-01 04:22:36","http_code":206},{"date":"2026-02-04 04:23:13","http_code":206},{"date":"2026-02-07 09:27:05","http_code":206},{"date":"2026-02-10 13:06:21","http_code":206},{"date":"2026-02-13 14:07:27","http_code":206},{"date":"2026-02-16 16:14:18","http_code":206},{"date":"2026-02-19 16:16:30","http_code":206},{"date":"2026-02-22 22:21:48","http_code":206},{"date":"2026-02-26 04:20:53","http_code":206},{"date":"2026-03-01 09:04:08","http_code":206},{"date":"2026-03-04 09:36:43","http_code":206},{"date":"2026-05-01 04:45:09","http_code":206},{"date":"2026-05-04 10:21:45","http_code":206},{"date":"2026-05-07 16:15:30","http_code":206}],"broken":false,"last_checked":{"date":"2026-05-07 16:15:30","http_code":206},"process":"done"}]</script><div  class='flex_column av-9u2ov-ca58388cbb2267baa524d4a6cb541333 av_one_full  avia-builder-el-0  avia-builder-el-no-sibling  first flex_column_div  '     ><div  class='av_promobox av-lc1ms0vb-010c4261f407ca5992ee819e681914c9 avia-button-yes  avia-builder-el-1  avia-builder-el-no-sibling '><div class='avia-promocontent'></p>
<p style="text-align: justify;"><span style="font-family: 'times new roman', times, serif;"><span style="font-size: 14pt;"><strong><span style="font-size: 18pt;">An Overview on Data Mining and Data Fusion<a href="https://crossmark.crossref.org/dialog/?doi=10.54105/ijdm.A1624.053123&amp;domain=www.ijdm.latticescipub.com"><img decoding="async" id="crossmark-icon" class="alignnone" src="https://crossmark-cdn.crossref.org/widget/v2.0/logos/CROSSMARK_Color_horizontal.svg" alt="CROSSMARK Color horizontal" width="150" height="33"></a></span><br />
</strong>Vinayak Jain</span></span></p>
<p style="text-align: justify;"><span style="font-family: 'times new roman', times, serif; font-size: 12pt;">
<style type="text/css" data-created_by="avia_inline_auto" id="style-css-av-a9b4g-b4f12ce60498e06e77e78fa4e9e11d0b">
.av_font_icon.av-a9b4g-b4f12ce60498e06e77e78fa4e9e11d0b{
color:#4392e8;
border-color:#4392e8;
}
.avia-svg-icon.av-a9b4g-b4f12ce60498e06e77e78fa4e9e11d0b svg:first-child{
stroke:#4392e8;
fill:#4392e8;
}
.av_font_icon.av-a9b4g-b4f12ce60498e06e77e78fa4e9e11d0b .av-icon-char{
font-size:20px;
line-height:20px;
}
</style>
<span  class='av_font_icon av-a9b4g-b4f12ce60498e06e77e78fa4e9e11d0b avia_animate_when_visible av-icon-style- avia-icon-pos-left avia-iconfont avia-font-entypo-fontello avia-icon-animate'><span class='av-icon-char' data-av_icon='' data-av_iconfont='entypo-fontello' aria-hidden="true" data-avia-icon-tooltip="vjain8250@gmail.com"></span></span>Vinayak Jain, Department of Computer Science, SRM University, NCR-Delhi, Sonepat (Haryana), India. </span></p>
<p style="text-align: justify;"><span style="font-family: 'times new roman', times, serif; font-size: 12pt;">Manuscript received on 12 December 2022 <strong>|</strong> Revised Manuscript received on 22 December 2022<strong> |</strong> Manuscript Accepted on 15 May 2023<strong> |</strong> Manuscript published on 30 May 2023 <strong>|</strong> PP: 1-5 <strong>|</strong> Volume-3 Issue-1 May 2023 <strong>|</strong> Retrieval Number: 100.1/ijdm.A1624053123 <strong>| </strong>DOI:<a href="http://www.doi.org/10.54105/ijdm.A1624.053123" rel="noopener" target="_blank">10.54105/ijdm.A1624.053123</a></span></p>
<p style="text-align: justify;"><span style="font-family: 'times new roman', times, serif;"><span style="font-size: 12pt;"> <i class="fa fa-unlock-alt" style="color: blue;"></i><a href="https://www.openaccess.nl/en/open-publications" target="_blank" rel="noopener"> Open Access</a><strong> |</strong> <i class="far fa-file-alt" style="color: blue;"></i><a href="https://www.ijdm.latticescipub.com/ethics-policies/"> Editorial and Publishing Policies</a> | <i class="fa fa-quote-right" style="color: blue;"></i> <a href="https://citation.crosscite.org/" target="_blank" rel="noopener">Cite</a> <strong>|</strong> <i class="fa fa-plus" style="color: blue;" aria-hidden="true"></i><a href="https://zenodo.org/record/8013205" target="_blank" rel="noopener"> Zenodo</a> <strong>|</strong> <i class="fa fa-database" style="color: blue;" aria-hidden="true"></i><a href="https://www.ijdm.latticescipub.com/indexing/"> Indexing and Abstracting</a></span><span style="font-size: 10pt;"><span style="font-size: 12pt;"><br />
<span style="font-size: 10pt;"> © The Authors. Published by Lattice Science Publication (LSP). This is an <a href="https://www.openaccess.nl/en/open-publications" target="_blank" rel="noopener">open-access</a> article under the CC-BY-NC-ND license <a href="https://creativecommons.org/licenses/by-nc-nd/4.0/" target="_blank" rel="noopener">(http://creativecommons.org/licenses/by-nc-nd/4.0/)</a></span></span></span></span></p>
<p style="text-align: justify;"><span style="font-family: 'times new roman', times, serif; font-size: 14pt;"><strong>Abstract:</strong> Strong adoption of Internet and Communication technologies across industries in the last two decades has led to large-scale digitization of business processes. While this has helped in the instant availability of information, over the period, the source and amount of this information have increased multi-fold giving rise to Big Data. With the increase in volume, the relevance of data in its raw format continues to decrease over time. According to HACE Theorem, Big Data has autonomous sources being distributed and decentralized data in a complex relationship with each other. Making sense of this ever-growing large pool of data has become increasingly difficult and has created a new problem waning the initial gains made via the digitization of systems and processes. This gave rise to the evolution of multiple Data Mining techniques that have helped to classify large volumes of data into relevant segments and drive value to help provide meaningful information. To extract and discover knowledge from data, Knowledge Discovering Databases (KDD) help in the refining of data. This paper discusses various data mining techniques that help to identify patterns and relationships to help make business decisions using data analysis. Furthermore, the Data Fusion method is reviewed which deals with joint analysis of multiple inter-related datasets providing multiple complementary views to help further with precise decision-making. </span></p>
<p style="text-align: justify;"><span style="font-family: 'times new roman', times, serif; font-size: 12pt;"><span style="font-size: 14pt;"><strong>Keywords:</strong> Big Data, Data Mining, Data Fusion, KDD, HACE Theorem</span><br />
<span style="font-size: 14pt;"> <strong>Article of the Scope:</strong> Data Mining</span><br />
</span></p>
<p>
</div><div  class='avia-button-wrap av-lc1ms0vb-20e76cb7a8165bc45851de2420851379-wrap avia-button-right '><a href="https://www.ijdm.latticescipub.com/wp-content/uploads/papers/v3i1/A1624053123.pdf" class="avia-button av-lc1ms0vb-20e76cb7a8165bc45851de2420851379 av-link-btn avia-icon_select-yes-left-icon avia-size-medium avia-position-right avia-color-theme-color" aria-label="Download PDF"><span class='avia_button_icon avia_button_icon_left avia-iconfont avia-font-entypo-fontello' data-av_icon='' data-av_iconfont='entypo-fontello' ></span><span class='avia_iconbox_title' >Download PDF</span></a></div></div></div></p>
<p>The post <a rel="nofollow" href="https://www.ijdm.latticescipub.com/portfolio-item/a1624053123/">A1624053123</a> appeared first on <a rel="nofollow" href="https://www.ijdm.latticescipub.com">Indian Journal of Data Mining (IJDM)</a>.</p>
]]></content:encoded>
					
		
		
			</item>
	</channel>
</rss>
