نتایج جستجو برای: cluster reduction
تعداد نتایج: 685453 فیلتر نتایج به سال:
Nonlinear graph-based dimensionality reduction algorithms such as Laplacian Eigenmaps (LE) and Schroedinger Eigenmaps (SE) have been shown to be very effective at yielding low-dimensional representations of hyperspectral image data. However, the steps of graph construction and eigenvector computation required by LE and SE can be prohibitively costly as the number of image pixels grows. In this ...
Supplementary Figure 1. Alternative analysis of cluster centroid juxtaposition with MEGA2 software. A: UPGMA tree based on Euclidean distance between cluster centroids; B: Neighbor-joining tree based on inter-centroid distance matrix; C: UPGMA tree based on average Euclidean distance between cluster elements; D: Neighbor-joining tree based on average Euclidean distance between cluster elements....
induction motor bearing is one of the key parts of the machine and its analysis and interpretation are important for fault detection. in the present work vibration signal has been taken for the classification i.e. bearing is healthy (h) or defective (d). for this purpose, clustering based classification of bearing vibration data has been carried out using principal component analysis (pca) and ...
In an energy-constraint wireless sensor network (WSN), the sensor nodes near the Sink deplete their energy quickly due to heavy traffic and create a bottleneck zone. In a large monitoring area, the sensor nodes in a cluster may communicate with the cluster head using multi-hop mode. A bottleneck effect can also be created near the cluster heads in a cluster based WSN with several clusters. The ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید