Association Rule Discovery in Data Mining by Implementing Principal Component Analysis

2005 ◽  
pp. 50-60 ◽  
Author(s):  
Bobby D. Gerardo ◽  
Jaewan Lee ◽  
Inho Ra ◽  
Sangyong Byun
Keyword(s):  
Data Mining ◽  
Principal Component Analysis ◽  
Association Rule ◽  
Principal Component ◽  
Component Analysis ◽  
Rule Discovery ◽  
Association Rule Discovery

Data Mining in Analysis of Biomechanical Signals

2009 ◽  
Vol 147-149 ◽  
pp. 588-593 ◽  
Author(s):  
Marcin Derlatka ◽  
Jolanta Pauk
Keyword(s):  
Data Mining ◽  
Principal Component Analysis ◽  
Cerebral Palsy ◽  
Spina Bifida ◽  
Decision Tree ◽  
Principal Component ◽  
Data Preprocessing ◽  
Component Analysis ◽  
Kernel Principal Component Analysis

In the paper the procedure of processing biomechanical data has been proposed. It consists of selecting proper noiseless data, preprocessing data by means of model’s identification and Kernel Principal Component Analysis and next classification using decision tree. The obtained results of classification into groups (normal and two selected pathology of gait: Spina Bifida and Cerebral Palsy) were very good.

Statistical approaches in literature: An application of principal component analysis and factor analysis to analyze the different arrangements about the Quran’s Suras

2020 ◽  
Author(s):  
Yanwen Wang ◽  
Javad Garjami ◽  
Milena Tsvetkova ◽  
Nguyen Huu Hau ◽  
Kim-Hung Pho
Keyword(s):  
Data Mining ◽  
Principal Component Analysis ◽  
Factor Analysis ◽  
Data Analysis ◽  
Principal Component ◽  
Component Analysis ◽  
Holy Quran ◽  
The Holy Quran ◽  
Statistical Approaches

Abstract Data mining, statistics, and data analysis are popular techniques to study datasets and extract knowledge from them. In this article, principal component analysis and factor analysis were applied to cluster thirteen different given arrangements about the Suras of the Holy Quran. The results showed that these thirteen arrangements can be categorized in two parts such that the first part includes Blachère, Davood, Grimm, Nöldeke, Bazargan, E’temad-al-Saltane and Muir, and the second part includes Ebn Nadim, Jaber, Ebn Abbas, Hazrat Ali, Khazan, and Al-Azhar.

scholarly journals Predicting breast cancer recurrence using principal component analysis as feature extraction: an unbiased comparative analysis

2020 ◽  
Vol 6 (3) ◽  
pp. 313
Author(s):  
Zuhaira Muhammad Zain ◽  
Mona Alshenaifi ◽  
Abeer Aljaloud ◽  
Tamadhur Albednah ◽  
Reham Alghanim ◽  
...  
Keyword(s):  
Breast Cancer ◽  
Data Mining ◽  
Principal Component Analysis ◽  
Feature Extraction ◽  
Medical Information ◽  
Cancer Recurrence ◽  
Principal Component ◽  
Component Analysis ◽  
Breast Cancer Recurrence ◽  
F Measure

Breast cancer recurrence is among the most noteworthy fears faced by women. Nevertheless, with modern innovations in data mining technology, early recurrence prediction can help relieve these fears. Although medical information is typically complicated, and simplifying searches to the most relevant input is challenging, new sophisticated data mining techniques promise accurate predictions from high-dimensional data. In this study, the performances of three established data mining algorithms: Naïve Bayes (NB), k-nearest neighbor (KNN), and fast decision tree (REPTree), adopting the feature extraction algorithm, principal component analysis (PCA), for predicting breast cancer recurrence were contrasted. The comparison was conducted between models built in the absence and presence of PCA. The results showed that KNN produced better prediction without PCA (F-measure = 72.1%), whereas the other two techniques: NB and REPTree, improved when used with PCA (F-measure = 76.1% and 72.8%, respectively). This study can benefit the healthcare industry in assisting physicians in predicting breast cancer recurrence precisely.

scholarly journals Improved Weighted Page Ranking Algorithm Based on Principal Component Analysis and Map Reduce Frame work for Web Access

2019 ◽  
Vol 8 (2) ◽  
pp. 32-39
Author(s):  
T. Mylsami ◽  
B. L. Shivakumar
Keyword(s):  
Data Mining ◽  
Principal Component Analysis ◽  
Web Mining ◽  
Principal Component ◽  
Component Analysis ◽  
Mean Value ◽  
Ranking Algorithm ◽  
Mean Values ◽  
Page Ranking ◽  
The Web

In general the World Wide Web become the most useful information resource used for information retrievals and knowledge discoveries. But the Information on Web to be expand in size and density. The retrieval of the required information on the web is efficiently and effectively to be challenge one. For the tremendous growth of the web has created challenges for the search engine technology. Web mining is an area in which applies data mining techniques to deal the requirements. The following are the popular Web Mining algorithms, such as PageRanking (PR), Weighted PageRanking (WPR) and Hyperlink-Induced Topic Search (HITS), are quite commonly used algorithm to sort out and rank the search results. In among the page ranking algorithm uses web structure mining and web content mining to estimate the relevancy of a web site and not to deal the scalability problem and also visits of inlinks and outlinks of the pages. In recent days to access fast and efficient page ranking algorithm for webpage retrieval remains as a challenging. This paper proposed a new improved WPR algorithm which uses a Principal Component Analysis technique called (PWPR) based on mean value of page ranks. The proposed PWPR algorithm takes into account the importance of both the number of visits of inlinks and outlinks of the pages and distributes rank scores based on the popularity of the pages. The weight values of the pages is computed from the inlinks and outlinks with their mean values. But in PWPR method new data and updates are constantly arriving, the results of data mining applications become stale and obsolete over time. To solve this problem is a MapReduce (MR) framework is promising approach to refreshing mining results for mining big data .The proposed MR algorithm reduces the time complexity of the PWPR algorithm by reducing the number of iterations to reach a convergence point.

Sign in / Sign up

Export Citation Format

Share Document