期刊文献+
共找到155篇文章
< 1 2 8 >
每页显示 20 50 100
Equivalent Modeling with Passive Filter Parameter Clustering for Photovoltaic Power Stations Based on a Particle Swarm Optimization K-Means Algorithm
1
作者 Binjiang Hu Yihua Zhu +3 位作者 Liang Tu Zun Ma Xian Meng Kewei Xu 《Energy Engineering》 2026年第1期431-459,共29页
This paper proposes an equivalent modeling method for photovoltaic(PV)power stations via a particle swarm optimization(PSO)K-means clustering(KMC)algorithm with passive filter parameter clustering to address the compl... This paper proposes an equivalent modeling method for photovoltaic(PV)power stations via a particle swarm optimization(PSO)K-means clustering(KMC)algorithm with passive filter parameter clustering to address the complexities,simulation time cost and convergence problems of detailed PV power station models.First,the amplitude–frequency curves of different filter parameters are analyzed.Based on the results,a grouping parameter set for characterizing the external filter characteristics is established.These parameters are further defined as clustering parameters.A single PV inverter model is then established as a prerequisite foundation.The proposed equivalent method combines the global search capability of PSO with the rapid convergence of KMC,effectively overcoming the tendency of KMC to become trapped in local optima.This approach enhances both clustering accuracy and numerical stability when determining equivalence for PV inverter units.Using the proposed clustering method,both a detailed PV power station model and an equivalent model are developed and compared.Simulation and hardwarein-loop(HIL)results based on the equivalent model verify that the equivalent method accurately represents the dynamic characteristics of PVpower stations and adapts well to different operating conditions.The proposed equivalent modeling method provides an effective analysis tool for future renewable energy integration research. 展开更多
关键词 Photovoltaic power station multi-machine equivalentmodeling particle swarmoptimization K-means clustering algorithm
在线阅读 下载PDF
Optimized algorithm for balancing clusters in wireless sensor networks
2
作者 Mucheol KIM Sunhong KIM Hyungjin BYUN 《Journal of Zhejiang University-Science A(Applied Physics & Engineering)》 SCIE EI CAS CSCD 2009年第10期1404-1412,共9页
Wireless sensor networks consist of hundreds or thousands of sensor nodes that involve numerous restrictions in-cluding computation capability and battery capacity.Topology control is an important issue for achieving ... Wireless sensor networks consist of hundreds or thousands of sensor nodes that involve numerous restrictions in-cluding computation capability and battery capacity.Topology control is an important issue for achieving a balanced placement of sensor nodes.The clustering scheme is a widely known and efficient means of topology control for transmitting information to the base station in two hops.The automatic routing scheme of the self-organizing technique is another critical element of wireless sensor networks.In this paper we propose an optimal algorithm with cluster balance taken into consideration,and compare it with three well known and widely used approaches,i.e.,LEACH,MEER,and VAP-E,in performance evaluation.Experimental results show that the proposed approach increases the overall network lifetime,indicating that the amount of energy required for com-munication to the base station will be reduced for locating an optimal cluster. 展开更多
关键词 Wireless sensor networks Self-organizing sensor algorithm Clustering algorithm OPTIMIZATION
原文传递
Multifactor diagnostic model of converter energy consumption based on K-means algorithm and its application
3
作者 Fei-xiang Dai Guang Chen +3 位作者 Xiang-jun Bao Gong-guo Liu Lu Zhang Xiao-jing Yang 《Journal of Iron and Steel Research International》 2025年第8期2359-2369,共11页
To address the challenge of identifying the primary causes of energy consumption fluctuations and accurately assessing the influence of various factors in the converter unit of an iron and steel plant,the focus is pla... To address the challenge of identifying the primary causes of energy consumption fluctuations and accurately assessing the influence of various factors in the converter unit of an iron and steel plant,the focus is placed on the critical components of material and heat balance.Through a thorough analysis of the interactions between various components and energy consumptions,six pivotal factors have been identified—raw material composition,steel type,steel temperature,slag temperature,recycling practices,and operational parameters.Utilizing a framework based on an equivalent energy consumption model,an integrated intelligent diagnostic model has been developed that encapsulates these factors,providing a comprehensive assessment tool for converter energy consumption.Employing the K-means clustering algorithm,historical operational data from the converter have been meticulously analyzed to determine baseline values for essential variables such as energy consumption and recovery rates.Building upon this data-driven foundation,an innovative online system for the intelligent diagnosis of converter energy consumption has been crafted and implemented,enhancing the precision and efficiency of energy management.Upon implementation with energy consumption data at a steel plant in 2023,the diagnostic analysis performed by the system exposed significant variations in energy usage across different converter units.The analysis revealed that the most significant factor influencing the variation in energy consumption for both furnaces was the steel grade,with contributions of−0.550 and 0.379. 展开更多
关键词 Equivalent energy consumption model Intelligent diagnostic model K-means clustering algorithm Online system Energy management
原文传递
An Efficient Clustering Algorithm for Enhancing the Lifetime and Energy Efficiency of Wireless Sensor Networks
4
作者 Peng Zhou Wei Chen Bingyu Cao 《Computers, Materials & Continua》 2025年第9期5337-5360,共24页
Wireless Sensor Networks(WSNs),as a crucial component of the Internet of Things(IoT),are widely used in environmental monitoring,industrial control,and security surveillance.However,WSNs still face challenges such as ... Wireless Sensor Networks(WSNs),as a crucial component of the Internet of Things(IoT),are widely used in environmental monitoring,industrial control,and security surveillance.However,WSNs still face challenges such as inaccurate node clustering,low energy efficiency,and shortened network lifespan in practical deployments,which significantly limit their large-scale application.To address these issues,this paper proposes an Adaptive Chaotic Ant Colony Optimization algorithm(AC-ACO),aiming to optimize the energy utilization and system lifespan of WSNs.AC-ACO combines the path-planning capability of Ant Colony Optimization(ACO)with the dynamic characteristics of chaotic mapping and introduces an adaptive mechanism to enhance the algorithm’s flexibility and adaptability.By dynamically adjusting the pheromone evaporation factor and heuristic weights,efficient node clustering is achieved.Additionally,a chaotic mapping initialization strategy is employed to enhance population diversity and avoid premature convergence.To validate the algorithm’s performance,this paper compares AC-ACO with clustering methods such as Low-Energy Adaptive Clustering Hierarchy(LEACH),ACO,Particle Swarm Optimization(PSO),and Genetic Algorithm(GA).Simulation results demonstrate that AC-ACO outperforms the compared algorithms in key metrics such as energy consumption optimization,network lifetime extension,and communication delay reduction,providing an efficient solution for improving energy efficiency and ensuring long-term stable operation of wireless sensor networks. 展开更多
关键词 Internet of Things wireless sensor networks ant colony optimization clustering algorithm energy efficiency
在线阅读 下载PDF
Rock discontinuity extraction from 3D point clouds using pointwise clustering algorithm
5
作者 Xiaoyu Yi Wenxuan Wu +2 位作者 Wenkai Feng Yongjian Zhou Jiachen Zhao 《Journal of Rock Mechanics and Geotechnical Engineering》 2025年第7期4429-4444,共16页
Recognizing discontinuities within rock masses is a critical aspect of rock engineering.The development of remote sensing technologies has significantly enhanced the quality and quantity of the point clouds collected ... Recognizing discontinuities within rock masses is a critical aspect of rock engineering.The development of remote sensing technologies has significantly enhanced the quality and quantity of the point clouds collected from rock outcrops.In response,we propose a workflow that balances accuracy and efficiency to extract discontinuities from massive point clouds.The proposed method employs voxel filtering to downsample point clouds,constructs a point cloud topology using K-d trees,utilizes principal component analysis to calculate the point cloud normals,and employs the pointwise clustering(PWC)algorithm to extract discontinuities from rock outcrop point clouds.This method provides information on the location and orientation(dip direction and dip angle)of the discontinuities,and the modified whale optimization algorithm(MWOA)is utilized to identify major discontinuity sets and their average orientations.Performance evaluations based on three real cases demonstrate that the proposed method significantly reduces computational time costs without sacrificing accuracy.In particular,the method yields more reasonable extraction results for discontinuities with certain undulations.The presented approach offers a novel tool for efficiently extracting discontinuities from large-scale point clouds. 展开更多
关键词 Rock mass discontinuity 3D point clouds Pointwise clustering(PWC)algorithm Modified whale optimization algorithm(MWOA)
在线阅读 下载PDF
Flight Trajectory Option Set Generation Based on Clustering Algorithms
6
作者 WANG Shijin SUN Min +1 位作者 LI Yinglin YANG Baotian 《Transactions of Nanjing University of Aeronautics and Astronautics》 2025年第6期767-788,共22页
Addressing the issue that flight plans between Chinese city pairs typically rely on a single route,lacking alternative paths and posing challenges in responding to emergencies,this study employs the“quantile-inflecti... Addressing the issue that flight plans between Chinese city pairs typically rely on a single route,lacking alternative paths and posing challenges in responding to emergencies,this study employs the“quantile-inflection point method”to analyze specific deviation trajectories,determine deviation thresholds,and identify commonly used deviation paths.By combining multiple similarity metrics,including Euclidean distance,Hausdorff distance,and sector edit distance,with the density-based spatial clustering of applications with noise(DBSCAN)algorithm,the study clusters deviation trajectories to construct a multi-option trajectory set for city pairs.A case study of 23578 flight trajectories between the Guangzhou airport cluster and the Shanghai airport cluster demonstrates the effectiveness of the proposed framework.Experimental results show that sector edit distance achieves superior clustering performance compared to Euclidean and Hausdorff distances,with higher silhouette coefficients and lower Davies⁃Bouldin indices,ensuring better intra-cluster compactness and inter-cluster separation.Based on clustering results,19 representative trajectory options are identified,covering both nominal and deviation paths,which significantly enhance route diversity and reflect actual flight practices.This provides a practical basis for optimizing flight paths and scheduling,enhancing the flexibility of route selection for flights between city pairs. 展开更多
关键词 flight trajectory clustering trajectory option set sector edit distance density-based spatial clustering of applications with noise(DBSCAN)algorithm deviation trajectories
在线阅读 下载PDF
Clustering analysis algorithm for security supervising data based on semantic description in coal mines 被引量:1
7
作者 孟凡荣 周勇 夏士雄 《Journal of Southeast University(English Edition)》 EI CAS 2008年第3期354-357,共4页
In order to mine production and security information from security supervising data and to ensure security and safety involved in production and decision-making,a clustering analysis algorithm for security supervising... In order to mine production and security information from security supervising data and to ensure security and safety involved in production and decision-making,a clustering analysis algorithm for security supervising data based on a semantic description in coal mines is studied.First,the semantic and numerical-based hybrid description method of security supervising data in coal mines is described.Secondly,the similarity measurement method of semantic and numerical data are separately given and a weight-based hybrid similarity measurement method for the security supervising data based on a semantic description in coal mines is presented.Thirdly,taking the hybrid similarity measurement method as the distance criteria and using a grid methodology for reference,an improved CURE clustering algorithm based on the grid is presented.Finally,the simulation results of a security supervising data set in coal mines validate the efficiency of the algorithm. 展开更多
关键词 semantic description clustering analysis algorithm similarity measurement
在线阅读 下载PDF
Driving manipulation analysis and control reconfiguration of heavy-haul trains
8
作者 LI Zi-yi ZHOU Yan-li +2 位作者 YANG Hui YU Yong-sheng LI Guang-wei 《Journal of Central South University》 2026年第1期506-522,共17页
The safe driving and operation of trains is a necessary condition for ensuring the safe operation of trains.In particular,heavy-haul trains are characterized by the difficulty in driving and operation.Considering the ... The safe driving and operation of trains is a necessary condition for ensuring the safe operation of trains.In particular,heavy-haul trains are characterized by the difficulty in driving and operation.Considering the uncertainties in train driving and operation,this paper analyzes the relationship between the safety of heavy-haul electric locomotive hauled trains and driving and operation.It studies the auxiliary intelligent driving safety operation control methods.Through K-means to identify the characteristics of drivers'driving manipulation,the hidden Markov model adaptively adjusts the train driving and operation sequence,and conducts auxiliary driving reconstruction for heavy-haul locomotive driving and operation.Based on the train running curve and the locomotive traction/braking characteristics,it smoothly controls the exertion of the traction/braking force of heavy-haul locomotives,thereby optimizing the driving safety control of heavy-haul trains in the vehicle-environment-track system.Finally,the train operation simulation and optimized driving verification are carried out by simulating some track sections.The results show that the proposed method can correct and pre-optimize driving operations,improving the smoothness of heavy-haul trains by approximately 10%.It verifies the effectiveness of the proposed train assisted driving control reconstruction method,facilitating the smooth and safe operation of heavy-haul trains. 展开更多
关键词 heavy-haul trains driving manipulation K-means clustering algorithm hidden Markov model control reconfiguration
在线阅读 下载PDF
An efficient enhanced k-means clustering algorithm 被引量:30
9
作者 FAHIM A.M SALEM A.M +1 位作者 TORKEY F.A RAMADAN M.A 《Journal of Zhejiang University-Science A(Applied Physics & Engineering)》 SCIE EI CAS CSCD 2006年第10期1626-1633,共8页
In k-means clustering, we are given a set of n data points in d-dimensional space R^d and an integer k and the problem is to determine a set of k points in R^d, called centers, so as to minimize the mean squared dista... In k-means clustering, we are given a set of n data points in d-dimensional space R^d and an integer k and the problem is to determine a set of k points in R^d, called centers, so as to minimize the mean squared distance from each data point to its nearest center. In this paper, we present a simple and efficient clustering algorithm based on the k-means algorithm, which we call enhanced k-means algorithm. This algorithm is easy to implement, requiring a simple data structure to keep some information in each iteration to be used in the next iteration. Our experimental results demonstrated that our scheme can improve the computational speed of the k-means algorithm by the magnitude in the total number of distance calculations and the overall time of computation. 展开更多
关键词 Clustering algorithms Cluster analysis k-means algorithm Data analysis
在线阅读 下载PDF
Identification of Convective and Stratiform Clouds Based on the Improved DBSCAN Clustering Algorithm 被引量:6
10
作者 Yuanyuan ZUO Zhiqun HU +3 位作者 Shujie YUAN Jiafeng ZHENG Xiaoyan YIN Boyong LI 《Advances in Atmospheric Sciences》 SCIE CAS CSCD 2022年第12期2203-2212,共10页
A convective and stratiform cloud classification method for weather radar is proposed based on the density-based spatial clustering of applications with noise(DBSCAN)algorithm.To identify convective and stratiform clo... A convective and stratiform cloud classification method for weather radar is proposed based on the density-based spatial clustering of applications with noise(DBSCAN)algorithm.To identify convective and stratiform clouds in different developmental phases,two-dimensional(2D)and three-dimensional(3D)models are proposed by applying reflectivity factors at 0.5°and at 0.5°,1.5°,and 2.4°elevation angles,respectively.According to the thresholds of the algorithm,which include echo intensity,the echo top height of 35 dBZ(ET),density threshold,andεneighborhood,cloud clusters can be marked into four types:deep-convective cloud(DCC),shallow-convective cloud(SCC),hybrid convective-stratiform cloud(HCS),and stratiform cloud(SFC)types.Each cloud cluster type is further identified as a core area and boundary area,which can provide more abundant cloud structure information.The algorithm is verified using the volume scan data observed with new-generation S-band weather radars in Nanjing,Xuzhou,and Qingdao.The results show that cloud clusters can be intuitively identified as core and boundary points,which change in area continuously during the process of convective evolution,by the improved DBSCAN algorithm.Therefore,the occurrence and disappearance of convective weather can be estimated in advance by observing the changes of the classification.Because density thresholds are different and multiple elevations are utilized in the 3D model,the identified echo types and areas are dissimilar between the 2D and 3D models.The 3D model identifies larger convective and stratiform clouds than the 2D model.However,the developing convective clouds of small areas at lower heights cannot be identified with the 3D model because they are covered by thick stratiform clouds.In addition,the 3D model can avoid the influence of the melting layer and better suggest convective clouds in the developmental stage. 展开更多
关键词 improved DBSCAN clustering algorithm cloud identification and classification 2D model 3D model weather radar
在线阅读 下载PDF
Method of neural network modulation recognition based on clustering and Polak-Ribiere algorithm 被引量:4
11
作者 Faquan Yang Zan Li +2 位作者 Hongyan Li Haiyan Huang Zhongxian Pan 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2014年第5期742-747,共6页
To improve the recognition rate of signal modulation recognition methods based on the clustering algorithm under the low SNR, a modulation recognition method is proposed. The characteristic parameter of the signal is ... To improve the recognition rate of signal modulation recognition methods based on the clustering algorithm under the low SNR, a modulation recognition method is proposed. The characteristic parameter of the signal is extracted by using a clustering algorithm, the neural network is trained by using the algorithm of variable gradient correction (Polak-Ribiere) so as to enhance the rate of convergence, improve the performance of recognition under the low SNR and realize modulation recognition of the signal based on the modulation system of the constellation diagram. Simulation results show that the recognition rate based on this algorithm is enhanced over 30% compared with the methods that adopt clustering algorithm or neural network based on the back propagation algorithm alone under the low SNR. The recognition rate can reach 90% when the SNR is 4 dB, and the method is easy to be achieved so that it has a broad application prospect in the modulating recognition. 展开更多
关键词 clustering algorithm feature extraction algorithm of Polak-Ribiere neural network (NN) modulation recognition.
在线阅读 下载PDF
Spatial quality evaluation for drinking water based on GIS and ant colony clustering algorithm 被引量:4
12
作者 侯景伟 米文宝 李陇堂 《Journal of Central South University》 SCIE EI CAS 2014年第3期1051-1057,共7页
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. 展开更多
关键词 geographical information system (GIS) ant colony clustering algorithm (ACCA) quality evaluation drinking water spatial analysis
在线阅读 下载PDF
A Physical Layer Algorithm for Estimation of Number of Tags in UHF RFID Anti-Collision Design 被引量:5
13
作者 Zhong Huang Jian Su +4 位作者 Guangjun Wen Wenxian Zheng Chu Chu Yijun Zhang Yibo Zhang 《Computers, Materials & Continua》 SCIE EI 2019年第7期399-408,共10页
A priori knowledge of the number of tags is crucial for anti-collision protocols in slotted UHF RFID systems.The number of tags is used to decide optimal frame length in dynamic frame slotted ALOHA(DFSA)and to adjust ... A priori knowledge of the number of tags is crucial for anti-collision protocols in slotted UHF RFID systems.The number of tags is used to decide optimal frame length in dynamic frame slotted ALOHA(DFSA)and to adjust access probability in random access protocols.Conventional researches estimate the number of tags in MAC layer based on statistics of empty slots,collided slots and successful slots.Usually,a collision detection algorithm is employed to determine types of time slots.Only three types are distinguished because of lack of ability to detect the number of tags in single time slot.In this paper,a physical layer algorithm is proposed to detect the number of tags in a collided slot.Mean shift algorithm is utilized,and some properties of backscatter signals are investigated.Simulation results verify the effectiveness of the proposed solution in terms of low estimation error with a high SNR range,outperforming the existing MAC layer approaches. 展开更多
关键词 UHF RFID ANTI-COLLISION cluster algorithm
在线阅读 下载PDF
Wind power time series simulation model based on typical daily output processes and Markov algorithm 被引量:3
14
作者 Zhihui Cong Yuecong Yu +1 位作者 Linyan Li Jie Yan 《Global Energy Interconnection》 EI CAS CSCD 2022年第1期44-54,共11页
The simulation of wind power time series is a key process in renewable power allocation planning,operation mode calculation,and safety assessment.Traditional single-point modeling methods discretely generate wind powe... The simulation of wind power time series is a key process in renewable power allocation planning,operation mode calculation,and safety assessment.Traditional single-point modeling methods discretely generate wind power at each moment;however,they ignore the daily output characteristics and are unable to consider both modeling accuracy and efficiency.To resolve this problem,a wind power time series simulation model based on typical daily output processes and Markov algorithm is proposed.First,a typical daily output process classification method based on time series similarity and modified K-means clustering algorithm is presented.Second,considering the typical daily output processes as status variables,a wind power time series simulation model based on Markov algorithm is constructed.Finally,a case is analyzed based on the measured data of a wind farm in China.The proposed model is then compared with traditional methods to verify its effectiveness and applicability.The comparison results indicate that the statistical characteristics,probability distributions,and autocorrelation characteristics of the wind power time series generated by the proposed model are better than those of the traditional methods.Moreover,modeling efficiency considerably improves. 展开更多
关键词 Wind power Time series Typical daily output processes Markov algorithm Modified K-means clustering algorithm
在线阅读 下载PDF
A Nonuniform Clustering Routing Algorithm Based on an Improved K-Means Algorithm 被引量:4
15
作者 Xinliang Tang Man Zhang +3 位作者 Pingping Yu Wei Liu Ning Cao Yunfeng Xu 《Computers, Materials & Continua》 SCIE EI 2020年第9期1725-1739,共15页
In a large-scale wireless sensor network(WSN),densely distributed sensor nodes process a large amount of data.The aggregation of data in a network can consume a great amount of energy.To balance and reduce the energy ... In a large-scale wireless sensor network(WSN),densely distributed sensor nodes process a large amount of data.The aggregation of data in a network can consume a great amount of energy.To balance and reduce the energy consumption of nodes in a WSN and extend the network life,this paper proposes a nonuniform clustering routing algorithm based on the improved K-means algorithm.The algorithm uses a clustering method to form and optimize clusters,and it selects appropriate cluster heads to balance network energy consumption and extend the life cycle of the WSN.To ensure that the cluster head(CH)selection in the network is fair and that the location of the selected CH is not concentrated within a certain range,we chose the appropriate CH competition radius.Simulation results show that,compared with LEACH,LEACH-C,and the DEEC clustering algorithm,this algorithm can effectively balance the energy consumption of the CH and extend the network life. 展开更多
关键词 WSN node energy consumption nonuniform clustering routing algorithm
在线阅读 下载PDF
Background dominant colors extraction method based on color image quick fuzzy c-means clustering algorithm 被引量:2
16
作者 Zun-yang Liu Feng Ding +1 位作者 Ying Xu Xu Han 《Defence Technology(防务技术)》 SCIE EI CAS CSCD 2021年第5期1782-1790,共9页
A quick and accurate extraction of dominant colors of background images is the basis of adaptive camouflage design.This paper proposes a Color Image Quick Fuzzy C-Means(CIQFCM)clustering algorithm based on clustering ... A quick and accurate extraction of dominant colors of background images is the basis of adaptive camouflage design.This paper proposes a Color Image Quick Fuzzy C-Means(CIQFCM)clustering algorithm based on clustering spatial mapping.First,the clustering sample space was mapped from the image pixels to the quantized color space,and several methods were adopted to compress the amount of clustering samples.Then,an improved pedigree clustering algorithm was applied to obtain the initial class centers.Finally,CIQFCM clustering algorithm was used for quick extraction of dominant colors of background image.After theoretical analysis of the effect and efficiency of the CIQFCM algorithm,several experiments were carried out to discuss the selection of proper quantization intervals and to verify the effect and efficiency of the CIQFCM algorithm.The results indicated that the value of quantization intervals should be set to 4,and the proposed algorithm could improve the clustering efficiency while maintaining the clustering effect.In addition,as the image size increased from 128×128 to 1024×1024,the efficiency improvement of CIQFCM algorithm was increased from 6.44 times to 36.42 times,which demonstrated the significant advantage of CIQFCM algorithm in dominant colors extraction of large-size images. 展开更多
关键词 Dominant colors extraction Quick clustering algorithm Clustering spatial mapping Background image Camouflage design
在线阅读 下载PDF
Coupled Cross-correlation Neural Network Algorithm for Principal Singular Triplet Extraction of a Cross-covariance Matrix 被引量:2
17
作者 Xiaowei Feng Xiangyu Kong Hongguang Ma 《IEEE/CAA Journal of Automatica Sinica》 SCIE EI 2016年第2期149-156,共8页
This paper proposes a novel coupled neural network learning algorithm to extract the principal singular triplet (PST) of a cross-correlation matrix between two high-dimensional data streams. We firstly introduce a nov... This paper proposes a novel coupled neural network learning algorithm to extract the principal singular triplet (PST) of a cross-correlation matrix between two high-dimensional data streams. We firstly introduce a novel information criterion (NIC), in which the stationary points are singular triplet of the crosscorrelation matrix. Then, based on Newton's method, we obtain a coupled system of ordinary differential equations (ODEs) from the NIC. The ODEs have the same equilibria as the gradient of NIC, however, only the first PST of the system is stable (which is also the desired solution), and all others are (unstable) saddle points. Based on the system, we finally obtain a fast and stable algorithm for PST extraction. The proposed algorithm can solve the speed-stability problem that plagues most noncoupled learning rules. Moreover, the proposed algorithm can also be used to extract multiple PSTs effectively by using sequential method. © 2014 Chinese Association of Automation. 展开更多
关键词 Clustering algorithms Covariance matrix Data mining Differential equations EXTRACTION Learning algorithms Negative impedance converters Newton Raphson method Ordinary differential equations Singular value decomposition
在线阅读 下载PDF
MR-CLOPE: A Map Reduce based transactional clustering algorithm for DNS query log analysis 被引量:2
18
作者 李晔锋 乐嘉锦 +2 位作者 王梅 张滨 刘良旭 《Journal of Central South University》 SCIE EI CAS CSCD 2015年第9期3485-3494,共10页
DNS(domain name system) query log analysis has been a popular research topic in recent years. CLOPE, the represented transactional clustering algorithm, could be readily used for DNS query log mining. However, the alg... DNS(domain name system) query log analysis has been a popular research topic in recent years. CLOPE, the represented transactional clustering algorithm, could be readily used for DNS query log mining. However, the algorithm is inefficient when processing large scale data. The MR-CLOPE algorithm is proposed, which is an extension and improvement on CLOPE based on Map Reduce. Different from the previous parallel clustering method, a two-stage Map Reduce implementation framework is proposed. Each of the stage is implemented by one kind Map Reduce task. In the first stage, the DNS query logs are divided into multiple splits and the CLOPE algorithm is executed on each split. The second stage usually tends to iterate many times to merge the small clusters into bigger satisfactory ones. In these two stages, a novel partition process is designed to randomly spread out original sub clusters, which will be moved and merged in the map phrase of the second phase according to the defined merge criteria. In such way, the advantage of the original CLOPE algorithm is kept and its disadvantages are dealt with in the proposed framework to achieve more excellent clustering performance. The experiment results show that MR-CLOPE is not only faster but also has better clustering quality on DNS query logs compared with CLOPE. 展开更多
关键词 DNS data mining MR-CLOPE algorithm transactional clustering algorithm Map Reduce framework
在线阅读 下载PDF
Research of Improved Fuzzy c-means Algorithm Based on a New Metric Norm 被引量:2
19
作者 毛力 宋益春 +2 位作者 李引 杨弘 肖炜 《Journal of Shanghai Jiaotong university(Science)》 EI 2015年第1期51-55,共5页
For the question that fuzzy c-means(FCM)clustering algorithm has the disadvantages of being too sensitive to the initial cluster centers and easily trapped in local optima,this paper introduces a new metric norm in FC... For the question that fuzzy c-means(FCM)clustering algorithm has the disadvantages of being too sensitive to the initial cluster centers and easily trapped in local optima,this paper introduces a new metric norm in FCM and particle swarm optimization(PSO)clustering algorithm,and proposes a parallel optimization algorithm using an improved fuzzy c-means method combined with particle swarm optimization(AF-APSO).The experiment shows that the AF-APSO can avoid local optima,and get the best fitness and clustering performance significantly. 展开更多
关键词 fuzzy c-means(FCM) particle swarm optimization(PSO) clustering algorithm new metric norm
原文传递
SLID: A Secure Lowest-ID Clustering Algorithm 被引量:2
20
作者 HUGuang-ming HUANGZun-guo HUHua-ping GONGZheng-hu 《Wuhan University Journal of Natural Sciences》 CAS 2005年第1期39-42,共4页
In order to solve security problem of clustering algorithm, we proposed amethod to enhance the security of the well-known lowest-ID clustering algorithm. This method isbased on the idea of the secret sharing and the (... In order to solve security problem of clustering algorithm, we proposed amethod to enhance the security of the well-known lowest-ID clustering algorithm. This method isbased on the idea of the secret sharing and the (k, n) threshold cryptography, Each node, whetherclusterhead or ordinary member, holds a share of the global certificate, and any k nodes cancommunicate securely. There is no need for any clusterhead to execute extra functions more thanrouting. Our scheme needs some prior configuration before deployment, and can be used in criticalenvironment with small scale. The security-enhancement for Lowest-ID algorithm can also be appliedinto other clustering approaches with minor modification. The feasibility of this method wasverified bythe simulation results. 展开更多
关键词 clustering algorithm secret sharing threshold cryptography
在线阅读 下载PDF
上一页 1 2 8 下一页 到第
使用帮助 返回顶部