Sign inSubmit
Tips: “quotes” for a phrase · author:Lee · a DOI goes straight to its article

19 articles for “High Dimensional Dataset”
Set a search alert
Research ArticleOpen accessIn the abstractComparative Analysis on Prediction of Chronic KidneyDisease by various Machine Learning ModelsNikhil Verma, Tripti Sharma, Bobbinpreet Kaur, Ayush DograChronic Kidney Disease (CKD) is a prevalent global healthconcern, which is affecting a number of people in the whole world. Earlydetection & precise checking of CKD are really important for essentialsupervision & intervention to prevent disease progression and associatedcomplications. Machine learning (ML) models have emerged as favourabletools for CKD detection due to their ability to analyse complex data patternsand provide … …Journal of Computer Science, Vol. 21, Issue 6 · 24 May 2025 · 5,939 accessesView PDFCite
Review ArticleOpen accessIn the abstractDeep Learning in Early Alzheimer’s Disease’s Detection: A Comprehensive Survey of Classification, Segmentation and Feature Extraction MethodsRubab Hafeez, Sadia Waheed, Syeda Aleena Naqvi et al.Alzheimer’s disease is a deadly neurological condition, impairing important memory and brain functions. Alzheimer’s disease promotes brain shrinkage, ultimately leading to dementia. Dementia diagnosis typically takes 2.8-4.4 years after the first clinical indication. Advancements in computing and information technology have led to many techniques for studying Alzheimer's disease. Early identification and therapy are crucial for preventing Alzheimer's disease, as early-onset … …Journal of Computer Science, Vol. 21, Issue 5 · 26 Apr 2025 · 5,765 accessesView PDFCite
Research ArticleOpen accessIn the abstractShots Temporal Prediction Rules for High-Dimensional Data of Semantic Video RetrievalShaimaa Toriah Mohamed Toriah, Atef Zaki Ghalwash, Aliaa A.A. YoussifTemporal consistency stands as a vital property in semantic video retrieval. Few research studies can exploit this useful property. Most of the used methods in those studies depend on rules defined by experts and use ground-truth annotation. The Ground-truth annotation is time-consuming, labor intensive and domain specific. Additionally, it involves a limited number of annotated concepts and a limited number … …American Journal of Applied Sciences, Vol. 15, Issue 1 · 30 Jan 2018 · 8,117 accessesView PDFCite
Research ArticleOpen accessIn the abstractAsymptotic Properties of Local Sampling on ManifoldYury Aleksandrovich YanovichIn many applications, the real high-dimensional data occupy only a very small part in the high dimensional ‘observation space’ whose intrinsic dimension is small. The most popular model of such data is Manifold model which assumes that the data lie on or near an unknown manifold Data Manifold, (DM) of lower dimensionality embedded in an ambient high-dimensional input space (Manifold … …Journal of Mathematics and Statistics, Vol. 12, Issue 3 · 26 Aug 2016 · 7,698 accessesView PDFCite
Research ArticleOpen accessIn the abstractCOMBINATION OF DIFFERENCE SUBSPACE AND OPPURTUNISTIC CLUSTERING ON HIGH DIMENSIONAL DATAM. Ravichandran, A. ShanmugamClustering is recognized as sigificant technique for analysing data and concentric effort has been taken in different domains comprises of recognition of pattern, statistical analysis and data mining for decades. Subspace clustering is developed from the group of cluster objects from all subspaces of a dataset. During clustering of objects involing higher dimension, the accuracy and effectiveness of traditional clustering … …Journal of Computer Science, Vol. 10, Issue 8 · 11 Mar 2014 · 6,355 accessesView PDFCite
Research ArticleOpen accessIn the abstractWavelet Statistical Texture Features with Orthogonal Operators Tumour Classification in Magnetic Resonance Imaging BrainR. Meenakshi, P. AnandhakumarTumors medically also called neoplasms are an abnormal mass of tissue resulting from uncontrolled proliferation or division of cells occurring in the human body. If such growth is located in the brain then it is called as brain tumor. Identification of such tumors is a major challenge in the field of medical science. Early identification of tumors prove to be … …American Journal of Applied Sciences, Vol. 10, Issue 10 · 5 Sep 2013 · 6,600 accessesView PDFCite
Research ArticleOpen accessIn the abstractA Density Based Dynamic Data Clustering Algorithm based on Incremental DatasetS. Angel Latha Mary, K.R. Shankar KumarProblem statement: Clustering and visualizing high-dimensional dynamic data is a challenging problem. Most of the existing clustering algorithms are based on the static statistical relationship among data. Dynamic clustering is a mechanism to adopt and discover clusters in real time environments. There are many applications such as incremental data mining in data warehousing applications, sensor network, which relies on dynamic … …Journal of Computer Science, Vol. 8, Issue 5 · 20 Feb 2012 · 7,465 accessesView PDFCite
Research ArticleOpen accessIn the abstractGene Selection and Classification in Microarray Datasets using a Hybrid Approach of PCC-BPSO/GA with Multi ClassifiersShilan S. Hameed, Fahmi F. Muhammad, Rohayanti Hassan, Faisal SaeedIn this study, a three-phase hybrid approach is proposed for the selection and classification of high dimensional microarray data. The method uses Pearson’s Correlation Coefficient (PCC) in combination with Binary Particle Swarm Optimization (BPSO) or Genetic Algorithm (GA) along with various classifiers, thereby forming a PCC-BPSO/GA-multi classifiers approach. As such, five various classifiers are employed in the final stage of … …Journal of Computer Science, Vol. 14, Issue 6 · 26 Jun 2018 · 9,355 accessesView PDFCite
Research ArticleOpen accessIn the abstractSingle Pass Seed Selection Algorithm for k-MeansK. Karteeka Pavan, Allam Appa Rao, A.V. Dattatreya Rao, G. R. SridharProblem statement: The k-means method is one of the most widely used clustering techniques for various applications. However, the k-means often converges to local optimum and the result depends on the initial seeds. Inappropriate choice of initial seeds may yield poor results. k-means++ is a way of initializing k-means by choosing initial seeds with specific probabilities. Due to the random … …Journal of Computer Science, Vol. 6, Issue 1 · 31 Jan 2010 · 7,541 accessesView PDFCite