Novel Apriori-Based Multi-Label Learning Algorithm by Exploiting Coupled Label Relationship

It is a key challenge to exploit the label coupling relationship in multi-label classification（MLC）problems.Most previous work focused on label pairwise relations,in which generally only global statistical information is used to analyze the coupled label relationship.In this work,firstly Bayesian and hypothesis testing methods are applied to predict the label set size of testing samples within their k nearest neighbor samples,which combines global and local statistical information,and then apriori algorithm is used to mine the label coupling relationship among multiple labels rather than pairwise labels,which can exploit the label coupling relations more accurately and comprehensively.The experimental results on text,biology and audio datasets shown that,compared with the state-of-the-art algorithm,the proposed algorithm can obtain better performance on 5 common criteria.

A fast connected components labeling algorithm for binary images

A fast label-equivalence-based connected components labeling algorithm is proposed in this paper.It is a combination of two existing efficient methods,which are pivotal operations in two-pass connected components labeling algorithms.One is a fast pixel scan method,and the other is an array-based Union-Find data structure.The scan procedure assigns each foreground pixel a provisional label according to the location of the pixel.That is to say,it labels the foreground pixels following background pixels and foreground pixels in different ways,which greatly reduces the number of neighbor pixel checks.The array-based Union-Find data structure resolves the label equivalences between provisional labels by using only a single array with path compression,and it improves the efficiency of the resolving procedure which is very time-consuming in general label-equivalence-based algorithms.The experiments on various types of images with different sizes show that the proposed algorithm is superior to other labeling approaches for huge images containing many big connected components.

近红外无创血糖浓度的Label Sensitivity算法和支持向量机回归

近红外光谱分析技术在生物医学工程领域具有广阔应用前景。无创且持续性地测量能实时监控人体血糖水平,给糖尿病患者带来极大便利性、提高生存质量、降低糖尿病并发症发生率具有很大的社会效益。无创血糖监测的想法提出较早,但仍然存在预测精度低、预测值与标签值相关性不高等难点,至今没有达到临床要求。近年来,光谱检测技术发展迅猛且机器学习技术在智能信息处理方面具有明显优势,两者结合可以有效提高人体无创血糖医学监测模型的精度和普适性。提出了一种标签敏感度算法(LS),并结合支持向量机方法建立了人体血糖含量预测模型。使用近红外光谱仪采集了4名志愿者食指处动态血液光谱数据(每名志愿者28组数据),并使用多元散射矫正(MSC)方法消除了部分光散射的影响。考虑血糖对不同波长光的吸收有差异,提出了基于血糖浓度标签差的特征波长挑选方法,并构建了标签敏感度支持向量机(LSSVR)预测模型。设计实验,对比该模型与偏最小二乘回归(PLSR)和区分度支持向量机(FSSVR)算法。结果表明,LS算法的最佳特征波长数为32,经特征波长选择后的LSSVR表现最佳,其均方误差降低至0.02 mmol·L^(-1),明显优于全谱段PLSR模型,血糖浓度的预测值与标签值的相关系数提升至99.8%,预测值全部位于可容许误差的克拉克网格A区内。LSSVR模型的优异表现为早日实现血糖的无创监测提供了新思路。

Labeling algorithm and its fairness analysis for autonomous system

A kind of packet labeling algorithm for autonomous system is introduced. The fairness of the algorithm for each traffic stream in the integrated-services is analyzed. It is shown that the rate of each stream in the integrated-services would converge to a stable value if the transmittfing or forwarding rates converge to that of the receiving exponentially.

Genetic algorithm for multi-protocol label switching

A new method for multi-protocol label switching is presented in this study, whose core idea is to construct model for simulating process of accommodating network online loads and then adopt genetic algorithm to optimize the model. Due to the heuristic property of evolutional method, the new method is efficient and effective, which is verified by the experiments.

THE INNER-SYSTEM LABELING ALGORITHM AND ITS FAIRNESS ANALYSIS

On the basis of inner-system labeling signaling used in the integrated access system,a kind of inner-system labeling algorithm is introduced in this paper, and the fairness of the algorithm for each traffic stream in the integrated-services is analyzed. The base of this algorithm is Class of Services (CoS), and each packet entering the relative independent area (an autonomous system) would be labeled according to the service type or Quality of Service (QoS) in demand,and be scheduled and managed within the system (the system can be enlarged if conforming to the same protocol). The experimental results show that each of the stream rate in the integratedservices would converge to a stable value if the rates of transmitting converge to that of the receiving exponentially, that is, the effective traffic of each stream would be fair.

A Novel Binary Firefly Algorithm for the Minimum Labeling Spanning Tree Problem

Given a connected undirected graph G whose edges are labeled,the minimumlabeling spanning tree(MLST)problemis to find a spanning tree of G with the smallest number of different labels.TheMLST is anNP-hard combinatorial optimization problem,which is widely applied in communication networks,multimodal transportation networks,and data compression.Some approximation algorithms and heuristics algorithms have been proposed for the problem.Firefly algorithm is a new meta-heuristic algorithm.Because of its simplicity and easy implementation,it has been successfully applied in various fields.However,the basic firefly algorithm is not suitable for discrete problems.To this end,a novel discrete firefly algorithm for the MLST problem is proposed in this paper.A binary operation method to update firefly positions and a local feasible handling method are introduced,which correct unfeasible solutions,eliminate redundant labels,and make the algorithm more suitable for discrete problems.Computational results show that the algorithm has good performance.The algorithm can be extended to solve other discrete optimization problems.

LC-NPLA: Label and Community Information-Based Network Presentation Learning Algorithm

Many network presentation learning algorithms(NPLA)have originated from the process of the random walk between nodes in recent years.Despite these algorithms can obtain great embedding results,there may be also some limitations.For instance,only the structural information of nodes is considered when these kinds of algorithms are constructed.Aiming at this issue,a label and community information-based network presentation learning algorithm(LC-NPLA)is proposed in this paper.First of all,by using the community information and the label information of nodes,the first-order neighbors of nodes are reconstructed.In the next,the random walk strategy is improved by integrating the degree information and label information of nodes.Then,the node sequence obtained from random walk sampling is transformed into the node representation vector by the Skip-Gram model.At last,the experimental results on ten real-world networks demonstrate that the proposed algorithm has great advantages in the label classification,network reconstruction and link prediction tasks,compared with three benchmark algorithms.

Optimization Model and Algorithm for Multi-Label Learning

This paper studies a kind of urban security risk assessment model based on multi-label learning, which is transformed into the solution of linear equations through a series of transformations, and then the solution of linear equations is transformed into an optimization problem. Finally, this paper uses some classical optimization algorithms to solve these optimization problems, the convergence of the algorithm is proved, and the advantages and disadvantages of several optimization methods are compared.

Multi-Label Feature Selection Based on Improved Ant Colony Optimization Algorithm with Dynamic Redundancy and Label Dependence

The world produces vast quantities of high-dimensional multi-semantic data.However,extracting valuable information from such a large amount of high-dimensional and multi-label data is undoubtedly arduous and challenging.Feature selection aims to mitigate the adverse impacts of high dimensionality in multi-label data by eliminating redundant and irrelevant features.The ant colony optimization algorithm has demonstrated encouraging outcomes in multi-label feature selection,because of its simplicity,efficiency,and similarity to reinforcement learning.Nevertheless,existing methods do not consider crucial correlation information,such as dynamic redundancy and label correlation.To tackle these concerns,the paper proposes a multi-label feature selection technique based on ant colony optimization algorithm(MFACO),focusing on dynamic redundancy and label correlation.Initially,the dynamic redundancy is assessed between the selected feature subset and potential features.Meanwhile,the ant colony optimization algorithm extracts label correlation from the label set,which is then combined into the heuristic factor as label weights.Experimental results demonstrate that our proposed strategies can effectively enhance the optimal search ability of ant colony,outperforming the other algorithms involved in the paper.

Detecting community structure using label propagation with consensus weight in complex network

Community detection is a fundamental work to analyse the structural and functional properties of complex networks. The label propagation algorithm （LPA） is a near linear time algorithm to find a good community structure. Despite various subsequent advances, an important issue of this algorithm has not yet been properly addressed. Random update orders within the algorithm severely hamper the stability of the identified community structure. In this paper, we executed the basic label propagation algorithm on networks multiple times, to obtain a set of consensus partitions. Based on these consensus partitions, we created a consensus weighted graph. In this consensus weighted graph, the weight value of the edge was the proportion value that the number of node pairs allocated in the same cluster was divided by the total number of partitions. Then, we introduced consensus weight to indicate the direction of label propagation. In label update steps, by computing the mixing value of consensus weight and label frequency, a node adopted the label which has the maximum mixing value instead of the most frequent one. For extending to different networks, we introduced a proportion parameter to adjust the proportion of consensus weight and label frequency in computing mixing value. Finally, we proposed an approach named the label propagation algorithm with consensus weight （LPAcw）, and the experimental results showed that the LPAcw could enhance considerably both the stability and the accuracy of community partitions.

Solving open vehicle problem with time window by hybrid column generation algorithm

This paper addresses the open vehicle routing problem with time window(OVRPTW), where each vehicle does not need to return to the depot after completing the delivery task.The optimization objective is to minimize the total distance. This problem exists widely in real-life logistics distribution process.We propose a hybrid column generation algorithm(HCGA) for the OVRPTW, embedding both exact algorithm and metaheuristic. In HCGA, a label setting algorithm and an intelligent algorithm are designed to select columns from small and large subproblems, respectively. Moreover, a branch strategy is devised to generate the final feasible solution for the OVRPTW. The computational results show that the proposed algorithm has faster speed and can obtain the approximate optimal solution of the problem with 100 customers in a reasonable time.

Research on Key Technologies of Electronic Shelf Labels Based on LoRa

The demand for Electronic Shelf Labels(ESL),according to the Internet of Things(IoT)paradigm,is expected to grow considerably in the immediate future.Various wireless communication standards are currently contending to gain an edge over the competition and provide the massive connectivity that will be required by a world in which everyday objects are expected to communicate with each other.Low-Power Wide-Area Networks(LPWANs)are continuously gaining momentum among these standards,mainly thanks to their ability to provide long-range coverage to devices,exploiting license-free frequency bands.The main theme of this work is one of the most prominent LPWAN technologies,LoRa.The purpose of this research is to provide long-range,less intermediate node,less energy dissipation,and a cheaper ESL system.Much research has already been done on designing the LoRaWAN network,not capable to make a reliable network.LoRa is using different gateways to transmit the same data,collision,data jamming,and data repetition are expected.According to the transmission behavior of LoRa,50%of data is lost.In this paper,the Improved Backoff Algorithm with synchronization technique is used to decrease overlapping and data loss.Besides,the improved Adaptive Data Rate algorithm(ADR)avoids the collision in concurrently transmitted data by using different Spreading Factors(SFs).The allocation of SF has the main role in designing LoRa based network to minimize the impact of the intra-interference,cost function,and Euclidean distance.For this purpose,the K-means machine learning algorithm is used for clustering.The data rate model is using an intra-slicing technique based on Maximum Likelihood Estimation(MLE).The data rate model includes three critical communication slices,High Critical Communication(HCC),Medium Critical Communication(MCC),and Low Critical Communication(LCC),having the specified number of End devices(EDs),payload budget delay,and data rate.Finally,different combinations of gateways are used to build ESL for 200 electronic shelf labels.

An Optimal Algorithm for Prufer Codes

This paper studies the algorithms for coding and decoding Prufer codes of a labeled tree. The algorithms for coding and decoding Prufer codes of a labeled tree in the literatures require time usually. Although there exist linear time algorithms for Prufer-like codes [1,2,3], the algorithms utilize the integer sorting algorithms. The special range of the integers to be sorted is utilized to obtain a linear time integer sorting algorithm. The Prufer code problem is reduced to integer sorting. In this paper we consider the Prufer code problem in a different angle and a more direct manner. We start from a naïve algorithm, then improved it gradually and finally we obtain a very practical linear time algorithm. The techniques we used in this paper are of interest in their own right.

A parallel pipeline connected-component labeling method for on-orbit space target monitoring

The paper designs a peripheral maximum gray differ-ence(PMGD)image segmentation method,a connected-compo-nent labeling(CCL)algorithm based on dynamic run length(DRL),and a real-time implementation streaming processor for DRL-CCL.And it verifies the function and performance in space target monitoring scene by the carrying experiment of Tianzhou-3 cargo spacecraft(TZ-3).The PMGD image segmentation method can segment the image into highly discrete and simple point tar-gets quickly,which reduces the generation of equivalences greatly and improves the real-time performance for DRL-CCL.Through parallel pipeline design,the storage of the streaming processor is optimized by 55%with no need for external me-mory,the logic is optimized by 60%,and the energy efficiency ratio is 12 times than that of the graphics processing unit,62 times than that of the digital signal proccessing,and 147 times than that of personal computers.Analyzing the results of 8756 images completed on-orbit,the speed is up to 5.88 FPS and the target detection rate is 100%.Our algorithm and implementation method meet the requirements of lightweight,high real-time,strong robustness,full-time,and stable operation in space irradia-tion environment.

基于特征点配准的真伪卷烟商标纸鉴别

为提高真伪卷烟商标纸鉴别的准确性和效率,降低鉴别的经验要求和主观性,提出一种基于特征点配准的真伪卷烟商标纸鉴别方法。使用一致的标准扫描采集卷烟样品图像,基于尺度不变特征转换算法提取图像特征点,通过特征匹配和基于单应性变换的图像配准获取判别预测变量。采用逻辑回归、梯度提升分类决策树算法构建二元分类模型对图像样本进行训练和评估。在64个卷烟规格、2 918个样本数据集上进行实验,该方法准确率高于95%。通过对比实验验证了该方法的稳定性和有效性。

基于特征集重构与多标签分类模型的谐波源定位方法

传统基于谐波状态估计的谐波源定位方法需要专门的同步相量量测装置,工程应用受到限制。为此,基于电能质量监测装置所采集的非同步量测数据,提出了基于特征集重构与多标签分类模型的谐波源定位方法。利用监测数据的充分统计量来挖掘量测时段的谐波信息,同时利用标签特定特征学习算法重构特征集,从而消除冗余特征以及无关特征对于谐波源定位精度的影响;提出基于邻接矩阵以及灵敏度分析的测点配置方法,结合电路网络拓扑信息实现测点的优化配置;提出基于改进极限学习机的谐波源定位方法,该方法以重构特征集为输入,建立多标签分类模型,实现谐波源定位。通过仿真与算例分析,验证了所提方法的可行性及有效性。

面向社交网络重要信息传播的重叠节点挖掘模型研究

针对动态社交网络中的社区检测问题,提出一种面向社交网络重要信息传播的重叠节点挖掘模型(SNONMM),结合标签传播算法(LPA)和扩散激活原理,实现对动态社交网络中重叠社区的高效检测.该模型的新节点在社交网络中向其他节点传播其标签的机会大于旧节点,从而使新节点更容易被发现并纳入相应的社区.同时,引入激活值来表示每个标签的传播强度,有助于更准确地捕捉社区结构的变化.为了验证该方法的有效性,通过两个真实数据集和一个人工合成网络对其性能进行评估.实验结果表明,该方法在检测社区准确性方面优于其他可用方法.

基于K-means聚类和特征空间增强的噪声标签深度学习算法

深度学习中神经网络的性能依赖于高质量的样本,然而噪声标签会降低网络的分类准确率。为降低噪声标签对网络性能的影响,噪声标签学习算法被提出。该算法首先将训练样本集划分成干净样本集和噪声样本集,然后使用半监督学习算法对噪声样本集赋予伪标签。然而,错误的伪标签以及训练样本数量不足的问题仍然限制着噪声标签学习算法性能的提升。为解决上述问题,提出基于K-means聚类和特征空间增强的噪声标签深度学习算法。首先,该算法利用K-means聚类算法对干净样本集进行标签聚类,并根据噪声样本集与聚类中心的距离大小筛选出难以分类的噪声样本,以提高训练样本的质量;其次,使用mixup算法扩充干净样本集和噪声样本集,以增加训练样本的数量;最后,采用特征空间增强算法抑制mixup算法新生成的噪声样本,从而提高网络的分类准确率。并在CIFAR10、CIFAR100、MNIST和ANIMAL-10共4个数据集上试验验证了该算法的有效性。

最省刻度尺设计的组合差集递推算法

在长度为n(n≥2为正整数)的直尺上最少刻多少个刻度就能度量1到n的所有长度,这便是至今未解决的最省刻度尺问题。阐明了最省刻度尺与极小优美图之间的关系,给出了计算最省刻度尺的所有最省刻度值的组合差集递推算法,得到长度为3~40的最省刻度尺的所有最省刻度值,同时,结合图论模型,给出了长度为41~82的最省刻度尺的最省刻度值。