The autoencoder (AE) is an efficient feature extraction tool that learns latent representations from raw data by minimizing the reconstruction loss. Building upon the AE architecture, deep clustering models are designed to jointly optimize the deep neural network and perform unsupervised clustering. However, existing methods directly impose the clustering objective on the latent features produced by the AE network, thereby neglecting the potential conflict between data clustering and data representation. Specifically, data clustering aims to enhance data aggregation, whereas data representation focuses on ensuring that latent features faithfully reflect the manifold structure of the raw data. To address this issue, this article proposes an innovative expanded deep embedding clustering (E-DEC) model, in which the AE network is employed to seek better latent representations, and a novel residual expansion module (REM) is integrated to construct an expanded feature space that better serves clustering tasks. Furthermore, adversarial learning between the soft cluster assignments and a prior one-hot distribution is adopted in lieu of the conventional Kullback–Leibler (KL) divergence, so as to enhance the discrimination of different clusters and avoid the degeneracy problem. Finally, an entropy regularization technique is incorporated to adaptively refine the affinity graph throughout the clustering process, thereby reducing the sensitivity of clustering performance to the initial affinity graph. Extensive experiments on real-world benchmark datasets demonstrate the superiority of the proposed model over state-of-the-art deep clustering methods.

Missing traffic data caused by sensor failures or communication errors significantly hinders the efficiency of downstream tasks in Intelligent Transportation Systems (ITS), such as the critical functions of traffic monitoring and decision-making. Since missing data contains important information, it is essential to extract dynamic spatial-temporal correlations in traffic processes by incorporating these missing features. Motivated by these concerns, a novel Dynamic Spatial-Temporal Imputation Network with Missing Features (DSTMIN) is proposed to accurately impute traffic data. DSTMIN comprises an embedding layer, a Mask Attention module (MA), and a Fusion Graph Convolution module (FGC). Specifically, an embedding layer is designed to accurately represent the distribution of missing data, thereby capturing both temporal features and missing features. Furthermore, in order to effectively capture the temporal correlations, MA integrates the missing features to emphasize the significance of observed data and reduce the adverse effects caused using incomplete data. To capture spatial correlations, FGC constructs the spatial graphs and model dynamic spatial correlations from traffic subsequences and the missing-data graph in the presence of missing features. The proposed DSTMIN is adequately evaluated to demonstrate its superior performance on two datasets, which achieves a remarkable 20% reduction in imputation error compared to state-of-the-art methods.

Deep multiview clustering provides an efficient way to analyze the data consisting of multiple modalities and features. Recently, the autoencoder (AE)-based deep multiview clustering algorithms have attracted intensive attention by virtue of their rewarding capabilities of extracting inherent features. Nevertheless, most existing methods are still confronted by several problems. First, the multiview data usually contains abundant cross-view information, thus parallel performing an individual AE for each view and directly combining the extracted latent together can hardly construct an informative view-consensus feature space for clustering. Second, the intrinsic local structures of multiview data are complicated, hence simply embedding a preset graph constraint into multiview clustering models cannot guarantee expected performance. Third, current methods commonly utilize the Kullback-Leibler (KL) divergence as clustering loss and accordingly may yield appalling clusters that lack discriminate characters. To solve these issues, in this article we propose two new AE-based deep multiview clustering algorithms named AE-based deep multiview clustering model incorporating graph embedding (AG-DMC) and deep discriminative multiview clustering algorithm with adaptive graph constraint (ADG-DMC). In AG-DMC, a novel cross-view representation learning model is established delicately by performing decoding processes based on the cascaded view-specific latent to learn sound view-consensus features for inspiring clustering results. In addition, an entropy-regularized adaptive graph constraint is imposed on the obtained soft assignments of data to precisely preserve potential local structures. Furthermore, in the improved model ADG-DMC, the adversarial learning mechanism is adopted as clustering loss to strengthen the discrimination of different clusters for better performance. In the comprehensive experiments carried out on eight real-world datasets, the proposed algorithms have achieved superior performance in the comparison with other advanced multiview clustering algorithms.

Density peaks clustering (DPC) is as an efficient algorithm due for the cluster centers can be found quickly. However, this approach has some disadvantages. Firstly, it is sensitive to the cutoff distance; secondly, the neighborhood information of the data is not considered when calculating the local density; thirdly, during allocation, one assignment error may cause more errors. Considering these problems, this study proposes a domain density peak clustering algorithm based on natural neighbor (NDDC). At first, natural neighbor is introduced innovatively to obtain the neighborhood of each point. Then, based on the natural neighbors, several new methods are proposed to calculate corresponding metrics of the points to identify the centers. At last, this study proposes a new two-step assignment strategy to reduce the probability of data misclassification. A series of experiments are conducted that the NDDC offers higher accuracy and robustness than other methods.

Distributed clustering based on the Gaussian mixture model (GMM) has exhibited excellent clustering capabilities in peer-to-peer (P2P) networks. However, more iterative numbers and communication overhead are required to achieve the consensus in existing distributed GMM clustering algorithms. In addition, the truth that it cannot find a closed form for the update of parameters in GMM causes the imprecise clustering accuracy. To solve these issues, by utilizing the transfer learning technique, a general transfer distributed GMM clustering framework is exploited to promote the clustering performance and accelerate the clustering convergence. In this work, each node is treated as both the source domain and the target domain, and these nodes can learn from each other to complete the clustering task in distributed P2P networks. Based on this framework, the transfer distributed expectation-maximization algorithm with the fixed learning rate is first presented for data clustering. Then, an improved version is designed to obtain the stable clustering accuracy, in which an adaptive transfer learning strategy is adopted to adjust the learning rate automatically instead of a fixed value. To demonstrate the extensibility of the proposed framework, a representative GMM clustering method, the entropy-type classification maximum-likelihood algorithm, is further extended to the transfer distributed counterpart. Experimental results verify the effectiveness of the presented algorithms in contrast with the existing GMM clustering approaches.

Collaborative multiview clustering methods can efficiently realize the view fusion by exploring complementary and consistent information among multiple views. However, these studies ignore all the differences between multiple views in fusion. In fact, in the multiview clustering, the data are diverse from view to view. The larger the difference between any two views is, the more the fusion of these views is required. Moreover, a global tradeoff parameter is generally adopted to restrain the penalty related to the disagreement of all views, which is often defined empirically. Inspired by the idea of transfer learning, a series of novel collaborative multiview clustering algorithms are proposed to tackle these challenges. In the most basic one, each view performs clustering independently and learns from others to improve its own clustering performance, in which a global learning factor is defined to control the interaction between multiple views. The fuzzy memberships are regarded as the important knowledge to provide guidance between views, and the consensus constraint is defined to ensure the consistent partitions of all views. In addition, the local adaptive learning factors between any two views instead of a global fixed one are adopted in an improved version to emphasize the difference between views, and the adjustment strategy for the learning factor is further designed to guarantee the stability of multiview clustering without the influence of initial values. Finally, to identify the significance of different views to the clustering, the extended versions are excavated with the assignment of view weights and the maximum entropy regularization technique is employed to optimize the weights. Experiments on various real-world multiview datasets verify the superiority of the presented approaches.

Kernel clustering has the ability to get the inherent nonlinear structure of the data. But the high computational complexity and the unknown representation of the kernel space make it unavailable for the data clustering in distributed peer-to-peer (P2P) networks. To solve this issue, we propose a new series of random feature-based collaborative kernel clustering algorithms in this article. In the most basic algorithm, each node in a distributed P2P network first maps its data into a low-dimensional random feature space with the approximation of the given kernel by using the random Fourier feature mapping method. Then, each node independently searches the clusters with its local data and the collaborative knowledge from its neighbor nodes, and the distributed clustering is performed among all network nodes until reaching the global consensus result, i.e., all nodes have the same cluster centers. In addition, an improved version is designed with assignment of feature weights, which is optimized by the maximum-entropy technique to extract important features for the cluster identification. What’s more, to relief the impact of different kernel functions and related parameters on clustering results, the combination of multiple kernels rather than a single kernel is adopted for the low-dimensional approximation, and the optimized weights are assigned to provide the guidance on the choice of the kernels and their parameters and discover significant features at the same time. Experiments on synthetic and real-world datasets show that the proposed methods achieve similar and even better results than the traditional kernel clustering methods on various performance metrics, including the average classification rate, the average normalized mutual information, and the average adjusted rand index. More importantly, the low-dimensional random features approximated to kernels and the distributed clustering mechanism adopted in these methods bring the greatly lower temporal complexity.

This article deals with collision-risk-based event-triggered optimal formation control problems for mobile multiagent systems. First, several collision-risk-related definitions, such as collision-free margin, moving direction angle, collision risk angle, and collision risk level, are proposed for the moving agents. Then, a collision-risk dependent, time-varying, event-triggered heterogeneous communication network topology is developed, where the agent starts obtaining information of the neighboring agents only when collision risks occur among them. Third, an anti-collision control law, which is composed of a switch function, a control force direction function, and a control strength function, is designed to guarantee the collision avoidance formation of multiagents. Fourth, to ensure the formation quality and save control cost of the multiagent system, an optimal formation control scheme with feedforward compensation is designed. Simulation results illustrate that: 1) by using the collision risk information of mobile agents, the proposed control scheme is effective to realize the collision avoidance optimal formation task and 2) the anti-collision formation controller can be implemented with incomplete information of the agents.

In recent years, kernel-based fuzzy clustering has attracted significant attention, primarily benefiting from the outstanding performance of capturing the potential non-linear structure in data clustering. However, many existing kernel clustering methods are not available for large datasets due to computational costs. To overcome this limitation, the low-rank random feature map is utilized to approximate the kernel space. Nevertheless, this kind of feature approximation method ignores the graph structure information hidden in the data and does not take the correlations between data samples in the clustering into account. Thus, we present a new kernel fuzzy clustering based on Quasi-Monte Carlo feature map with neighbor affinity constraint (Na_QMC_KFC). In this scheme, the Quasi-Monte Carlo method is adopted to approximate the Gaussian kernel function so as to reduce the computational costs. Meanwhile, the neighbor affinity constraint is designed to maintain the graph structure information of the data and further facilitate the consistency of the membership degrees and the raw data. What’s more, the Alternating Direction Method of Multipliers method is utilized to optimize the problem with respect to the neighbor affinity lasso. The experiments on several non-linear and real-world datasets exhibits the efficiency of the presented algorithm.

The integration of reinforcement learning with fuzzy logic can be effective in compensating the external disturbance and complex dynamic while designing the control strategy for vehicle suspension. The main contribution of this paper is that a learning-based adaptive vibration control strategy is proposed for semi-active suspension system, which combines the fuzzy logic with the reward function of reinforcement learning to improve the robustness and feasibility of the vibration control strategy. What’s more, an improved proximal policy optimization algorithm combined with fuzzy logic is proposed for realizing the trial-and-error reinforcement learning. Specially, the reward function with fuzzy logic is formulated to meet the requirements of suspension performance under different road conditions, in which the fuzzy logic is designed to fuzzily the process the collected road information, real-time update the weight matrix coefficients, and adjust the optimization objectives adaptively. Finally, numerical simulation results are given to prove the effectiveness of the proposed vibration control strategy.

The reinforcement learning (RL) with deep neural network, as a data-driven approach, is promising for adaptive traffic signal control (ATSC) in traffic scenarios. The majority of the existing studies focus on designing efficient agents and policy optimization for ATSC, but neglect to observe more detailed states of the environment. In this paper, an adaptive traffic signal control strategy, named as A2C RTQL, is proposed for scheduling the traffic signal in an intersection, by combining the real-time lane-based queue lengths with deep RL agent. First, the Lighthill-Whitham-Richards (LWR) shockwave theory is employed for obtaining the real-time queue lengths in each lane. After that, by defining the obtained queue lengths as the inputs, A2C RTQL strategy is designed for traffic signal control based on the advanced actor-critic (A2C) agent, where the lanes are divided into multiple parallel environments based on the phases of traffic signal. Simulation results demonstrate the optimality and efficiency of the proposed strategy compared with other methods in SUMO under simulated peak-hour traffic dynamics.

As each clustering algorithm cannot efficiently partition datasets with arbitrary shapes, the thought of clustering ensemble is proposed to consistently integrate clustering results to obtain better division. Most of ensemble research employs a single algorithm with different parameters to clustering. And this can be easily integrated, however it is hardly to divide complex datasets. Other available methods integrate different algorithms, it can divide datasets from different aspects, but fail to take outliers into account, which produces negative effects on the partition results. In order to solve these problems, we clustering datasets with three different density-based algorithms. The innovation of this paper is described as: (1) by setting dynamic thresholds, lower frequency evidence in the co-association matrix is gradually deleted to obtain multiple reconstructed matrices; (2) these reconstructed matrices are analyzed by hierarchical clustering to obtain basic clustering results; (3) an internal validity index is designed by the compactness within clusters and the correlation between clusters, which is used to select the final clustering result. By this innovation, the clustering effect is significantly improved. Finally, a series of experiments are designed, and the results verify the improvement and effectiveness of the proposed technique (DCE-IVI).

In this article, a fuzzy floating centroids method (FFCM) is proposed, which uses a fuzzy strategy and the concept of floating centroids to enhance the performance of the neural-network classifier. The decision boundaries in the traditional floating centroids neural-network (FCM) classifier are "hard." These hard boundaries force a point, such as noisy or boundary point, to be assigned to a class exclusively, thereby frequently resulting in misclassification and influencing the performance of optimization methods to train the neural network. A fuzzy strategy combined with floating centroids is introduced to produce "soft" boundaries to handle noisy and boundary points, which increases the chance of discovering the optimal neural network during optimization. In addition, the FFCM adopts a weighted target function to correct the preference to majority classes for imbalanced data. The performance of FFCM is compared with ten classification methods on 32 benchmark datasets by using indicators: average F -measure (Avg.FM) and generalization accuracy. Also, the proposed FFCM is applied to nondestructively estimate the strength grade of cement specimens based on microstructural images. In the experimental results, FFCM achieves the optimal generalization accuracy and Avg.FM on 17 datasets and 21 datasets, respectively; FFCM balances precision and recall better than its competitors for the estimation of cement strength grade.

The traditional collaborative fuzzy clustering can effectively perform data clustering in distributed peer-to-peer networks, which is an impossible task to complete for the centralized clustering methods due to privacy and security requirements or network transmission technology constraints. But it will increase the number of clustering iterations and lead to lower efficiency of the clustering. Moreover, the collaborative mechanism hidden in the iterative process of clustering cannot be well revealed and explained. In this article, a novel series of transfer collaborative fuzzy clustering algorithms are proposed to solve these issues. In the first basic algorithm, the transfer learning among neighbor nodes vividly expresses the collaborative mechanism and enhances the information collaboration to accelerate the convergence of fuzzy clustering. Meanwhile, neighbor nodes can learn the knowledge from each other to further promote their respective clustering performance. Then, an improved version, with the learning-rate-adjustable strategy instead of fixed values, is designed to highlight the different influence between neighbor nodes, and the appropriate learning rates between neighbor nodes are achieved to ensure the stable clustering accuracy. Finally, two extended versions with the attribute-weight-entropy regularization technique are presented for the clustering of high dimensional sparse data and the extraction of important subspace features. Experiments show the efficiency of the proposed algorithms compared with the related prototype-based clustering methods.

Multiview clustering is an important topic in multiview learning, where the cooperation of different views is used to improve clustering performance. Although multiview clustering has made considerable progress, most existing methods only utilize the information of the original visible views, or only consider some hidden space information shared by different views. Two of the challenges are: 1) insufficient exploitation of cooperative learning between visible and hidden information despite some preliminary attempts, and 2) inadequate consideration of topological information for improving multiview clustering. To meet the challenges, we propose the cooperation enhanced multiview fuzzy clustering method (CE-MVFC) in this article. First, we characterize multiview data with two hidden views, which are obtained by adaptive multiview non-negative matrix factorization (NMF) and fuzzy partition information of each sample in different clusters. Then, we integrated the hidden views and the original visible views to realize visible-hidden cooperation learning. Furthermore, we establish a similarity matrix for each visible view and the hidden view obtained through NMF to describe the data topology in these views. Based on the spatial topological relationship of the samples and the representation of hidden view obtained by fuzzy partition, the network least absolute shrinkage and selection operator is constructed to constrain multiview learning. Finally, we develop the multiview clustering method by exploiting the visible-hidden information cooperation and the spatial topological information constraints. Experiments on benchmark multiview datasets are conducted to demonstrate the highly competitive performance of the proposed CE-MVFC against the state-of-the-art methods.

Tensor-based robust principal component analysis (PCA) methods are efficient to discover the low-rank part of a hyperspectral image for reducing redundant information and guarantee good classification results. However, current methods cannot remove noise adequately, and the residual noise remaining in the low-rank image limits the further improvement of classification performance. Thus, enhancing the robustness to noise is important and helpful for tensor-based robust PCA (RPCA) methods to process hyperspectral images. To this end, we propose a tensor-based RPCA method with a locality preserving graph and frontal slice sparsity (LPGTRPCA) for hyperspectral image classification. Specifically, a tensor$l_{2,2,1}$norm that requires the frontal slice sparsity of a tensor is defined to extract the noise in the hyperspectral image from the frontal direction. What is more, a position-based Laplacian graph that preserves the local structures of a tensor according to the spatial position is designed for relieving the impact of the residual noise remaining in the low-rank image. Based on the tensor nuclear norm, the tensor$l_{2,2,1}$norm, and the position-based Laplacian graph, LPGTRPCA efficiently separates the low-rank part with little noise from a raw hyperspectral image and achieves more robust classification results than current methods. LPGTRPCA is optimized by the alternative direction multiplier method (ADMM), and the convergence of solutions is experimentally demonstrated. In the experiments conducted on Indian Pines, Pavia University, and Salinas datasets, LPGTRPCA outperformed various state-of-the-art and classical tensor-based RPCA methods in terms of average class classification accuracy (AA), overall classification accuracy (OA), and kappa coefficient (KC).

In this article, the fault-tolerant control (FTC) problem of vehicle active suspension is concerned in the discrete-time domain, in which the road disturbances and faults in actuator and measurement are considered. The main contribution consists of proposing an active physically realizable fault-tolerant controller based on a reduced-order observer, which makes up an optimal vibration control component and an event-triggered FTC component. More specifically, by discussing a discrete vehicle active suspension subject to road disturbances generated from the output of a designed exosystem, the optimal vibration control component is derived from maximum principle to offset the inevitable vibrations. Meanwhile, based on the real-time system output of vehicle suspension rather than residual error, a reduced-order observer is proposed to cover the physically unrealizable problem for the designed optimal vibration control component. After that, an event-triggered FTC component and an event-triggered restructured system output are designed to compensate the faults in actuator and measurement, respectively. Finally, extensive experiments are conduced to the control performance of vehicle active suspension under the proposed controller, and confirm its effectiveness and superiority over other control schemes.

Combining the computational intelligence with dynamic responses of vehicle suspension for estimating the road profiles provides effective tool for designing various control strategies. In this paper, a FNT-based road profile classification method is proposed based on the dynamic responses of a quarter semi-active suspension under PID controller and road disturbances generated from power spectral density under the ISO 8608 standard. More specially, a data preprocessing method is designed to reduce the impact of vehicle velocity on dynamic response and determine the appropriate size of the spatial domain for data collection. After that, FNT is employed as the basic model to screen these extracted features for road profile classification with low computational consumption of road evaluation. From the numerical simulation results, the classification accuracy is 98.41% under the proposed road profile classification with six input variables.

For image segmentation, fuzzy clustering methods with single spatial information cannot ensure robustness to the image corrupted by different noises. In this paper, to figure out this problem, we propose a multiple spatial information weighted fuzzy clustering method, in which the original pixel intensity and its two spatial information, the mean and median of neighbors within a local window, are combined with different weights to obtain precise segmentation results of noise images. And the entropy-regularized method is employed to optimize the weight of each term to handle the images with different noise. What's more, the kernelization of the proposed method is presented to relief the impact of outliers. It is worth noting that our methods can be further extended by combining with other spatial information. Experiments on synthetic images and natural images show the superiority and efficiency of the proposed methods.

The centralized longitudinal control problem for Cooperative Adaptive Cruise Control (CACC) systems is discussed in this paper, in which the imperfect wireless communication surroundings and actuator dynamics are taken into consideration. From the large-scale system standpoint, the centralized longitudinal control problem for platoon vehicles equipped with CACC functionality is formulated as minimizing a quadratic performance index under the constrains of a large-scale discrete-time system with actuator delay and system output delay, in which the leader vehicle is set as the control center. After that, benefiting from a designed delay-free transformed vector, a delay-free two-point-boundary-value problem is derived from the equivalent reconstruction forms for original system delay model and performance index. Thus the centralized longitudinal controller is obtained by solving a Riccati equation. Finally, simulation results demonstrate that the ego vehicle can reasonable response the accelerating or decelerating behaviors of the preceding vehicles under the proposed controller, thereby the desired CACC control performance is satisfied, and the wireless communication delay and actuator delay are compensated effectively.

The Broad Learning System has been proved to be effective and efficient. However, the associated feature nodes in the system are mainly based on linear mappings. Although such kind of features has been successful in various datasets and applications, more general features (especially for the nonlinear features) are necessary for specific applications. Motivated by the powerful capability of the kernel methods, a novel expansion of broad learning system based on multiple kernels is proposed in this paper. Firstly, the nonlinear feature mappings in the form of multiple kernels are merged into the feature nodes of broad learning system. After that, the resulted features are further enhanced through nonlinear activation functions. The experimental results on UCI datasets indicate that the proposed method outperforms the other methods.

The floating centroids method (FCM) effectively enhances the performance of neural network classifiers. However, the problem of optimizing the neural network continues to restrict the further improvement of FCM. Traditional particle swarm optimization algorithm (PSO) sometimes converges to a local optimal solution in multimodal landscape, particularly for optimizing neural networks. Therefore, the dynamic multilayer PSO (DMLPSO) is proposed to optimize the neural network for improving the performance of FCM. DMLPSO adopts the basic concepts of multi-layer PSO to introduce a dynamic reorganizing strategy, which achieves that valuable information dynamically interacts among different subswarms. This strategy increases population diversity to promote the performance of DMLPSO when optimizing multimodal functions. Experimental results indicate that the proposed DMLPSO enables FCM to obtain improved solutions in many data sets.

Uncertain data clustering has been recognized as an essential task in the research of data mining. Many centralized clustering algorithms are extended by defining new distance or similarity measurements to tackle this issue. With the fast development of network applications, these centralized methods show their limitations in conducting data clustering in a large dynamic distributed peer-to-peer network due to the privacy and security concerns or the technical constraints brought by distributive environments. In this paper, we propose a novel distributed uncertain data clustering algorithm, in which the centralized global clustering solution is approximated by performing distributed clustering. To shorten the execution time, the reduction technique is then applied to transform the proposed method into its deterministic form by replacing each uncertain data object with its expected centroid. Finally, the attribute-weight-entropy regularization technique enhances the proposed distributed clustering method to achieve better results in data clustering and extract the essential features for cluster identification. The experiments on both synthetic and real-world data have shown the efficiency and superiority of the presented algorithm.

Spectral clustering is one of the most effective methods of data mining, in which the adjacency matrix is constructed by using the similarity matrix. In this paper, to extend spectral clustering method for uncertain data clustering, we propose a new spectral clustering method based on JS-divergence. In the proposed method, the JS-divergence is used to construct the adjacency matrix in the spectral clustering, which is more suitable to calculate the similarity between uncertain data objects as a symmetrical measurement compared to the KL-divergence.

Uncertain data clustering is an essential task in the research of data mining. Lots of traditional clustering methods are extended with new similarity measurements to tackle this issue. Different from certain data clustering, uncertain data clustering focus more on the evaluation of distribution similarity between uncertain data objects. In this paper, based on the KL-divergence and the JS-divergence, we propose a novel K-medoids method for clustering uncertain data, named UK-medoids. Good performance of the proposed algorithm is shown in experiments on synthetic datasets.

Learning process is an important part in two-layer networks. It is imperative to search for an optimal learning rate to get a maximum error reduction in each learning step. Related literature has proposed various kinds of methods to find such an optimal learning rate in the past decades. In this paper, we proposed an improved dynamic optimal learning rate by adding an optimal ratio k. It is found that our improved dynamic optimal learning rate can generate a better result in learning processes. Meanwhile, we have proved the existence of the ratio kby giving it a proper math expression. Furthermore, we also applied the improved learning rate to solve inverse problem and compared the difference of the improved learning rate with the previous approach. It is observed that our proposed method performs better. Therefore, it can be concluded that our new method to search for dynamic optimal learning rate is valuable in the intelligence learning applications of neural networks, or it is effective in the aspect of tested problem at least.

For the single kernel based clustering methods, the selection of kernel parameters largely affects the clustering results. To address this issue, a new multiple kernel fuzzy c-means clustering algorithm is proposed, in which the maximum entropy method is used to regularize the kernel weights and decide the important kernels. A new objective function is developed to simultaneously minimize the within cluster dispersion in the kernel space and maximize the kernel-weight-entropy. Thus, the optimal clustering results have been yielded and the important kernels are extracted according to the optimal assignment of kernel weights. Experiments on synthetic ‘nonspherical’ shaped datasets have demonstrated the efficiency and superiority of the presented algorithms.

Due to privacy and security requirements or technical constraints, traditional centralized approaches to data clustering in a large dynamic distributed peer-to-peer network are difficult to perform. In this paper, a novel collaborative fuzzy clustering algorithm is proposed, in which the centralized clustering solution is approximated by performing distributed clustering at each peer with the collaboration of other peers. The required communication links are established at the level of cluster prototype and attribute weight. The information exchange only exists between topological neighboring peers. The attribute-weight-entropy regularization technique is applied in the distributed clustering method to achieve an ideal distribution of attribute weights, which ensures good clustering results. And the important features are successfully extracted for the high-dimensional data clustering. The kernelization of the proposed algorithm is also realized as a practical tool for clustering the data with “nonspherical”-shaped clusters. Experiments on synthetic and real-world datasets have demonstrated the efficiency and superiority of the proposed algorithms.

Traffic-monitoring can efficiently promote better urban planning and encourage better use of public transport. The investment of traffic-monitoring system will bring huge social and economic benefits by reducing congestion and pollution. Based on the wireless sensor network (WSN) technique, this paper investigates the problem of efficiently monitoring, collecting, and disseminating traffic information in an urban setting. We design the architecture of WSN-based traffic-monitoring system and specify the phases of the traffic information acquisition and delivery in the context of WSN environment. A novel data-centric routing algorithm is proposed for data delivery, in which multiple routing-related information are adopted for routing decision making. Simulation results have shown the good performance of the proposed routing scheme compared with other traditional schemes.

Traffic monitoring can efficiently promote urban planning and encourage better use of public transport. Efficient traffic information collection is one important part of traffic monitoring systems. Based on a technique using wireless sensor networks (WSNs), this paper provides a flexible framework for regional traffic information collection in accordance with user request. This framework serves as a basis for future research in designing and implementing traffic monitoring applications. A two-layer network architecture is established for traffic information acquisition in the context of a WSN environment. In addition, a user-customizable data-centric routing scheme is proposed for traffic information delivery, in which multiple routing-related information is considered for decision-making to meet different user requirements. Simulations have shown good performance of the proposed routing scheme compared with other traditional routing schemes on a real-world urban traffic network.

In a large-scale wireless sensor traffic network, collecting and processing of the global real-time traffic information are often unreliable. Making real-time navigation decision becomes an arduous task. To address this issue, an efficient real-time vehicle navigation algorithm is proposed, in which multiple local traffic information are considered to make navigation decision in a quick and accurate way. At the same time, a general distance metric is defined for the processing of both exact and fuzzy data. In addition, the algorithm can provide various navigation decisions according to the choice of different attributes to meet the diverse navigation requirements of drivers. Simulation results show the suitability and efficiency of the proposed algorithm.

In a large-scale wireless sensor traffic network, collecting and processing of the global real-time traffic information are often unreliable. Making real-time navigation decision becomes an arduous task. To address this issue, an efficient wireless-sensor-network-based real-time vehicle navigation algorithm is proposed, in which multiple local traffic information is considered to make a navigation decision in a quick and accurate way. At the same time, a general distance metric is defined for the processing of both exact and fuzzy data. In addition, the algorithm can provide various navigation decisions according to the choice of different attributes to meet the diverse navigation requirements of drivers. Simulation results show the suitability and efficiency of the proposed algorithm.