Dataset Information

Data on cut-edge for spatial clustering based on proximity graphs.

ABSTRACT: Cluster analysis plays a significant role regarding automating such a knowledge discovery process in spatial data mining. A good clustering algorithm supports two essential conditions, namely high intra-cluster similarity and low inter-cluster similarity. Maximized intra-cluster/within-cluster similarity produces low distances between data points inside the same cluster. However, minimized inter-cluster/between-cluster similarity increases the distance between data points in different clusters by furthering them apart from each other. We previously presented a spatial clustering algorithm, abbreviated CutESC (Cut-Edge for Spatial Clustering) with a graph-based approach. The data presented in this article is related to and supportive to the research paper entitled "CutESC: Cutting edge spatial clustering technique based on proximity graphs" (Aksac et al., 2019) [1], where interpretation research data presented here is available. In this article, we share the parametric version of our algorithm named CutESC-P, the best parameter settings for the experiments, the additional analyses and some additional information related to the proposed algorithm (CutESC) in [1].

SUBMITTER: Aksac A

PROVIDER: S-EPMC6931115 | biostudies-literature | 2020 Feb

REPOSITORIES: biostudies-literature

ACCESS DATA

Publications

Data on cut-edge for spatial clustering based on proximity graphs.

Aksac Alper A Ozyer Tansel T Alhajj Reda R

Data in brief 20191129

Cluster analysis plays a significant role regarding automating such a knowledge discovery process in spatial data mining. A good clustering algorithm supports two essential conditions, namely high intra-cluster similarity and low inter-cluster similarity. Maximized intra-cluster/within-cluster similarity produces low distances between data points inside the same cluster. However, minimized inter-cluster/between-cluster similarity increases the distance between data points in different clusters b ...[more]

PMID: 31890778

Similar Datasets

Project description:Accumulated evidence of biological clinical trials has shown that long non-coding RNAs (lncRNAs) are closely related to the occurrence and development of various complex human diseases. Research works on lncRNA-disease relations will benefit to further understand the pathogenesis of human complex diseases at the molecular level, but only a small proportion of lncRNA-disease associations has been confirmed. Considering the high cost of biological experiments, exploring potential lncRNA-disease associations with computational approaches has become very urgent. In this study, a model based on closest node weight graph of the spatial neighborhood (CNWGSN) and edge attention graph convolutional network (EAGCN), LDA-EAGCN, was developed to uncover potential lncRNA-disease associations by integrating disease semantic similarity, lncRNA functional similarity, and known lncRNA-disease associations. Inspired by the great success of the EAGCN method on the chemical molecule property recognition problem, the prediction of lncRNA-disease associations could be regarded as a component recognition problem of lncRNA-disease characteristic graphs. The CNWGSN features of lncRNA-disease associations combined with known lncRNA-disease associations were introduced to train EAGCN, and correlation scores of input data were predicted with EAGCN for judging whether the input lncRNAs would be associated with the input diseases. LDA-EAGCN achieved a reliable AUC value of 0.9853 in the ten-fold cross-over experiments, which was the highest among five state-of-the-art models. Furthermore, case studies of renal cancer, laryngeal carcinoma, and liver cancer were implemented, and most of the top-ranking lncRNA-disease associations have been proven by recently published experimental literature works. It can be seen that LDA-EAGCN is an effective model for predicting potential lncRNA-disease associations. Its source code and experimental data are available at https://github.com/HGDKMF/LDA-EAGCN.

Project description:Both amplitude and latency of single-trial EEG/MEG recordings provide valuable information regarding functionality of the human brain. In this article, we provided a data-driven graph and network-based framework for mining information from multi-trial event-related brain recordings. In the first part, we provide the general outline of the proposed methodological approach. In the second part, we provide a more detailed illustration, and present the obtained results on every step of the algorithmic procedure. To justify the proposed framework instead of presenting the analytic data mining and graph-based steps, we address the problem of response variability, a prerequisite to reliable estimates for both the amplitude and latency on specific N/P components linked to the nature of the stimuli. The major question addressed in this study is the selection of representative single-trials with the aim of uncovering a less noisey averaged waveform elicited from the stimuli. This graph and network-based algorithmic procedure increases the signal-to-noise (SNR) of the brain response, a key pre-processing step to reveal significant and reliable amplitude and latency at a specific time after the onset of the stimulus and with the right polarity (N or P). We demonstrated the whole approach using electroencephalography (EEG) auditory mismatch negativity (MMN) recordings from 42 young healthy controls. The method is novel, fast and data-driven succeeding first to reveal the true waveform elicited by MMN on different conditions (frequency, intensity, duration, etc.). The proposed graph-oriented algorithmic pipeline increased the SNR of the characteristic waveforms and the reliability of amplitude and latency within the adopted cohort. We also demonstrated how different EEG reference schemes (REST vs. average) can influence amplitude-latency estimation. Simulation results revealed robust amplitude-latency estimations under different SNR and amplitude-latency variations with the proposed algorithm.

Dataset Information

Data on cut-edge for spatial clustering based on proximity graphs.

Publications

Data on cut-edge for spatial clustering based on proximity graphs.

Similar Datasets

OmicsDI is part of the ELIXIR infrastructure

Tweets