An unsupervised clustering method for nuclear magnetic resonance transverse relaxation spectrums based on the Gaussian mixture model and its application

To make the quantitative results of nuclear magnetic resonance(NMR) transverse relaxation(T;) spectrums reflect the type and pore structure of reservoir more directly, an unsupervised clustering method was developed to obtain the quantitative pore structure information from the NMR T;spectrums based on the Gaussian mixture model(GMM). Firstly, We conducted the principal component analysis on T;spectrums in order to reduce the dimension data and the dependence of the original variables. Secondly, the dimension-reduced data was fitted using the GMM probability density function, and the model parameters and optimal clustering numbers were obtained according to the expectation-maximization algorithm and the change of the Akaike information criterion. Finally, the T;spectrum features and pore structure types of different clustering groups were analyzed and compared with T;geometric mean and T;arithmetic mean. The effectiveness of the algorithm has been verified by numerical simulation and field NMR logging data. The research shows that the clustering results based on GMM method have good correlations with the shape and distribution of the T;spectrum, pore structure, and petroleum productivity, providing a new means for quantitative identification of pore structure, reservoir grading, and oil and gas productivity evaluation.

Unstructured Oncological Image Cluster Identification Using Improved Unsupervised Clustering Techniques

This paper presents,a new approach of Medical Image Pixels Clustering(MIPC),aims to trace the dissimilar patterns over the Magnetic Resonance(MR)image through the process of automatically identify the appropriate number of distinct clusters based on different improved unsupervised clustering schemes for enrichment,pattern predication and deeper investigation.The proposed MIPC consists of two stages:clustering and validation.In the clustering stage,the MIPC automatically identifies the distinct number of dissimilar clusters over the gray scale MR image based on three different improved unsupervised clustering schemes likely improved Limited Agglomerative Clustering(iLIAC),Dynamic Automatic Agglomerative Clustering(DAAC)and Optimum N-Means(ONM).In the second stage,the performance of MIPC approach is estimated by measuring Intra intimacy and Intra contrast of each individual cluster in the result of MR image based on proposed validation method namely Shreekum Intra Cluster Measure(SICM).Experimental results showthat the MIPC approach is better suited for automatic identification of highly relative dissimilar clusters over the MR cancer images with higher Intra closeness and lower Intra contrast based on improved unsupervised clustering schemes.

Research and Implementation of Unsupervised Clustering-Based Intrusion Detection

An unsupervised clustering\|based intrusion detection algorithm is discussed in this paper. The basic idea of the algorithm is to produce the cluster by comparing the distances of unlabeled training data sets. With the classified data instances, anomaly data clusters can be easily identified by normal cluster ratio and the identified cluster can be used in real data detection. The benefit of the algorithm is that it doesn't need labeled training data sets. The experiment concludes that this approach can detect unknown intrusions efficiently in the real network connections via using the data sets of KDD99.

Contrastive Clustering for Unsupervised Recognition of Interference Signals

Interference signals recognition plays an important role in anti-jamming communication.With the development of deep learning,many supervised interference signals recognition algorithms based on deep learning have emerged recently and show better performance than traditional recognition algorithms.However,there is no unsupervised interference signals recognition algorithm at present.In this paper,an unsupervised interference signals recognition method called double phases and double dimensions contrastive clustering(DDCC)is proposed.Specifically,in the first phase,four data augmentation strategies for interference signals are used in data-augmentation-based(DA-based)contrastive learning.In the second phase,the original dataset’s k-nearest neighbor set(KNNset)is designed in double dimensions contrastive learning.In addition,a dynamic entropy parameter strategy is proposed.The simulation experiments of 9 types of interference signals show that random cropping is the best one of the four data augmentation strategies;the feature dimensional contrastive learning in the second phase can improve the clustering purity;the dynamic entropy parameter strategy can improve the stability of DDCC effectively.The unsupervised interference signals recognition results of DDCC and five other deep clustering algorithms show that the clustering performance of DDCC is superior to other algorithms.In particular,the clustering purity of our method is above 92%,SCAN’s is 81%,and the other three methods’are below 71%when jammingnoise-ratio(JNR)is−5 dB.In addition,our method is close to the supervised learning algorithm.

Unsupervised Functional Data Clustering Based on Adaptive Weights

In recent years, functional data has been widely used in finance, medicine, biology and other fields. The current clustering analysis can solve the problems in finite-dimensional space, but it is difficult to be directly used for the clustering of functional data. In this paper, we propose a new unsupervised clustering algorithm based on adaptive weights. In the absence of initialization parameter, we use entropy-type penalty terms and fuzzy partition matrix to find the optimal number of clusters. At the same time, we introduce a measure based on adaptive weights to reflect the difference in information content between different clustering metrics. Simulation experiments show that the proposed algorithm has higher purity than some algorithms.

A novel method for clustering cellular data to improve classification

Many fields,such as neuroscience,are experiencing the vast prolife ration of cellular data,underscoring the need fo r organizing and interpreting large datasets.A popular approach partitions data into manageable subsets via hierarchical clustering,but objective methods to determine the appropriate classification granularity are missing.We recently introduced a technique to systematically identify when to stop subdividing clusters based on the fundamental principle that cells must differ more between than within clusters.Here we present the corresponding protocol to classify cellular datasets by combining datadriven unsupervised hierarchical clustering with statistical testing.These general-purpose functions are applicable to any cellular dataset that can be organized as two-dimensional matrices of numerical values,including molecula r,physiological,and anatomical datasets.We demonstrate the protocol using cellular data from the Janelia MouseLight project to chara cterize morphological aspects of neurons.

Solar flare forecasting using learning vector quantity and unsupervised clustering techniques

In this paper, a combined method of unsupervised clustering and learning vector quantity (LVQ) is presented to forecast the occurrence of solar flare. Three magnetic parameters including the maximum horizontal gradient, the length of the neutral line, and the number of singular points are extracted from SOHO/MDI longitudinal magnetograms as measures. Based on these pa- rameters, the sliding-window method is used to form the sequential data by adding three days evolutionary information. Con- sidering the imbalanced problem in dataset, the K-means clustering, as an unsupervised clustering algorithm, is used to convert imbalanced data to balanced ones. Finally, the learning vector quantity is employed to predict the flares level within 48 hours. Experimental results indicate that the performance of the proposed flare forecasting model with sequential data is improved.

Unsupervised seismic facies analysis using sparse representation spectral clustering

Traditional unsupervised seismic facies analysis techniques need to assume that seismic data obey mixed Gaussian distribution.However,fi eld seismic data may not meet this condition,thereby leading to wrong classifi cation in the application of this technology.This paper introduces a spectral clustering technique for unsupervised seismic facies analysis.This algorithm is based on on the idea of a graph to cluster the data.Its kem is that seismic data are regarded as points in space,points can be connected with the edge and construct to graphs.When the graphs are divided,the weights of the edges between the different subgraphs are as low as possible,whereas the weights of the inner edges of the subgraph should be as high as possible.That has high computational complexity and entails large memory consumption for spectral clustering algorithm.To solve the problem this paper introduces the idea of sparse representation into spectral clustering.Through the selection of a small number of local sparse representation points,the spectral clustering matrix of all sample points is approximately represented to reduce the cost of spectral clustering operation.Verifi cation of physical model and fi eld data shows that the proposed approach can obtain more accurate seismic facies classification results without considering the data meet any hypothesis.The computing efficiency of this new method is better than that of the conventional spectral clustering method,thereby meeting the application needs of fi eld seismic data.

Open World Recognition of Communication Jamming Signals

To improve the recognition ability of communication jamming signals,Siamese Neural Network-based Open World Recognition(SNNOWR)is proposed.The algorithm can recognize known jamming classes,detect new(unknown)jamming classes,and unsupervised cluseter new classes.The network of SNN-OWR is trained supervised with paired input data consisting of two samples from a known dataset.On the one hand,the network is required to have the ability to distinguish whether two samples are from the same class.On the other hand,the latent distribution of known class is forced to approach their own unique Gaussian distribution,which is prepared for the subsequent open set testing.During the test,the unknown class detection process based on Gaussian probability density function threshold is designed,and an unsupervised clustering algorithm of the unknown jamming is realized by using the prior knowledge of known classes.The simulation results show that when the jamming-to-noise ratio is more than 0d B,the accuracy of SNN-OWR algorithm for known jamming classes recognition,unknown jamming detection and unsupervised clustering of unknown jamming is about 95%.This indicates that the SNN-OWR algorithm can make the effect of the recognition of unknown jamming be almost the same as that of known jamming.

Early life history traits of chub mackerel Scomber japonicus in the Oyashio water revealed by otolith microstructure

Information on survival and growth during the early life stage is essential to understand the mechanism of interannual variations in fish recruitment.Chub mackerel Scomber japonicus is a commercially important pelagic fish widely distributed in the northwestern Pacific.Its catch showed large fluctuations with changes in distribution and migration under climate change and strong fishing.We determined the hatch dates and growth rates of young-of-the-year of chub mackerel through otolith microstructure using samples collected in the Oyashio water in autumn 2018.Results show that the ages of young chub mackerel ranged between 120 and 180 d,and the estimated hatch date lasted from midJanuary to late May with a peak from mid-March to mid-April.Average otolith daily increment width during the early life stages(from hatching to 25 d)showed an increasing trend.Chub mackerel grows slowly in the first 10 d,and then grows faster during the 10thto 25thd.Three groups with dissimilar growth histories and migration routes were identified using unsupervised random forest clustering analysis,but all eventually converge on the same nursery ground.The faster growth of young-of-the-year chub mackerel leads to better recruitment due to the hypothesis of growth-dependent mortality.Most chub mackerels hatched in March and April,the spawning period is longer and earlier,which could lead to strong year classes.These findings on population composition and life history traits of young-of-the-year of chub mackerel provide valuable information on its recruitment processes during the period of stock recovery.

Identifying Similar Operation Scenes for Busy Area Sector Dynamic Management

Air traffic controllers face challenging initiatives due to uncertainty in air traffic.One way to support their initiatives is to identify similar operation scenes.Based on the operation characteristics of typical busy area control airspace,an complexity measurement indicator system is established.We find that operation in area sector is characterized by aggregation and continuity,and that dimensionality and information redundancy reduction are feasible for dynamic operation data base on principle components.Using principle components,discrete features and time series features are constructed.Based on Gaussian kernel function,Euclidean distance and dynamic time warping(DTW)are used to measure the similarity of the features.Then the matrices of similarity are input in Spectral Clustering.The clustering results show that similar scenes of trend are not ideal and similar scenes of modes are good base on the indicator system.Finally,actual vertical operation decisions for area sector and results of identification are compared,which are visualized by metric multidimensional scaling(MDS)plots.We find that identification results can well reflect the operation at peak hours,but controllers make different decisions under the similar conditions before dawn.The compliance rate of busy operation mode and division decisions at peak hours is 96.7%.The results also show subjectivity of actual operation and objectivity of identification.In most scenes,we observe that similar air traffic activities provide regularity for initiatives,validating the potential of this approach for initiatives and other artificial intelligence support.

Otolith Microstructure Analysis Reveals Different Growth Histories of Japanese Sardine (Sardinops melanostictus) in the Oyashio Waters

After decades of low year classes,the stock of Japanese sardine(Sardinops melanostictus)has begun to recover since the mid-2000s.The hatch dates and otolith growth rates of age-0 juvenile sardine,which were collected in the subarctic Oyashio waters in autumn 2018,were determined from an otolith microstructure analysis.The sardines were hatched from late January to late April,while mostly in February and March.The otolith growth rate increased continuously up to 60 d after hatching and thereafter de-creased.The revealed growth rate in a crucial growth period is faster than that reported for juvenile sardines collected in the 1990s,which is coincided with the recent recovery trend of the sardine stock.Two groups with different hatch dates,growth histories,and migration routes were identified using unsupervised random forest clustering analysis.They were considered inshore and offshore migration individuals in accordance with recent researches.In the offshore group,a high proportion of sardine juveniles hatched late and grew faster in the Kuroshio-Oyashio transitional waters,a finding consistent with the hypothesis of growth-rate-dependent re-cruitment.This finding on the population composition and growth rate of juvenile sardine in the Oyashio waters can be a basis for an improved prediction of their survival and provides us with valuable information on the recruitment processes of this stock during the period of stock recovery.

Unsupervised random forest for affinity estimation

This paper presents an unsupervised clustering random-forest-based metric for affinity estimation in large and high-dimensional data.The criterion used for node splitting during forest construction can handle rank-deficiency when measuring cluster compactness.The binary forest-based metric is extended to continuous metrics by exploiting both the common traversal path and the smallest shared parent node.The proposed forest-based metric efficiently estimates affinity by passing down data pairs in the forest using a limited number of decision trees.A pseudo-leaf-splitting(PLS)algorithm is introduced to account for spatial relationships,which regularizes affinity measures and overcomes inconsistent leaf assign-ments.The random-forest-based metric with PLS facilitates the establishment of consistent and point-wise correspondences.The proposed method has been applied to automatic phrase recognition using color and depth videos and point-wise correspondence.Extensive experiments demonstrate the effectiveness of the proposed method in affinity estimation in a comparison with the state-of-the-art.

Spectral clustering based on matrix perturbation theory

This paper exposes some intrlnsic chsracterlstlca of the spectral clustering method by using the tools from the mstrlx perturbation theory. We construct s welght mstrix of s graph and study Its elgenvalues and elgenvectors. It shows that the number of clusters Is equal to the number of elgenvslues that are larger than 1, and the number of polnts In each of the clusters can be spproxlmsted by the associated elgenvslue. It also shows that the elgenvector of the weight rnatrlx can be used dlrectly to perform clusterlng; that Is, the dlrectlonsl angle between the two-row vectors of the mstrlx derlved from the elgenvectors Is s sultable distance measure for clustsrlng. As s result, an unsupervised spectral clusterlng slgorlthm based on welght mstrlx （USCAWM） Is developed. The experlmental results on s number of srtlficisl and real-world data sets show the correctness of the theoretical analysis.

Structure Identification for Force-Induced Reaction Using Single-Molecule Conductance Measurement

Spiropyran derivatives are prototype mechanophores with a promising application as molecular sensors because of their changeable structure under external force stimuli.However,the chemical structure evolution under external stimuli remains unclear due to the uncertainty and difficulty in distinguishing the structures of different ring-opened merocyanine isomers generated in the force-induced reaction.Here we identify the structure of isomers produced by the force-induced reaction of spiropyran derivatives using a single-molecule conductance measurement and an unsupervised clustering algorithm.We found that the original data from the single-molecule conductance measurement can be divided into four clusters through unsupervised clustering.By introducing a photoinduced reaction and theoretical calculation,we identified and attributed the four clusters of data to the multiple states of the molecular junctions.Our work demonstrates that a single-molecule break junction measurement can distinguish the isomers in the force-induced reaction,suggesting the great potential of single-molecule conductance measurement and unsupervised clustering approaches for structural analysis.