Density Clustering Algorithm Based on KD-Tree and Voting Rules

Traditional clustering algorithms often struggle to produce satisfactory results when dealing with datasets withuneven density. Additionally, they incur substantial computational costs when applied to high-dimensional datadue to calculating similarity matrices. To alleviate these issues, we employ the KD-Tree to partition the dataset andcompute the K-nearest neighbors (KNN) density for each point, thereby avoiding the computation of similaritymatrices. Moreover, we apply the rules of voting elections, treating each data point as a voter and casting a votefor the point with the highest density among its KNN. By utilizing the vote counts of each point, we develop thestrategy for classifying noise points and potential cluster centers, allowing the algorithm to identify clusters withuneven density and complex shapes. Additionally, we define the concept of “adhesive points” between two clustersto merge adjacent clusters that have similar densities. This process helps us identify the optimal number of clustersautomatically. Experimental results indicate that our algorithm not only improves the efficiency of clustering butalso increases its accuracy.

Novel traveling quantum anonymous voting scheme via GHZ states

Based on traveling ballot mode,we propose a secure quantum anonymous voting via Greenberger–Horne–Zeilinger(GHZ)states.In this scheme,each legal voter performs unitary operation on corresponding position of particle sequence to encode his/her voting content.The voters have multiple ballot items to choose rather than just binary options“yes”or“no”.After counting votes phase,any participant who is interested in voting results can obtain the voting results.To improve the efficiency of the traveling quantum anonymous voting scheme,an optimization method based on grouping strategy is also presented.Compared with the most existing traveling quantum voting schemes,the proposed scheme is more practical because of its privacy,verifiability and non-repeatability.Furthermore,the security analysis shows that the proposed traveling quantum anonymous voting scheme can prevent various attacks and ensure high security.

Maximizing Influence in Temporal Social Networks:A Node Feature-Aware Voting Algorithm

Influence Maximization(IM)aims to select a seed set of size k in a social network so that information can be spread most widely under a specific information propagation model through this set of nodes.However,most existing studies on the IM problem focus on static social network features,while neglecting the features of temporal social networks.To bridge this gap,we focus on node features reflected by their historical interaction behavior in temporal social networks,i.e.,interaction attributes and self-similarity,and incorporate them into the influence maximization algorithm and information propagation model.Firstly,we propose a node feature-aware voting algorithm,called ISVoteRank,for seed nodes selection.Specifically,before voting,the algorithm sets the initial voting ability of nodes in a personalized manner by combining their features.During the voting process,voting weights are set based on the interaction strength between nodes,allowing nodes to vote at different extents and subsequently weakening their voting ability accordingly.The process concludes by selecting the top k nodes with the highest voting scores as seeds,avoiding the inefficiency of iterative seed selection in traditional voting-based algorithms.Secondly,we extend the Independent Cascade(IC)model and propose the Dynamic Independent Cascade(DIC)model,which aims to capture the dynamic features in the information propagation process by combining node features.Finally,experiments demonstrate that the ISVoteRank algorithm has been improved in both effectiveness and efficiency compared to baseline methods,and the influence spread through the DIC model is improved compared to the IC model.

Voting Classifier and Metaheuristic Optimization for Network Intrusion Detection

Managing physical objects in the network’s periphery is made possible by the Internet of Things(IoT),revolutionizing human life.Open attacks and unauthorized access are possible with these IoT devices,which exchange data to enable remote access.These attacks are often detected using intrusion detection methodologies,although these systems’effectiveness and accuracy are subpar.This paper proposes a new voting classifier composed of an ensemble of machine learning models trained and optimized using metaheuristic optimization.The employed metaheuristic optimizer is a new version of the whale optimization algorithm(WOA),which is guided by the dipper throated optimizer(DTO)to improve the exploration process of the traditionalWOA optimizer.The proposed voting classifier categorizes the network intrusions robustly and efficiently.To assess the proposed approach,a dataset created from IoT devices is employed to record the efficiency of the proposed algorithm for binary attack categorization.The dataset records are balanced using the locality-sensitive hashing(LSH)and Synthetic Minority Oversampling Technique(SMOTE).The evaluation of the achieved results is performed in terms of statistical analysis and visual plots to prove the proposed approach’s effectiveness,stability,and significance.The achieved results confirmed the superiority of the proposed algorithm for the task of network intrusion detection.

Ensemble Voting-Based Anomaly Detection for a Smart Grid Communication Infrastructure

Advanced Metering Infrastructure(AMI)is the metering network of the smart grid that enables bidirectional communications between each consumer’s premises and the provider’s control center.The massive amount of data collected supports the real-time decision-making required for diverse applications.The communication infrastructure relies on different network types,including the Internet.This makes the infrastructure vulnerable to various attacks,which could compromise security or have devastating effects.However,traditional machine learning solutions cannot adapt to the increasing complexity and diversity of attacks.The objective of this paper is to develop an Anomaly Detection System(ADS)based on deep learning using the CIC-IDS2017 dataset.However,this dataset is highly imbalanced;thus,a two-step sampling technique:random under-sampling and the Synthetic Minority Oversampling Technique(SMOTE),is proposed to balance the dataset.The proposed system utilizes a multiple hidden layer Auto-encoder(AE)for feature extraction and dimensional reduction.In addition,an ensemble voting based on both Random Forest(RF)and Convolu-tional Neural Network(CNN)is developed to classify the multiclass attack cate-gories.The proposed system is evaluated and compared with six different state-of-the-art machine learning and deep learning algorithms:Random Forest(RF),Light Gradient Boosting Machine(LightGBM),eXtreme Gradient Boosting(XGboost),Convolutional Neural Network(CNN),Long Short-Term Memory(LSTM),and bidirectional LSTM(biLSTM).Experimental results show that the proposed model enhances the detection for each attack class compared with the other machine learning and deep learning models with overall accuracy(98.29%),precision(99%),recall(98%),F_(1) score(98%),and the UNDetection rate(UND)(8%).

基于Voting和Stacking集成算法的岩爆倾向性预测

岩爆是矿山深部开采中常见的地质灾害,准确预测岩爆可降低矿山生产安全风险。将机器学习应用于岩爆预测是切实可行的,但仅用一种方法或将几种方法简单结合对于提高岩爆预测的准确性或泛化性作用十分有限。基于此,将最大切向应力、应力集中系数、脆性系数、弹性能量指数等作为指标,利用231组有效岩爆数据,基于Voting和Stacking集成算法,融合精确率较高的6种基础分类器(LR、RF、SVM、DT、KNN、GNB),建立了4个集成分类器V 1、V 2、S 1和S 2。根据预测结果的混淆矩阵计算了精确率、准确率、召回率及F 1分数,对各分类器性能进行了评估,结果表明:基础分类器中SVM、RF对Ⅰ级、Ⅱ级样本较敏感,KNN对Ⅲ级、Ⅳ级样本更敏感;RF、SVM整体预测效果最好,精确率分别为0.93、0.94;集成分类器相对于基础分类器性能均有不同程度的提升,但受性能较差的基础分类器及投票机制影响,Voting集成分类器整体性能弱于Stacking集成分类器;4个集成分类器中S 1性能提升最显著,预测效果最佳,精确率、准确率、召回率、F 1分数分别为0.95、0.97、0.96、0.95;将基于Stacking算法构建的集成分类器S 1应用于秦岭隧道的岩爆预测,预测结果与工程现场实际一致,验证了其可靠性。

Multi-Candidate Voting Model Based on Blockchain

Electronic voting has partially solved the problems of poor anonymity and low efficiency associated with traditional voting.However,the difficulties it introduces into the supervision of the vote counting,as well as its need for a concurrent guaranteed trusted third party,should not be overlooked.With the advent of blockchain technology in recent years,its features such as decentralization,anonymity,and non-tampering have made it a good candidate in solving the problems that electronic voting faces.In this study,we propose a multi-candidate voting model based on the blockchain technology.With the introduction of an asymmetric encryption and an anonymity-preserving voting algorithm,votes can be counted without relying on a third party,and the voting results can be displayed in real time in a manner that satisfies various levels of voting security and privacy requirements.Experimental results show that the proposed model solves the aforementioned problems of electronic voting without significant negative impact from an increasing number of voters or candidates.

基于Tensor Voting的蚁蛉翅脉修补

针对蚁蛉模式识别中蚁蛉翅脉断裂问题,利用Tensor Voting技术修补其数字照片中断裂的翅脉;展示将其应用于蚁蛉模式识别前期处理,以获取主要翅脉尽量完整信息的算法;数值实验中采用3种蚁蛉翅的图像作为测试,收到了很好的结果.

应用Voting Machine构建研究型、互动型的双语物理课堂的研究与实践

高等教育"质量工程"的实施为高等学校本科教学提出了更新、更高的要求和挑战.本文报道了应用Voting Machine这一具有强大的互动和统计功能的教学设备在双语物理课堂上开展研究型、互动型教学的实践和研究成果.

Preventing Phishing Attack on Voting System Using Visual Cryptography

Phishing is one of the most common social engineering attacks that users over the internet fall for. An example is voting systems, and because such systems should be accurate and error free, phishing prevention techniques are crucial. Visual Cryptography (VC) is utilized for efficient voting system authentication to cast votes. VC is one of the most secure approaches for privacy protection as it ensures the confidentiality of the voting system. This paper discusses proposed phishing prevention methods and compares different proposed methods.

物理课堂教学评价的一种先进工具———Voting Machine评价系统介绍

本文介绍美国俄亥俄州立大学研制的Voting Machine教学评价系统,详细论述了该教学评价系统的组成和安装、师生使用方法以及系统的理论依据。

Constrained voting extreme learning machine and its application

Extreme learning machine(ELM)has been proved to be an effective pattern classification and regression learning mechanism by researchers.However,its good performance is based on a large number of hidden layer nodes.With the increase of the nodes in the hidden layers,the computation cost is greatly increased.In this paper,we propose a novel algorithm,named constrained voting extreme learning machine(CV-ELM).Compared with the traditional ELM,the CV-ELM determines the input weight and bias based on the differences of between-class samples.At the same time,to improve the accuracy of the proposed method,the voting selection is introduced.The proposed method is evaluated on public benchmark datasets.The experimental results show that the proposed algorithm is superior to the original ELM algorithm.Further,we apply the CV-ELM to the classification of superheat degree(SD)state in the aluminum electrolysis industry,and the recognition accuracy rate reaches87.4%,and the experimental results demonstrate that the proposed method is more robust than the existing state-of-the-art identification methods.

Oscillatory Failure Detection for Flight Control System Using Voting and Comparing Monitors

Oscillatory failure cases(OFC)detection in the fly-by-wire(FBW)flight control system for civil aircraft is addressed in this paper.First,OFC is ranked four levels:Handling quality,static load,global structure fatigue and local fatigue,according to their respect impact on aircraft.Second,we present voting and comparing monitors based on un-similarity redundancy commands to detect OFC.Third,the associated performances,the thresholds and the counters of the monitors are calculated by the high fidelity nonlinear aircraft models.Finally,the monitors of OFC are verified by the Iron Bird Platform with real parameters of the flight control system.The results show that our approach can detect OFC rapidly.

Development of Data Mining Models Based on Features Ranks Voting (FRV)

Data size plays a significant role in the design and the performance of data mining models.A good feature selection algorithm reduces the problems of big data size and noise due to data redundancy.Features selection algorithms aim at selecting the best features and eliminating unnecessary ones,which in turn simplifies the structure of the data mining model as well as increases its performance.This paper introduces a robust features selection algorithm,named Features Ranking Voting Algorithm FRV.It merges the benefits of the different features selection algorithms to specify the features ranks in the dataset correctly and robustly;based on the feature ranks and voting algorithm.The FRV comprises of three different proposed techniques to select the minimum best feature set,the forward voting technique to select the best high ranks features,the backward voting technique,which drops the low ranks features(low importance feature),and the third technique merges the outputs from the forward and backward techniques to maximize the robustness of the selected features set.Different data mining models were built using obtained selected features sets from applying the proposed FVR on different datasets;to evaluate the success behavior of the proposed FRV.The high performance of these data mining models reflects the success of the proposed FRV algorithm.The FRV performance is compared with other features selection algorithms.It successes to develop data mining models for the Hungarian CAD dataset with Acc.of 96.8%,and with Acc.of 96%for the Z-Alizadeh Sani CAD dataset compared with 83.94%and 92.56%respectively in[48].

Reactions’Descriptors Selection and Yield Estimation Using Metaheuristic Algorithms and Voting Ensemble

Bioactive compounds in plants,which can be synthesized using N-arylationmethods such as the Buchwald-Hartwig reaction,are essential in drug discovery for their pharmacological effects.Important descriptors are necessary for the estimation of yields in these reactions.This study explores ten metaheuristic algorithms for descriptor selection and model a voting ensemble for evaluation.The algorithms were evaluated based on computational time and the number of selected descriptors.Analyses show that robust performance is obtained with more descriptors,compared to cases where fewer descriptors are selected.The essential descriptor was deduced based on the frequency of occurrence within the 50 extracted data subsets,and better performance was achieved with the voting ensemble than other algorithms with RMSE of 6.4270 and R^(2) of 0.9423.The results and deductions from this study can be readily applied in the decision-making process of chemical synthesis by saving the computational cost associated with initial descriptor selection for yield estimation.The ensemble model has also shown robust performance in its yield estimation ability and efficiency.

A Two-Level Approach based on Integration of Bagging and Voting for Outlier Detection

Purpose:The main aim of this study is to build a robust novel approach that is able to detect outliers in the datasets accurately.To serve this purpose,a novel approach is introduced to determine the likelihood of an object to be extremely different from the general behavior of the entire dataset.Design/methodology/approach:This paper proposes a novel two-level approach based on the integration of bagging and voting techniques for anomaly detection problems.The proposed approach,named Bagged and Voted Local Outlier Detection(BV-LOF),benefits from the Local Outlier Factor(LOF)as the base algorithm and improves its detection rate by using ensemble methods.Findings:Several experiments have been performed on ten benchmark outlier detection datasets to demonstrate the effectiveness of the BV-LOF method.According to the results,the BV-LOF approach significantly outperformed LOF on 9 datasets of 10 ones on average.Research limitations:In the BV-LOF approach,the base algorithm is applied to each subset data multiple times with different neighborhood sizes(k)in each case and with different ensemble sizes(T).In our study,we have chosen k and T value ranges as[1-100];however,these ranges can be changed according to the dataset handled and to the problem addressed.Practical implications:The proposed method can be applied to the datasets from different domains(i.e.health,finance,manufacturing,etc.)without requiring any prior information.Since the BV-LOF method includes two-level ensemble operations,it may lead to more computational time than single-level ensemble methods;however,this drawback can be overcome by parallelization and by using a proper data structure such as R*-tree or KD-tree.Originality/value:The proposed approach(BV-LOF)investigates multiple neighborhood sizes(k),which provides findings of instances with different local densities,and in this way,it provides more likelihood of outlier detection that LOF may neglect.It also brings many benefits such as easy implementation,improved capability,higher applicability,and interpretability.

End-to-end verifiable electronic voting scheme of blockchain based on random linear block code

Blockchain is an emerging decentralized technology of electronic voting.The current main consensus protocols are not flexible enough to manage the distributed blockchain nodes to achieve high efficiency of consensus.For practical implementation,the consensus based on random linear block code(RLBC)is proposed and applied to blockchain voting scheme.Along with achieving the record correctness and consistency among all nodes,the consensus method indicates the active and inactive consensus nodes.This ability can assist the management of consensus nodes and restrain the generating of chain forks.To achieve end-to-end verifiability,cast-or-audit and randomized partial checking(RPC)are used in the proposed scheme.The voter can verify the high probability of correctness in ballot encryption and decryption.The experiments illustrate that the efficiency of proposed consensus is suitable for blockchain.The proposed electronic voting scheme is adapted to practical implementation of voting.

Autism Spectrum Disorder Diagnosis Using Ensemble ML and Max Voting Techniques

Difficulty in communicating and interacting with other people are mainly due to the neurological disorder called autism spectrum disorder(ASD)diseases.These diseases can affect the nerves at any stage of the human being in childhood,adolescence,and adulthood.ASD is known as a behavioral disease due to the appearances of symptoms over thefirst two years that continue until adulthood.Most of the studies prove that the early detection of ASD helps improve the behavioral characteristics of patients with ASD.The detection of ASD is a very challenging task among various researchers.Machine learning(ML)algorithms still act very intelligent by learning the complex data and pre-dicting quality results.In this paper,ensemble ML techniques for the early detec-tion of ASD are proposed.In this detection,the dataset isfirst processed using three ML algorithms such as sequential minimal optimization with support vector machine,Kohonen self-organizing neural network,and random forest algorithm.The prediction results of these ML algorithms(ensemble)further use the bagging concept called max voting to predict thefinal result.The accuracy,sensitivity,and specificity of the proposed system are calculated using confusion matrix.The pro-posed ensemble technique performs better than state-of-the art ML algorithms.

Different Rationales of Coalition Formation and Incentives for Strategic Voting

Research on strategic voting has mainly focused on electoral system effects but largely neglected the impact of different rationales of coalition formation. Based on a formal model of rational party choice and a simulation study, we systematically investigate this impact and explore the implications. We show that the logic of the underlying coalition formation procedure clearly affects the degree to which the electorate is exposed to strategic incentives regarding the vote choice. The key implications are that sincere voting is more often in the voter’s best interest if parties are policy-seeking and if there is increased uncertainty during the stage of coalition formation. Furthermore, we explore how different types of coalition formation affect strategic incentives across the policy space.

A Novel Fuzzy Membership Partitioning for Improved Voting in Fault Tolerant System

This paper presents a novel technique for improved voting by adaptively varying the membership boundaries of a fuzzy voter to achieve realistic consensus among inputs of redundant modules of a fault tolerant system. We demonstrate that suggested dynamic membership partitioning minimizes the number of occurrences of incorrect outputs of a voter as compared to the fixed membership partitioning voter implementations. Simulation results for the proposed voter for Triple Modular Redundancy (TMR) fault tolerant system indicate that our algorithm shows better safety and availability performance as compared to the existing one. However, our voter design is general and thus it can be potentially useful for improving safety and availability of critical fault tolerant systems.