检索结果-内蒙古大学图书馆

2015 2nd International Conference on Civil,Materials and Environmental Sciences(CMES 2015)

作者： Xian Liang Fuheng Qu Yong Yang Hua Cai College of Computer Science and Technology Changchun University of Science and Technology College of electronic and information engineering Changchun University of Science and Technology

To improve clustering effects of fast global K-means and reduce time complexity, a highly efficient fast global K-means algorithm is proposed in this paper. Which, maximal point of density in data sets is chosen as the first initial clustering center, then finding the next initial clustering center, firstly we can exclude a certain number of clusters around the given clustering center,and narrow selection range of the next initial clustering center, further utilize the related theorem of triangle inequality,reduce computational amount,choose the sample which have great contribution in reducing error sum of squares and are apart from the given clustering center as the next initial clustering center, then the modified fast global K-means algorithm reassigns sample to cluster, which will collect sample to the weighted distance of cluster center,and partition the sample to cluster when weighted distance is minimum. The modified algorithm can select more reasonable initial cluster center, obtain more objective,true clustering results and shorten the clustering time. The experiment results shows the algorithm is valid.

关键词： clustering algorithm k-means global k-means fast global k-means

来源：评论

学校读者我要写书评

暂无评论

Efficient MST-based clustering with leader node selection and outlier edge cutting

引用

JOURNAL OF SUPERCOMPUTING 2024年第16期80卷 24358-24378页

作者： Yao, Yuzhuo Zheng, Yong Li, Wei Sichuan Normal Univ Coll Comp Sci Chengdu 610101 Sichuan Peoples R China Sichuan Normal Univ Visual Comp & Virtual Real Key Lab Sichuan Chengdu 610068 Sichuan Peoples R China

The clustering algorithm based on the minimum spanning tree (MST) can identify clusters of different shapes. However, the minimum spanning tree clustering algorithm has a high computational cost due to multiple rounds of traversing required during the construction and edge-breaking clustering phases. To address this issue, a density peak fusion idea is proposed, which utilizes kd-trees to obtain neighborhoods and designs leader nodes to propose an algorithm that reduces the time cost of the minimum spanning tree. The main idea of the algorithm is that nodes with higher density than surrounding nodes are used to replace the nodes participating in the formation of the minimum spanning tree. By using the selection technique of density peaks, the number of points required for initial construction and subsequent traversal of the minimum spanning tree is reduced, thereby reducing the complexity of the minimum spanning tree and achieving faster clustering speed. The algorithm has been tested on various synthetic and real datasets. It has achieved significant improvements in speed and clustering performance. Compared with the most advanced mst-based clustering algorithm, the algorithm has a speed increase of at least 30% and a performance increase of about 5%.

关键词： Minimum spanning tree clustering algorithm Leader nodes Reducing the complexity

来源：评论

学校读者我要写书评

暂无评论

Time series anomaly detection via clustering-based representation

引用

EVOLVING SYSTEMS 2024年第4期15卷 1115-1136页

作者： Enayati, Elham Mortazavi, Reza Basiri, Abdolali Ghasemian, Javad Moallem, Mahmoud Damghan Univ Sch Math & Comp Sci Damghan *** Iran Damghan Univ Sch Engn Damghan *** Iran

Time series anomaly detection is an important field of data science. Statistical, distance-based, clustering-based, or density-based approaches can detect anomalies. Generally, distance-based methods are relatively straightforward, but the method's effectiveness depends on how well they handle the distribution of data points. To address the challenge, a preprocessing step is used to convert the underlying time series into a more useful format. In this paper, a novel clustering-based representation of time series is proposed. This representation is then used to compute anomaly scores and detect anomalies. Experimental studies on synthetic and real datasets show that proposed method outperforms other methods by up to 75% for five standard performance metrics.

关键词： Anomaly detection Time series Representation method clustering algorithm

来源：评论

学校读者我要写书评

暂无评论

Multivariate time series clustering analysis of the Global Dietary Database to uncover patterns in dietary trends (1990-2018)

引用

PUBLIC HEALTH NUTRITION 2025年第1期28卷 e89-e89页

作者： Matousek, Adriano Leung, Tiffany H. Pang, Herbert Univ Cambridge Dept Publ Hlth & Primary Care Robinson Way Cambridge England Univ Hong Kong Li Ka Shing Fac Med Dept Med Hong Kong Peoples R China Genentech Inc PD Data Sci & Analyt 1 DNA Way South San Francisco CA 94080 USA Univ Hong Kong Li Ka Shing Fac Med Sch Publ Hlth Hong Kong Peoples R China Duke Univ Sch Med Dept Biostat & Bioinformat Durham NC 27705 USA

Objective: Understanding country-level nutrition intake is crucial to global nutritional policies that aim to reduce disparities and relevant disease burdens. Still, there are limited numbers of studies using clustering techniques to analyse the recent Global Dietary Database (GDD). This study aims to extend an existing multivariate time series (MTS) clustering algorithm to allow for greater customisability and provide the first cluster analysis of the GDD to explore temporal trends in country-level nutrition profiles (1990-2018).Design: Trends in sugar-sweetened beverage intake and nutritional deficiency were explored using the newly developed programme 'MTSclust'. Time series clustering algorithms are different from simple clustering approaches in their ability to appreciate temporal ***: Nutritional and demographical data from 176 countries were analysed from the ***: Population representative samples of the 176 in the ***: In a three-class test specific to the domain, the MTSclust programme achieved a mean accuracy of 715 % (adjusted Rand Index [ARI] = 0381) while the mean accuracy of a popular algorithm, DTWclust, was 58 % (ARI = 0224). The clustering of nutritional deficiency and sugar-sweetened beverage intake identified several common trends among countries and found that these did not change by demographics. MTS clustering demonstrated a global convergence towards a Western ***: While global nutrition trends are associated with geography, demographic variables such as sex and age are less influential to the trends of certain nutrition intake. The literature could be further supplemented by applying outcome-guided methods to explore how these trends link to disease burdens.

关键词： clustering algorithm Machine learning Time-series clustering Trend Global Dietary Database

来源：评论

学校读者我要写书评

暂无评论

Direct Spectral clustering With New Graph Learning for Better Fitting

引用

IEEE Transactions on Knowledge and Data Engineering 2025年第7期37卷 3991-4002页

作者： Kong, Lingyi Xue, Jingjing Nie, Feiping Li, Xuelong Xi’an710072 China Xidian University School of Telecommunications Engineering Xi’an710071 China Xi’an710072 China

Traditional spectral clustering methods struggle with scalability and robustness in large datasets due to their reliance on similarity matrices and EigenValue Decomposition. We introduce two innovative models: Rcut-based Coordinate Descent clustering (R-CDC) and Ncut-based Doubly Stochastic clustering (N-DSC). These models integrate graph construction and segmentation into a unified process optimized through the coordinate descent method, significantly enhancing clustering efficacy. A novel graph structure enhances robustness against noise and outliers, simplifying the clustering process and improving outcomes across diverse datasets. Our extensive experiments show that these models surpass existing spectral clustering techniques in managing large-scale data and complex structures. © 1989-2012 IEEE.

关键词： Optimization Linear Programming clustering algorithms Noise Accuracy Stochastic Processes Robustness Eigenvalues And Eigenfunctions Laplace Equations Heuristic algorithms Coordinate Descent Method clustering Graph Cut Machine Learning Spectral clustering Graph Learning Optimization Process clustering Method Similarity Matrix Graph Structure Graph Construction Coordinate Descent Traditional clustering Coordinate Descent Method Traditional clustering Methods Discretion Objective Function Computational Complexity clustering algorithm Unsupervised Learning Time Complexity Large Scale Datasets Lagrange Multiplier clustering Results Face Images Adjusted Rand Index Discrete Clusters Weak Connections Affinity Matrix Computational Complexity Reduction Regularization Parameter Graph Based clustering Graph Data

来源：评论

学校读者我要写书评

暂无评论

Remote supervised relationship extraction method of clustering for knowledge graph in aviation field

引用

INTELLIGENT SYSTEMS WITH APPLICATIONS 2024年 22卷

作者： Qu, Jiayi Wang, Jintao Zhao, Zuyi Chen, Xingguo Shenyang Aerosp Univ Sch Civil Aviat Coll Shenyang 110136 Peoples R China

In the process of building domain knowledge graph, the result of relationship extraction between entities is an important guarantee of the quality of the graph. Therefore, we propose a clustering method based on reinforcement learning for remote supervised relation extraction. For the relationship extraction of accident information in the aviation domain mapping, a clustering method combining local dense and global dissimilarity is proposed in combination with remote supervision, which can obtain a large amount of low-noise labeled data and reduce part of the wrong labeling and missing labeling due to the strong specialization in the aviation domain;meanwhile, reinforcement learning is introduced to denoise the negative instance noise in the positive sample data;Finally, we propose a two-attention segmentation (DAPCNN) relationship extraction model to mine deep semantic sentences. The experimental results show that in the civil aviation relationship extraction text constructed in this paper, the Micro_R, Micro_P and Micro_F1 values of the proposed relationship extraction method reach 83.41 %, 84.16 % and 83.96 %. In the open relationship extraction dataset DuIE, The Micro_R, Micro_P and Micro_F1 of the proposed method are up to 83.41 %, 93.58 % and 94.02 % respectively. Compared with the current advanced multi-instance and multi-label model, the proposed method can more accurately extract the relationship between aviation accident entities. At the same time, the performance of the open data set is also good, and has a certain universality.

关键词： Knowledge graph Relationship extraction clustering algorithm Reinforcement Learning

来源：评论

学校读者我要写书评

暂无评论

clustering-based genetic offspring generation using DBSCAN with correlation distance

引用

JOURNAL OF MEMBRANE COMPUTING 2024年 1-19页

作者： Li, Lianghao Mi, Haibo Li, Zhen Fu, Jun Natl Univ Def Technol Coll Informat & Commun Wuhan 430019 Hubei Peoples R China Natl Univ Def Technol State Key Lab Complex & Crit Software Environm Wuhan 430019 Hubei Peoples R China

Differ from traditional benchmarks, real-world multiobjective optimization problems (MOPs) often have complex variable interactions, leading to intricate Pareto sets (PSs) with rotated or nonlinear forms. Simulated binary crossover (SBX), a common genetic operator for MOPs, would suffer performance declines when dealing with such complex PSs. To address this, a clustering-based mating restriction strategy (CRSBX) was designed for MOPs with complex PSs. It works by dividing the parent population into clusters that are approximately linearly distributed and then applying rotation-based SBX (RSBX) in each cluster to handle linear but rotated PSs by incorporating rotational properties into SBX. The kernel of this method lies in the utilization of clustering techniques to partition the current population into linear segments, thereby facilitating the fitting of the linear local distribution of the PS with a complex shape. However, CRSBX is subject to a limitation that the spectral clustering it employs necessitates a manually predefined parameter for determining the number of clusters. The impact of cluster numbers on algorithm performance is significant, yet it is challenging to determine in real-world issues. To overcome this challenge, we have made three improvements to CRSBX. Firstly, we employed DBSCAN as the clustering method, allowing the algorithm to operate without the need to preset the number of clusters. Secondly, we integrate the decision space with the objective space for clustering, rather than clustering solely within the decision space. Lastly, we utilized correlation distance as the criterion for distance measurement in clustering. Through these modifications, we achieve a more rational clustering of the population without the prerequisite of predefining the number of clusters, and concurrently, diminish the sensitivity to parameter settings. According to the experimental results on three test suites, the proposed algorithm is superior to existing repre

关键词： Multiobjective optimization Intricate pareto set Offspring generation Mating restriction clustering algorithm

来源：评论

学校读者我要写书评

暂无评论

Research on Parallel Data Stream clustering algorithm based on Grid and Density

Research on Parallel Data Stream Clustering Algorithm based ...

引用

International Conference on Computer Science and Mechanical Automation

作者： Weihua HU Guoping WU Mingzhong CHENG Liang WU School of Computer Science and Technology Hang Zhou Dianzi University

ISBN: (纸本)9781467391672

With the emergence of big data and cloud computing, data stream arrives rapidly, large-scale and continuously, real-time data stream clustering analysis has become a hot topic in the study on the current data stream mining. Some existing data stream clustering algorithms cannot effectively deal with the high-dimensional data stream and are incompetent to find clusters of arbitrary shape in real-time, as well as the noise points could not be removed timely. To address these issues, this paper proposes PGDC-Stream, a algorithm based on grid and density for clustering data streams in a parallel distributed environment [4]. The algorithm adopts density threshold function to deal with the noise points and inspect and remove them periodically. It also can find clusters of arbitrary shape in large-scale data flow in real-time. The Map-Reduce framework is used for parallel cluster analysis of data streams.

关键词： Data stream mining clustering algorithm Grid and density Distributed Map-Reduce Parallel computing

来源：评论

学校读者我要写书评

暂无评论

Effective User Invitation Models for Online Survey Using clustering algorithm

Effective User Invitation Models for Online Survey Using Clu...

引用

2015 Fifth International Conference on Instrumentation and Measurement,Computer,Communication and Control (IMCCC2015)(第五届仪器测量、计算机通信与控制国际会议)

作者： Sen Shao Shaochun Wu Guobing Zou Liang Chen School of Computer Engineering and Science Shanghai University Shanghai 200444 China

ISBN: (纸本)9781467377249

With the continuous and rapid development of online questionnaire survey,the low response rate has plagued operating *** solve this problem,this paper proposed an effective user invitation model by our improved clustering algorithm,which analyzed large-scale historical user behavior characteristic data,including users' quality data,users' preferential data and users' similarity *** experiments with large-scale data from an online survey company have been conducted to validate the feasibility and effectiveness of our proposed *** results demonstrate that the questionnaire response rate is increased and our approach can be easily deployed in real-world online survey application for effective personalized survey recommendation.

关键词： online questionnaire survey clustering algorithm user invitation model response rate

来源：评论

学校读者我要写书评

暂无评论

Minimum distance clustering algorithm based on an improved differential evolution

引用

INTERNATIONAL JOURNAL OF SENSOR NETWORKS 2014年第1期15卷 1-10页

作者： Yin, Xiangyuan Ling, Zhihao Guan, Liping Liang, Feng E China Univ Sci & Technol Sch Informat Sci & Engn Shanghai 200237 Peoples R China Zhejiang Wanli Univ Fac Elect & Informat Engn Ningbo 315100 Zhejiang Peoples R China Zhejiang Wanli Univ Ningbo 315100 Zhejiang Peoples R China

The goals of wireless sensor networks (WSNs) are to sense and collect data and to transmit the information to a sink. Because the sensor nodes are typically battery powered, the main challenges in WSNs are to optimise the energy consumption and to prolong the network lifetime. This paper proposes a centralised clustering algorithm termed the minimum distance clustering algorithm that is based on an improved differential evolution (MD-IDE). The new algorithm combines the advantages of simulated annealing and differential evolution to determine the cluster heads (CHs) for minimising the communication distance of the WSN. Many simulation results demonstrate that the performance of MD-IDE outperforms other well-known protocols, including the low-energy adaptive clustering hierarchy (LEACH) and LEACH-C algorithms, in the aspects of reducing the communication distance of the WSN for reducing energy consumption.

关键词： clustering algorithm IDE improved differential evolution cluster head CH MD-IDE

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：