Finding clusters based on density represents a significant class of clustering algorithms.These methods can discover clusters of various shapes and sizes.The most studied algorithm in this class is theDensity-Based Sp...Finding clusters based on density represents a significant class of clustering algorithms.These methods can discover clusters of various shapes and sizes.The most studied algorithm in this class is theDensity-Based Spatial Clustering of Applications with Noise(DBSCAN).It identifies clusters by grouping the densely connected objects into one group and discarding the noise objects.It requires two input parameters:epsilon(fixed neighborhood radius)and MinPts(the lowest number of objects in epsilon).However,it can’t handle clusters of various densities since it uses a global value for epsilon.This article proposes an adaptation of the DBSCAN method so it can discover clusters of varied densities besides reducing the required number of input parameters to only one.Only user input in the proposed method is the MinPts.Epsilon on the other hand,is computed automatically based on statistical information of the dataset.The proposed method finds the core distance for each object in the dataset,takes the average of these distances as the first value of epsilon,and finds the clusters satisfying this density level.The remaining unclustered objects will be clustered using a new value of epsilon that equals the average core distances of unclustered objects.This process continues until all objects have been clustered or the remaining unclustered objects are less than 0.006 of the dataset’s size.The proposed method requires MinPts only as an input parameter because epsilon is computed from data.Benchmark datasets were used to evaluate the effectiveness of the proposed method that produced promising results.Practical experiments demonstrate that the outstanding ability of the proposed method to detect clusters of different densities even if there is no separation between them.The accuracy of the method ranges from 92%to 100%for the experimented datasets.展开更多
In recent years,there has been a concerted effort to improve anomaly detection tech-niques,particularly in the context of high-dimensional,distributed clinical data.Analysing patient data within clinical settings reve...In recent years,there has been a concerted effort to improve anomaly detection tech-niques,particularly in the context of high-dimensional,distributed clinical data.Analysing patient data within clinical settings reveals a pronounced focus on refining diagnostic accuracy,personalising treatment plans,and optimising resource allocation to enhance clinical outcomes.Nonetheless,this domain faces unique challenges,such as irregular data collection,inconsistent data quality,and patient-specific structural variations.This paper proposed a novel hybrid approach that integrates heuristic and stochastic methods for anomaly detection in patient clinical data to address these challenges.The strategy combines HPO-based optimal Density-Based Spatial Clustering of Applications with Noise for clustering patient exercise data,facilitating efficient anomaly identification.Subsequently,a stochastic method based on the Interquartile Range filters unreliable data points,ensuring that medical tools and professionals receive only the most pertinent and accurate information.The primary objective of this study is to equip healthcare pro-fessionals and researchers with a robust tool for managing extensive,high-dimensional clinical datasets,enabling effective isolation and removal of aberrant data points.Furthermore,a sophisticated regression model has been developed using Automated Machine Learning(AutoML)to assess the impact of the ensemble abnormal pattern detection approach.Various statistical error estimation techniques validate the efficacy of the hybrid approach alongside AutoML.Experimental results show that implementing this innovative hybrid model on patient rehabilitation data leads to a notable enhance-ment in AutoML performance,with an average improvement of 0.041 in the R2 score,surpassing the effectiveness of traditional regression models.展开更多
Cluster analysis is a crucial technique in unsupervised machine learning,pattern recognition,and data analysis.However,current clustering algorithms suffer from the need for manual determination of parameter values,lo...Cluster analysis is a crucial technique in unsupervised machine learning,pattern recognition,and data analysis.However,current clustering algorithms suffer from the need for manual determination of parameter values,low accuracy,and inconsistent performance concerning data size and structure.To address these challenges,a novel clustering algorithm called the fully automated density-based clustering method(FADBC)is proposed.The FADBC method consists of two stages:parameter selection and cluster extraction.In the first stage,a proposed method extracts optimal parameters for the dataset,including the epsilon size and a minimum number of points thresholds.These parameters are then used in a density-based technique to scan each point in the dataset and evaluate neighborhood densities to find clusters.The proposed method was evaluated on different benchmark datasets andmetrics,and the experimental results demonstrate its competitive performance without requiring manual inputs.The results show that the FADBC method outperforms well-known clustering methods such as the agglomerative hierarchical method,k-means,spectral clustering,DBSCAN,FCDCSD,Gaussian mixtures,and density-based spatial clustering methods.It can handle any kind of data set well and perform excellently.展开更多
We propose a new clustering algorithm that assists the researchers to quickly and accurately analyze data. We call this algorithm Combined Density-based and Constraint-based Algorithm (CDC). CDC consists of two phases...We propose a new clustering algorithm that assists the researchers to quickly and accurately analyze data. We call this algorithm Combined Density-based and Constraint-based Algorithm (CDC). CDC consists of two phases. In the first phase, CDC employs the idea of density-based clustering algorithm to split the original data into a number of fragmented clusters. At the same time, CDC cuts off the noises and outliers. In the second phase, CDC employs the concept of K-means clustering algorithm to select a greater cluster to be the center. Then, the greater cluster merges some smaller clusters which satisfy some constraint rules. Due to the merged clusters around the center cluster, the clustering results show high accuracy. Moreover, CDC reduces the calculations and speeds up the clustering process. In this paper, the accuracy of CDC is evaluated and compared with those of K-means, hierarchical clustering, and the genetic clustering algorithm (GCA) proposed in 2004. Experimental results show that CDC has better performance.展开更多
Clustering evolving data streams is important to be performed in a limited time with a reasonable quality. The existing micro clustering based methods do not consider the distribution of data points inside the micro c...Clustering evolving data streams is important to be performed in a limited time with a reasonable quality. The existing micro clustering based methods do not consider the distribution of data points inside the micro cluster. We propose LeaDen-Stream (Leader Density-based clustering algorithm over evolving data Stream), a density-based clustering algorithm using leader clustering. The algorithm is based on a two-phase clustering. The online phase selects the proper mini-micro or micro-cluster leaders based on the distribution of data points in the micro clusters. Then, the leader centers are sent to the offline phase to form final clusters. In LeaDen-Stream, by carefully choosing between two kinds of micro leaders, we decrease time complexity of the clustering while maintaining the cluster quality. A pruning strategy is also used to filter out real data from noise by introducing dense and sparse mini-micro and micro-cluster leaders. Our performance study over a number of real and synthetic data sets demonstrates the effectiveness and efficiency of our method.展开更多
City cluster is an effective platform for encouraging regionally coordinated development.Coordinated reduction of carbon emissions within city cluster via the spatial association network between cities can help coordi...City cluster is an effective platform for encouraging regionally coordinated development.Coordinated reduction of carbon emissions within city cluster via the spatial association network between cities can help coordinate the regional carbon emission management,realize sustainable development,and assist China in achieving the carbon peaking and carbon neutrality goals.This paper applies the improved gravity model and social network analysis(SNA)to the study of spatial correlation of carbon emissions in city clusters and analyzes the structural characteristics of the spatial correlation network of carbon emissions in the Yangtze River Delta(YRD)city cluster in China and its influencing factors.The results demonstrate that:1)the spatial association of carbon emissions in the YRD city cluster exhibits a typical and complex multi-threaded network structure.The network association number and density show an upward trend,indicating closer spatial association between cities,but their values remain generally low.Meanwhile,the network hierarchy and network efficiency show a downward trend but remain high.2)The spatial association network of carbon emissions in the YRD city cluster shows an obvious‘core-edge’distribution pattern.The network is centered around Shanghai,Suzhou and Wuxi,all of which play the role of‘bridges’,while cities such as Zhoushan,Ma'anshan,Tongling and other cities characterized by the remote location,single transportation mode or lower economic level are positioned at the edge of the network.3)Geographic proximity,varying levels of economic development,different industrial structures,degrees of urbanization,levels of technological innovation,energy intensities and environmental regulation are important influencing factors on the spatial association of within the YRD city cluster.Finally,policy implications are provided from four aspects:government macro-control and market mechanism guidance,structural characteristics of the‘core-edge’network,reconfiguration and optimization of the spatial layout of the YRD city cluster,and the application of advanced technologies.展开更多
This paper introduces techniques in Gaussian process regression model for spatiotemporal data collected from complex systems.This study focuses on extracting local structures and then constructing surrogate models bas...This paper introduces techniques in Gaussian process regression model for spatiotemporal data collected from complex systems.This study focuses on extracting local structures and then constructing surrogate models based on Gaussian process assumptions.The proposed Dynamic Gaussian Process Regression(DGPR)consists of a sequence of local surrogate models related to each other.In DGPR,the time-based spatial clustering is carried out to divide the systems into sub-spatio-temporal parts whose interior has similar variation patterns,where the temporal information is used as the prior information for training the spatial-surrogate model.The DGPR is robust and especially suitable for the loosely coupled model structure,also allowing for parallel computation.The numerical results of the test function show the effectiveness of DGPR.Furthermore,the shock tube problem is successfully approximated under different phenomenon complexity.展开更多
Clustering, in data mining, is a useful technique for discovering interesting data distributions and patterns in the underlying data, and has many application fields, such as statistical data analysis, pattern recogni...Clustering, in data mining, is a useful technique for discovering interesting data distributions and patterns in the underlying data, and has many application fields, such as statistical data analysis, pattern recognition, image processing, and etc. We combine sampling technique with DBSCAN algorithm to cluster large spatial databases, and two sampling based DBSCAN (SDBSCAN) algorithms are developed. One algorithm introduces sampling technique inside DBSCAN, and the other uses sampling procedure outside DBSCAN. Experimental results demonstrate that our algorithms are effective and efficient in clustering large scale spatial databases.展开更多
Spatial objects have two types of attributes： geometrical attributes and non-geometrical attributes, which belong to two different attribute domains （geometrical and non-geometrical domains）. Although geometrically...Spatial objects have two types of attributes： geometrical attributes and non-geometrical attributes, which belong to two different attribute domains （geometrical and non-geometrical domains）. Although geometrically scattered in a geometrical domain, spatial objects may be similar to each other in a non-geometrical domain. Most existing clustering algorithms group spatial datasets into different compact regions in a geometrical domain without considering the aspect of a non-geometrical domain. However, many application scenarios require clustering results in which a cluster has not only high proximity in a geometrical domain, but also high similarity in a non-geometrical domain. This means constraints are imposed on the clustering goal from both geometrical and non-geometrical domains simultaneously. Such a clustering problem is called dual clustering. As distributed clustering applications become more and more popular, it is necessary to tackle the dual clustering problem in distributed databases. The DCAD algorithm is proposed to solve this problem. DCAD consists of two levels of clustering： local clustering and global clustering. First, clustering is conducted at each local site with a local clustering algorithm, and the features of local clusters are extracted clustering is obtained based on those features fective and efficient. Second, local features from each site are sent to a central site where global Experiments on both artificial and real spatial datasets show that DCAD is effective and efficient.展开更多
Traditional spatial clustering methods have the disadvantage of ＂hardware division＂, and can not describe the physical characteristics of spatial entity effectively. In view of the above, this paper sets forth a gen...Traditional spatial clustering methods have the disadvantage of ＂hardware division＂, and can not describe the physical characteristics of spatial entity effectively. In view of the above, this paper sets forth a general multi-dimensional cloud model, which describes the characteristics of spatial objects more reasonably according to the idea of non-homogeneous and non-symmetry. Based on infrastructures＇ classification and demarcation in Zhanjiang, a detailed interpretation of clustering results is made from the spatial distribution of membership degree of clustering, the comparative study of Fuzzy C-means and a coupled analysis of residential land prices. General multi-dimensional cloud model reflects the integrated char- acteristics of spatial objects better, reveals the spatial distribution of potential information, and realizes spatial division more accurately in complex circumstances. However, due to the complexity of spatial interactions between geographical entities, the generation of cloud model is a specific and challenging task.展开更多
For the charging station construction of electric vehicle,location selecting is a key issue.There are two problems in location selection of the electric vehicle charging station.One is determining the location of char...For the charging station construction of electric vehicle,location selecting is a key issue.There are two problems in location selection of the electric vehicle charging station.One is determining the location of charging station;the other is evaluating the location of charging station.To determine the charging station location,an spatial clustering algorithm is proposed and programmed.The example simulation shows the effectiveness of the spatial clustering algorithm.To evaluate the charging station location,a multi-hierarchical fuzzy method is proposed.Based on the location factors of electric vehicle charging station,the hierarchical evaluation structure of electric vehicle charging station location is constructed,including three levels,4first-class factors and 14second-class factors.The fuzzy multi-hierarchical evaluation model and algorithm are built.The analysis results show that the multi-hierarchical fuzzy method can reasonably complete the electric vehicle charging station location evaluation.展开更多
To extract more in-depth information of acoustic emission(AE)signal-cloud in rock failure under triaxial compression,the spatial correlation of scattering AE events in a granite sample is effectively described by the ...To extract more in-depth information of acoustic emission(AE)signal-cloud in rock failure under triaxial compression,the spatial correlation of scattering AE events in a granite sample is effectively described by the cube-cluster model.First,the complete connection of the fracture network is regarded as a critical state.Then,according to the Hoshen-Kopelman(HK)algorithm,the real-time estimation of fracture con-nection is effectively made and a dichotomy between cube size and pore fraction is suggested to solve such a challenge of the one-to-one match between complete connection and cluster size.After,the 3D cube clusters are decomposed into orthogonal layer clusters,which are then transformed into the ellip-soid models.Correspondingly,the anisotropy evolution of fracture network could be visualized by three orthogonal ellipsoids and quantitatively described by aspect ratio.Besides,the other three quantities of centroid axis length,porosity,and fracture angle are analyzed to evaluate the evolution of cube cluster.The result shows the sample dilatancy is strongly correlated to four quantities of aspect ratio,centroid axis length,and porosity as well as fracture angle.Besides,the cube cluster model shows a potential pos-sibility to predict the evolution of fracture angle.So,the cube cluster model provides an in-depth view of spatial correlation to describe the AE signal-cloud.展开更多
Spatial clustering is widely used in many fields such as WSN (Wireless Sensor Networks), web clustering, remote sensing and so on for discovery groups and to identify interesting distributions in the underlying databa...Spatial clustering is widely used in many fields such as WSN (Wireless Sensor Networks), web clustering, remote sensing and so on for discovery groups and to identify interesting distributions in the underlying database. By discussing the relationships between the optimal clustering and the initial seeds, a clustering validity index and the principle of seeking initial seeds were proposed, and on this principle we recommend an initial seed-seeking strategy: SSPG (Single-Shortest-Path Graph). With SSPG strategy used in clustering algorithms, we find that the result of clustering is optimized with more probability. At the end of the paper, according to the combinational theory of optimization, a method is proposed to obtain optimal reference k value of cluster number, and is proven to be efficient.展开更多
To develop a better approach for spatial evaluation of drinking water quality, an intelligent evaluation method integrating a geographical information system(GIS) and an ant colony clustering algorithm(ACCA) was used....To develop a better approach for spatial evaluation of drinking water quality, an intelligent evaluation method integrating a geographical information system(GIS) and an ant colony clustering algorithm(ACCA) was used. Drinking water samples from 29 wells in Zhenping County, China, were collected and analyzed. 35 parameters on water quality were selected, such as chloride concentration, sulphate concentration, total hardness, nitrate concentration, fluoride concentration, turbidity, pH, chromium concentration, COD, bacterium amount, total coliforms and color. The best spatial interpolation methods for the 35 parameters were found and selected from all types of interpolation methods in GIS environment according to the minimum cross-validation errors. The ACCA was improved through three strategies, namely mixed distance function, average similitude degree and probability conversion functions. Then, the ACCA was carried out to obtain different water quality grades in the GIS environment. In the end, the result from the ACCA was compared with those from the competitive Hopfield neural network(CHNN) to validate the feasibility and effectiveness of the ACCA according to three evaluation indexes, which are stochastic sampling method, pixel amount and convergence speed. It is shown that the spatial water quality grades obtained from the ACCA were more effective, accurate and intelligent than those obtained from the CHNN.展开更多
Exploratory data analysis is increasingly more necessary as larger spatial data is managed in electro-magnetic media. Spatial clustering is one of the very important spatial data mining techniques which is the discove...Exploratory data analysis is increasingly more necessary as larger spatial data is managed in electro-magnetic media. Spatial clustering is one of the very important spatial data mining techniques which is the discovery of interesting rela-tionships and characteristics that may exist implicitly in spatial databases. So far, a lot of spatial clustering algorithms have been proposed in many applications such as pattern recognition, data analysis, and image processing and so forth. However most of the well-known clustering algorithms have some drawbacks which will be presented later when ap-plied in large spatial databases. To overcome these limitations, in this paper we propose a robust spatial clustering algorithm named NSCABDT (Novel Spatial Clustering Algorithm Based on Delaunay Triangulation). Delaunay dia-gram is used for determining neighborhoods based on the neighborhood notion, spatial association rules and colloca-tions being defined. NSCABDT demonstrates several important advantages over the previous works. Firstly, it even discovers arbitrary shape of cluster distribution. Secondly, in order to execute NSCABDT, we do not need to know any priori nature of distribution. Third, like DBSCAN, Experiments show that NSCABDT does not require so much CPU processing time. Finally it handles efficiently outliers.展开更多
This paper introduces some definitions and defines a set of calculating indexes to facilitate the research,and then presents an algorithm to complete the spatial clustering result comparison between different clusteri...This paper introduces some definitions and defines a set of calculating indexes to facilitate the research,and then presents an algorithm to complete the spatial clustering result comparison between different clustering themes.The research shows that some valuable spatial correlation patterns can be further found from the clustering result comparison with multi-themes,based on traditional spatial clustering as the first step.Those patterns can tell us what relations those themes have,and thus will help us have a deeper understanding of the studied spatial entities.An example is also given to demonstrate the principle and process of the method.展开更多
With the advancement in geospatial data acquisition technology, large sizes of digital data are being collected for our world. These include air- and space-borne imagery, LiDAR data, sonar data, terrestrial laser-scan...With the advancement in geospatial data acquisition technology, large sizes of digital data are being collected for our world. These include air- and space-borne imagery, LiDAR data, sonar data, terrestrial laser-scanning data, etc. LiDAR sensors generate huge datasets of point of multiple returns. Because of its large size, LiDAR data has costly storage and computational requirements. In this article, a LiDAR compression method based on spatial clustering and optimal filtering is presented. The method consists of classification and spatial clustering of the study area image and creation of the optimal planes in the LiDAR dataset through first-order plane-fitting. First-order plane-fitting is equivalent to the Eigen value problem of the covariance matrix. The Eigen value of the covariance matrix represents the spatial variation along the direction of the corresponding eigenvector. The eigenvector of the minimum Eigen value is the estimated normal vector of the surface formed by the LiDAR point and its neighbors. The ratio of the minimum Eigen value and the sum of the Eigen values approximates the change of local curvature, which determines the deviation of the surface formed by a LiDAR point and its neighbors from the tangential plane formed at that neighborhood. If the minimum Eigen value is close to zero for example, then the surface consisting of the point and its neighbors is a plane. The objective of this ongoing research work is basically to develop a LiDAR compression method that can be used in the future at the data acquisition phase to help remove fake returns and redundant points.展开更多
AIM:To investigate the spatial distribution patterns of anorectal atresia/stenosis in China.METHODS:Data were collected from the Chinese Birth Defects Monitoring Network(CBDMN),a hospital-based congenital malformation...AIM:To investigate the spatial distribution patterns of anorectal atresia/stenosis in China.METHODS:Data were collected from the Chinese Birth Defects Monitoring Network(CBDMN),a hospital-based congenital malformations registry system.All fetuses more than 28 wk of gestation and neonates up to 7 d of age in hospitals within the monitoring sites of the CBDMN were monitored from 2001 to 2005.Two-dimensional graph-theoretical clustering was used to divide monitoring sites of the CBDMN into different clusters according to the average incidences of anorectal atresia/stenosis in the different monitoring sites.RESULTS:The overall average incidence of anorectal atresia/stenosis in China was 3.17 per 10000 from 2001 to 2005.The areas with the highest average incidences of anorectal atresia/stenosis were almost always focused in Eastern China.The monitoring sites were grouped into 6 clusters of areas.Cluster 1 comprised the monitoring sites in Heilongjiang Province,Jilin Province,and Liaoning Province;Cluster 2 was composed of those in Fujian Province,Guangdong Province,Hainan Province,Guangxi Zhuang Autonomous Region,south Hunan Province,and south Jiangxi Province;Cluster 3 consisted of those in Beijing Municipal City,Tianjin Municipal City,Hebei Province,Shandong Province,north Jiangsu Province,and north Anhui Province;Cluster 4 was made up of those in Zhejiang Province,Shanghai Municipal City,south Anhui Province,south Jiangsu Province,north Hunan Province,north Jiangxi Province,Hubei Province,Henan Province,Shanxi Province and Inner Mongolia Autonomous Region;Cluster 5 consisted of those in Ningxia Hui Autonomous Region,Gansu Province and Qinghai Province;and Cluster 6 included those in Shaanxi Province,Sichuan Province,Chongqing Municipal City,Yunnan Province,Guizhou Province,Xinjiang Uygur Autonomous Province and Tibet Autonomous Region.CONCLUSION:The fi ndings in this research allow the display of the spatial distribution patterns of anorectal atresia/stenosis in China.These will have important guiding significance for further analysis of relevant environmental factors regarding anorectal atresia/ stenosis and for achieving regional monitoring for anorectal atresia/stenosis.展开更多
The differentiation of urban residential space is a key and hot topic in urban research, which has very important theoretical significance for urban development and residential choice. In this paper, web crawler techn...The differentiation of urban residential space is a key and hot topic in urban research, which has very important theoretical significance for urban development and residential choice. In this paper, web crawler technology is used to collect urban big data. Using spatial analysis and clustering, the differentiation law of residential space in the main urban area of Wuhan is revealed. The residential differentiation is divided into five types: "Garden" community, "Guozi" community, "Wangjiangshan" community, "Yashe" community, and "Shuxin" community. The "Garden" community is aimed at the elderly, with good medical accessibility and open space around the community. The "Guozi Community" is aimed at young people, and the community has accessibility to good educational and commercial facilities. The "Wangjiangshan" community is oriented towards the social elite group, with beautiful natural living environment, close to the city core, and convenient transportation. The "Yashe" community is aimed at the general income group, and its location is characterized by being adjacent to commercial districts and convenient transportation. The "Shuxin" community is aimed at the middle and lower income groups, far from the city center, and the living environment quality is not high.展开更多
This paper deals with the problem of piecewise auto regressive systems with exogenous input(PWARX) model identification based on clustering solution. This problem involves both the estimation of the parameters of the ...This paper deals with the problem of piecewise auto regressive systems with exogenous input(PWARX) model identification based on clustering solution. This problem involves both the estimation of the parameters of the affine sub-models and the hyper planes defining the partitions of the state-input regression. The existing identification methods present three main drawbacks which limit its effectiveness. First, most of them may converge to local minima in the case of poor initializations because they are based on the optimization using nonlinear criteria. Second, they use simple and ineffective techniques to remove outliers. Third, most of them assume that the number of sub-models is known a priori. To overcome these drawbacks, we suggest the use of the density-based spatial clustering of applications with noise(DBSCAN) algorithm. The results presented in this paper illustrate the performance of our methods in comparison with the existing approach. An application of the developed approach to an olive oil esterification reactor is also proposed in order to validate the simulation results.展开更多
基金The author extends his appreciation to theDeputyship forResearch&Innovation,Ministry of Education in Saudi Arabia for funding this research work through the project number(IFPSAU-2021/01/17758).
文摘Finding clusters based on density represents a significant class of clustering algorithms.These methods can discover clusters of various shapes and sizes.The most studied algorithm in this class is theDensity-Based Spatial Clustering of Applications with Noise(DBSCAN).It identifies clusters by grouping the densely connected objects into one group and discarding the noise objects.It requires two input parameters:epsilon(fixed neighborhood radius)and MinPts(the lowest number of objects in epsilon).However,it can’t handle clusters of various densities since it uses a global value for epsilon.This article proposes an adaptation of the DBSCAN method so it can discover clusters of varied densities besides reducing the required number of input parameters to only one.Only user input in the proposed method is the MinPts.Epsilon on the other hand,is computed automatically based on statistical information of the dataset.The proposed method finds the core distance for each object in the dataset,takes the average of these distances as the first value of epsilon,and finds the clusters satisfying this density level.The remaining unclustered objects will be clustered using a new value of epsilon that equals the average core distances of unclustered objects.This process continues until all objects have been clustered or the remaining unclustered objects are less than 0.006 of the dataset’s size.The proposed method requires MinPts only as an input parameter because epsilon is computed from data.Benchmark datasets were used to evaluate the effectiveness of the proposed method that produced promising results.Practical experiments demonstrate that the outstanding ability of the proposed method to detect clusters of different densities even if there is no separation between them.The accuracy of the method ranges from 92%to 100%for the experimented datasets.
文摘In recent years,there has been a concerted effort to improve anomaly detection tech-niques,particularly in the context of high-dimensional,distributed clinical data.Analysing patient data within clinical settings reveals a pronounced focus on refining diagnostic accuracy,personalising treatment plans,and optimising resource allocation to enhance clinical outcomes.Nonetheless,this domain faces unique challenges,such as irregular data collection,inconsistent data quality,and patient-specific structural variations.This paper proposed a novel hybrid approach that integrates heuristic and stochastic methods for anomaly detection in patient clinical data to address these challenges.The strategy combines HPO-based optimal Density-Based Spatial Clustering of Applications with Noise for clustering patient exercise data,facilitating efficient anomaly identification.Subsequently,a stochastic method based on the Interquartile Range filters unreliable data points,ensuring that medical tools and professionals receive only the most pertinent and accurate information.The primary objective of this study is to equip healthcare pro-fessionals and researchers with a robust tool for managing extensive,high-dimensional clinical datasets,enabling effective isolation and removal of aberrant data points.Furthermore,a sophisticated regression model has been developed using Automated Machine Learning(AutoML)to assess the impact of the ensemble abnormal pattern detection approach.Various statistical error estimation techniques validate the efficacy of the hybrid approach alongside AutoML.Experimental results show that implementing this innovative hybrid model on patient rehabilitation data leads to a notable enhance-ment in AutoML performance,with an average improvement of 0.041 in the R2 score,surpassing the effectiveness of traditional regression models.
基金the Deanship of Scientific Research at Umm Al-Qura University,Grant Code:(23UQU4361009DSR001).
文摘Cluster analysis is a crucial technique in unsupervised machine learning,pattern recognition,and data analysis.However,current clustering algorithms suffer from the need for manual determination of parameter values,low accuracy,and inconsistent performance concerning data size and structure.To address these challenges,a novel clustering algorithm called the fully automated density-based clustering method(FADBC)is proposed.The FADBC method consists of two stages:parameter selection and cluster extraction.In the first stage,a proposed method extracts optimal parameters for the dataset,including the epsilon size and a minimum number of points thresholds.These parameters are then used in a density-based technique to scan each point in the dataset and evaluate neighborhood densities to find clusters.The proposed method was evaluated on different benchmark datasets andmetrics,and the experimental results demonstrate its competitive performance without requiring manual inputs.The results show that the FADBC method outperforms well-known clustering methods such as the agglomerative hierarchical method,k-means,spectral clustering,DBSCAN,FCDCSD,Gaussian mixtures,and density-based spatial clustering methods.It can handle any kind of data set well and perform excellently.
文摘We propose a new clustering algorithm that assists the researchers to quickly and accurately analyze data. We call this algorithm Combined Density-based and Constraint-based Algorithm (CDC). CDC consists of two phases. In the first phase, CDC employs the idea of density-based clustering algorithm to split the original data into a number of fragmented clusters. At the same time, CDC cuts off the noises and outliers. In the second phase, CDC employs the concept of K-means clustering algorithm to select a greater cluster to be the center. Then, the greater cluster merges some smaller clusters which satisfy some constraint rules. Due to the merged clusters around the center cluster, the clustering results show high accuracy. Moreover, CDC reduces the calculations and speeds up the clustering process. In this paper, the accuracy of CDC is evaluated and compared with those of K-means, hierarchical clustering, and the genetic clustering algorithm (GCA) proposed in 2004. Experimental results show that CDC has better performance.
文摘Clustering evolving data streams is important to be performed in a limited time with a reasonable quality. The existing micro clustering based methods do not consider the distribution of data points inside the micro cluster. We propose LeaDen-Stream (Leader Density-based clustering algorithm over evolving data Stream), a density-based clustering algorithm using leader clustering. The algorithm is based on a two-phase clustering. The online phase selects the proper mini-micro or micro-cluster leaders based on the distribution of data points in the micro clusters. Then, the leader centers are sent to the offline phase to form final clusters. In LeaDen-Stream, by carefully choosing between two kinds of micro leaders, we decrease time complexity of the clustering while maintaining the cluster quality. A pruning strategy is also used to filter out real data from noise by introducing dense and sparse mini-micro and micro-cluster leaders. Our performance study over a number of real and synthetic data sets demonstrates the effectiveness and efficiency of our method.
基金Under the auspices of the National Natural Science Foundation of China (No.72273151)。
文摘City cluster is an effective platform for encouraging regionally coordinated development.Coordinated reduction of carbon emissions within city cluster via the spatial association network between cities can help coordinate the regional carbon emission management,realize sustainable development,and assist China in achieving the carbon peaking and carbon neutrality goals.This paper applies the improved gravity model and social network analysis(SNA)to the study of spatial correlation of carbon emissions in city clusters and analyzes the structural characteristics of the spatial correlation network of carbon emissions in the Yangtze River Delta(YRD)city cluster in China and its influencing factors.The results demonstrate that:1)the spatial association of carbon emissions in the YRD city cluster exhibits a typical and complex multi-threaded network structure.The network association number and density show an upward trend,indicating closer spatial association between cities,but their values remain generally low.Meanwhile,the network hierarchy and network efficiency show a downward trend but remain high.2)The spatial association network of carbon emissions in the YRD city cluster shows an obvious‘core-edge’distribution pattern.The network is centered around Shanghai,Suzhou and Wuxi,all of which play the role of‘bridges’,while cities such as Zhoushan,Ma'anshan,Tongling and other cities characterized by the remote location,single transportation mode or lower economic level are positioned at the edge of the network.3)Geographic proximity,varying levels of economic development,different industrial structures,degrees of urbanization,levels of technological innovation,energy intensities and environmental regulation are important influencing factors on the spatial association of within the YRD city cluster.Finally,policy implications are provided from four aspects:government macro-control and market mechanism guidance,structural characteristics of the‘core-edge’network,reconfiguration and optimization of the spatial layout of the YRD city cluster,and the application of advanced technologies.
基金co-supported by the National Natural Science Foundation of China(No.12101608)the NSAF(No.U2230208)the Hunan Provincial Innovation Foundation for Postgraduate,China(No.CX20220034).
文摘This paper introduces techniques in Gaussian process regression model for spatiotemporal data collected from complex systems.This study focuses on extracting local structures and then constructing surrogate models based on Gaussian process assumptions.The proposed Dynamic Gaussian Process Regression(DGPR)consists of a sequence of local surrogate models related to each other.In DGPR,the time-based spatial clustering is carried out to divide the systems into sub-spatio-temporal parts whose interior has similar variation patterns,where the temporal information is used as the prior information for training the spatial-surrogate model.The DGPR is robust and especially suitable for the loosely coupled model structure,also allowing for parallel computation.The numerical results of the test function show the effectiveness of DGPR.Furthermore,the shock tube problem is successfully approximated under different phenomenon complexity.
基金Supported by the Open Researches Fund Program of L IESMARS(WKL(0 0 ) 0 30 2 )
文摘Clustering, in data mining, is a useful technique for discovering interesting data distributions and patterns in the underlying data, and has many application fields, such as statistical data analysis, pattern recognition, image processing, and etc. We combine sampling technique with DBSCAN algorithm to cluster large spatial databases, and two sampling based DBSCAN (SDBSCAN) algorithms are developed. One algorithm introduces sampling technique inside DBSCAN, and the other uses sampling procedure outside DBSCAN. Experimental results demonstrate that our algorithms are effective and efficient in clustering large scale spatial databases.
基金Funded by the National 973 Program of China (No.2003CB415205)the National Natural Science Foundation of China (No.40523005, No.60573183, No.60373019)the Open Research Fund Program of LIESMARS (No.WKL(04)0303).
文摘Spatial objects have two types of attributes： geometrical attributes and non-geometrical attributes, which belong to two different attribute domains （geometrical and non-geometrical domains）. Although geometrically scattered in a geometrical domain, spatial objects may be similar to each other in a non-geometrical domain. Most existing clustering algorithms group spatial datasets into different compact regions in a geometrical domain without considering the aspect of a non-geometrical domain. However, many application scenarios require clustering results in which a cluster has not only high proximity in a geometrical domain, but also high similarity in a non-geometrical domain. This means constraints are imposed on the clustering goal from both geometrical and non-geometrical domains simultaneously. Such a clustering problem is called dual clustering. As distributed clustering applications become more and more popular, it is necessary to tackle the dual clustering problem in distributed databases. The DCAD algorithm is proposed to solve this problem. DCAD consists of two levels of clustering： local clustering and global clustering. First, clustering is conducted at each local site with a local clustering algorithm, and the features of local clusters are extracted clustering is obtained based on those features fective and efficient. Second, local features from each site are sent to a central site where global Experiments on both artificial and real spatial datasets show that DCAD is effective and efficient.
基金National Natural Science Foundation of China, N0.40971102 Knowledge Innovation Project of the Chinese Academy of Sciences, No. KZCX2-YW-322 Special Grant for Postgraduates＇ Scientific Innovation and So- cial Practice in 2008
文摘Traditional spatial clustering methods have the disadvantage of ＂hardware division＂, and can not describe the physical characteristics of spatial entity effectively. In view of the above, this paper sets forth a general multi-dimensional cloud model, which describes the characteristics of spatial objects more reasonably according to the idea of non-homogeneous and non-symmetry. Based on infrastructures＇ classification and demarcation in Zhanjiang, a detailed interpretation of clustering results is made from the spatial distribution of membership degree of clustering, the comparative study of Fuzzy C-means and a coupled analysis of residential land prices. General multi-dimensional cloud model reflects the integrated char- acteristics of spatial objects better, reveals the spatial distribution of potential information, and realizes spatial division more accurately in complex circumstances. However, due to the complexity of spatial interactions between geographical entities, the generation of cloud model is a specific and challenging task.
基金supported by the National Natural Science Foundation of China(No.51575047)
文摘For the charging station construction of electric vehicle,location selecting is a key issue.There are two problems in location selection of the electric vehicle charging station.One is determining the location of charging station;the other is evaluating the location of charging station.To determine the charging station location,an spatial clustering algorithm is proposed and programmed.The example simulation shows the effectiveness of the spatial clustering algorithm.To evaluate the charging station location,a multi-hierarchical fuzzy method is proposed.Based on the location factors of electric vehicle charging station,the hierarchical evaluation structure of electric vehicle charging station location is constructed,including three levels,4first-class factors and 14second-class factors.The fuzzy multi-hierarchical evaluation model and algorithm are built.The analysis results show that the multi-hierarchical fuzzy method can reasonably complete the electric vehicle charging station location evaluation.
基金This study was sponsored by the National Natural Science Foundation of China(No.51504257)the State Key Research Development Program of China(No.2016YFC0600704)+1 种基金the Fundamental Research Funds for the Central Universities(Yueqi Outstanding Scholars)(No.2018B051616,2021JCCXLJ01,2021YJSLJ06)the Open Fund of the State Key Laboratory of Coal Mine Disaster Dynamics and Control(No.2011DA105287-FW201604).
文摘To extract more in-depth information of acoustic emission(AE)signal-cloud in rock failure under triaxial compression,the spatial correlation of scattering AE events in a granite sample is effectively described by the cube-cluster model.First,the complete connection of the fracture network is regarded as a critical state.Then,according to the Hoshen-Kopelman(HK)algorithm,the real-time estimation of fracture con-nection is effectively made and a dichotomy between cube size and pore fraction is suggested to solve such a challenge of the one-to-one match between complete connection and cluster size.After,the 3D cube clusters are decomposed into orthogonal layer clusters,which are then transformed into the ellip-soid models.Correspondingly,the anisotropy evolution of fracture network could be visualized by three orthogonal ellipsoids and quantitatively described by aspect ratio.Besides,the other three quantities of centroid axis length,porosity,and fracture angle are analyzed to evaluate the evolution of cube cluster.The result shows the sample dilatancy is strongly correlated to four quantities of aspect ratio,centroid axis length,and porosity as well as fracture angle.Besides,the cube cluster model shows a potential pos-sibility to predict the evolution of fracture angle.So,the cube cluster model provides an in-depth view of spatial correlation to describe the AE signal-cloud.
基金Supported by the National Natural Science Foundation of China （No.60502028, No. 90204008）.
文摘Spatial clustering is widely used in many fields such as WSN (Wireless Sensor Networks), web clustering, remote sensing and so on for discovery groups and to identify interesting distributions in the underlying database. By discussing the relationships between the optimal clustering and the initial seeds, a clustering validity index and the principle of seeking initial seeds were proposed, and on this principle we recommend an initial seed-seeking strategy: SSPG (Single-Shortest-Path Graph). With SSPG strategy used in clustering algorithms, we find that the result of clustering is optimized with more probability. At the end of the paper, according to the combinational theory of optimization, a method is proposed to obtain optimal reference k value of cluster number, and is proven to be efficient.
基金Projects(41161020,41261026) supported by the National Natural Science Foundation of ChinaProject(BQD2012013) supported by the Research starting Funds for Imported Talents,Ningxia University,China+1 种基金Project(ZR1209) supported by the Natural Science Funds,Ningxia University,ChinaProject(NGY2013005) supported by the Key Science Project of Colleges and Universities in Ningxia,China
文摘To develop a better approach for spatial evaluation of drinking water quality, an intelligent evaluation method integrating a geographical information system(GIS) and an ant colony clustering algorithm(ACCA) was used. Drinking water samples from 29 wells in Zhenping County, China, were collected and analyzed. 35 parameters on water quality were selected, such as chloride concentration, sulphate concentration, total hardness, nitrate concentration, fluoride concentration, turbidity, pH, chromium concentration, COD, bacterium amount, total coliforms and color. The best spatial interpolation methods for the 35 parameters were found and selected from all types of interpolation methods in GIS environment according to the minimum cross-validation errors. The ACCA was improved through three strategies, namely mixed distance function, average similitude degree and probability conversion functions. Then, the ACCA was carried out to obtain different water quality grades in the GIS environment. In the end, the result from the ACCA was compared with those from the competitive Hopfield neural network(CHNN) to validate the feasibility and effectiveness of the ACCA according to three evaluation indexes, which are stochastic sampling method, pixel amount and convergence speed. It is shown that the spatial water quality grades obtained from the ACCA were more effective, accurate and intelligent than those obtained from the CHNN.
文摘Exploratory data analysis is increasingly more necessary as larger spatial data is managed in electro-magnetic media. Spatial clustering is one of the very important spatial data mining techniques which is the discovery of interesting rela-tionships and characteristics that may exist implicitly in spatial databases. So far, a lot of spatial clustering algorithms have been proposed in many applications such as pattern recognition, data analysis, and image processing and so forth. However most of the well-known clustering algorithms have some drawbacks which will be presented later when ap-plied in large spatial databases. To overcome these limitations, in this paper we propose a robust spatial clustering algorithm named NSCABDT (Novel Spatial Clustering Algorithm Based on Delaunay Triangulation). Delaunay dia-gram is used for determining neighborhoods based on the neighborhood notion, spatial association rules and colloca-tions being defined. NSCABDT demonstrates several important advantages over the previous works. Firstly, it even discovers arbitrary shape of cluster distribution. Secondly, in order to execute NSCABDT, we do not need to know any priori nature of distribution. Third, like DBSCAN, Experiments show that NSCABDT does not require so much CPU processing time. Finally it handles efficiently outliers.
文摘This paper introduces some definitions and defines a set of calculating indexes to facilitate the research,and then presents an algorithm to complete the spatial clustering result comparison between different clustering themes.The research shows that some valuable spatial correlation patterns can be further found from the clustering result comparison with multi-themes,based on traditional spatial clustering as the first step.Those patterns can tell us what relations those themes have,and thus will help us have a deeper understanding of the studied spatial entities.An example is also given to demonstrate the principle and process of the method.
文摘With the advancement in geospatial data acquisition technology, large sizes of digital data are being collected for our world. These include air- and space-borne imagery, LiDAR data, sonar data, terrestrial laser-scanning data, etc. LiDAR sensors generate huge datasets of point of multiple returns. Because of its large size, LiDAR data has costly storage and computational requirements. In this article, a LiDAR compression method based on spatial clustering and optimal filtering is presented. The method consists of classification and spatial clustering of the study area image and creation of the optimal planes in the LiDAR dataset through first-order plane-fitting. First-order plane-fitting is equivalent to the Eigen value problem of the covariance matrix. The Eigen value of the covariance matrix represents the spatial variation along the direction of the corresponding eigenvector. The eigenvector of the minimum Eigen value is the estimated normal vector of the surface formed by the LiDAR point and its neighbors. The ratio of the minimum Eigen value and the sum of the Eigen values approximates the change of local curvature, which determines the deviation of the surface formed by a LiDAR point and its neighbors from the tangential plane formed at that neighborhood. If the minimum Eigen value is close to zero for example, then the surface consisting of the point and its neighbors is a plane. The objective of this ongoing research work is basically to develop a LiDAR compression method that can be used in the future at the data acquisition phase to help remove fake returns and redundant points.
基金Supported by The National Science & Technology Pillar Program during the Eleventh Five-year Plan Period, Grant No. 2006BAI05A01
文摘AIM:To investigate the spatial distribution patterns of anorectal atresia/stenosis in China.METHODS:Data were collected from the Chinese Birth Defects Monitoring Network(CBDMN),a hospital-based congenital malformations registry system.All fetuses more than 28 wk of gestation and neonates up to 7 d of age in hospitals within the monitoring sites of the CBDMN were monitored from 2001 to 2005.Two-dimensional graph-theoretical clustering was used to divide monitoring sites of the CBDMN into different clusters according to the average incidences of anorectal atresia/stenosis in the different monitoring sites.RESULTS:The overall average incidence of anorectal atresia/stenosis in China was 3.17 per 10000 from 2001 to 2005.The areas with the highest average incidences of anorectal atresia/stenosis were almost always focused in Eastern China.The monitoring sites were grouped into 6 clusters of areas.Cluster 1 comprised the monitoring sites in Heilongjiang Province,Jilin Province,and Liaoning Province;Cluster 2 was composed of those in Fujian Province,Guangdong Province,Hainan Province,Guangxi Zhuang Autonomous Region,south Hunan Province,and south Jiangxi Province;Cluster 3 consisted of those in Beijing Municipal City,Tianjin Municipal City,Hebei Province,Shandong Province,north Jiangsu Province,and north Anhui Province;Cluster 4 was made up of those in Zhejiang Province,Shanghai Municipal City,south Anhui Province,south Jiangsu Province,north Hunan Province,north Jiangxi Province,Hubei Province,Henan Province,Shanxi Province and Inner Mongolia Autonomous Region;Cluster 5 consisted of those in Ningxia Hui Autonomous Region,Gansu Province and Qinghai Province;and Cluster 6 included those in Shaanxi Province,Sichuan Province,Chongqing Municipal City,Yunnan Province,Guizhou Province,Xinjiang Uygur Autonomous Province and Tibet Autonomous Region.CONCLUSION:The fi ndings in this research allow the display of the spatial distribution patterns of anorectal atresia/stenosis in China.These will have important guiding significance for further analysis of relevant environmental factors regarding anorectal atresia/ stenosis and for achieving regional monitoring for anorectal atresia/stenosis.
文摘The differentiation of urban residential space is a key and hot topic in urban research, which has very important theoretical significance for urban development and residential choice. In this paper, web crawler technology is used to collect urban big data. Using spatial analysis and clustering, the differentiation law of residential space in the main urban area of Wuhan is revealed. The residential differentiation is divided into five types: "Garden" community, "Guozi" community, "Wangjiangshan" community, "Yashe" community, and "Shuxin" community. The "Garden" community is aimed at the elderly, with good medical accessibility and open space around the community. The "Guozi Community" is aimed at young people, and the community has accessibility to good educational and commercial facilities. The "Wangjiangshan" community is oriented towards the social elite group, with beautiful natural living environment, close to the city core, and convenient transportation. The "Yashe" community is aimed at the general income group, and its location is characterized by being adjacent to commercial districts and convenient transportation. The "Shuxin" community is aimed at the middle and lower income groups, far from the city center, and the living environment quality is not high.
文摘This paper deals with the problem of piecewise auto regressive systems with exogenous input(PWARX) model identification based on clustering solution. This problem involves both the estimation of the parameters of the affine sub-models and the hyper planes defining the partitions of the state-input regression. The existing identification methods present three main drawbacks which limit its effectiveness. First, most of them may converge to local minima in the case of poor initializations because they are based on the optimization using nonlinear criteria. Second, they use simple and ineffective techniques to remove outliers. Third, most of them assume that the number of sub-models is known a priori. To overcome these drawbacks, we suggest the use of the density-based spatial clustering of applications with noise(DBSCAN) algorithm. The results presented in this paper illustrate the performance of our methods in comparison with the existing approach. An application of the developed approach to an olive oil esterification reactor is also proposed in order to validate the simulation results.
