scholarly journals Online Methodology for Separating the Power Consumption of Lighting Sockets and Air-Conditioning in Public Buildings Based on an Outdoor Temperature Partition Model and Historical Energy Consumption Data

2021 ◽  
Vol 11 (3) ◽  
pp. 1031
Author(s):  
Tianyi Zhao ◽  
Chengyu Zhang ◽  
Terigele Ujeed ◽  
Liangdong Ma
Keyword(s):  
Energy Consumption ◽  
Power Consumption ◽  
Air Conditioning ◽  
Clustering Algorithm ◽  
Nearest Neighbor ◽  
K Nearest Neighbor ◽  
Public Buildings ◽  
Energy Monitoring ◽  
Consumption Data ◽  
Monitoring Platform

Among sub-items of energy consumption in public buildings, lighting sockets play an important role in energy-saving analysis. So, the energy consumption data quality of lighting sockets is important. However, limited by the initial cost of energy monitoring platform, it is difficult to install electricity meters covering all branches and to retrofit the incompact classification electricity branches, which results in a mixture of the lighting socket energy consumption and other components. In this study, a separation methodology is proposed. First, the abnormal data in the energy monitoring platform are cleaned and screened using a clustering algorithm. Second, the average outdoor air temperature partitioning model (OATPM) method and the k-nearest neighbor (KNN) clustering algorithm method are proposed for identifying and separating the abnormal data. These two methods have complementary advantages in the best applicable scenarios, including calculation accuracy and other aspects. The verification results for three buildings show that the relative error of this separation methodology is less than 15%. Finally, this paper presents the optimization parameters of the KNN method. Through this methodology, building managers need only historical data in an energy monitoring platform to separate the combined power consumption of the lighting sockets and air-conditioning online, independent of detailed information statistics.

scholarly journals Intelligent Room-Based Identification of Electricity Consumption with an Ensemble Learning Method in Smart Energy

Energies ◽  
2021 ◽  
Vol 14 (20) ◽  
pp. 6717
Author(s):  
Vincent Le ◽  
Joshua Ramirez ◽  
Miltiadis Alamaniotis
Keyword(s):  
Energy Consumption ◽  
Nearest Neighbor ◽  
Electricity Consumption ◽  
K Nearest Neighbor ◽  
Real World Data ◽  
Energy Technologies ◽  
Consumption Data ◽  
Intelligent Management ◽  
Individual Consumption ◽  
Demand Response Programs

This paper frames itself in the realm of smart energy technologies that can be utilized to satisfy the electricity demand of consumers. In this environment, demand response programs and the intelligent management of energy consumption that are offered by utility providers will play a significant role in implementing smart energy. One of the approaches to implementing smart energy is to analyze consumption data and provide targeted contracts to consumers based on their individual consumption characteristics. To that end, the identification of individual consumption features is important for suppliers and utilities. Given the complexity of smart home load profiles, an appliance-based identification is nearly impossible. In this paper, we propose a different approach by grouping appliances based on their rooms; thus, we provide a room-based identification of energy consumption. To this end, this paper presents and tests an intelligent consumption identification methodology, that can be implemented in the form of an ensemble of artificial intelligence tools. The ensemble, which comprises four convolutional neural networks (CNNs) and four k-nearest neighbor (KNN) algorithms, is fed with smart submeter data and outputs the identified type of room in a given dwelling. Results obtained from real-world data exhibit the superiority of the ensemble, with respect to accuracy, as compared with individual CNN and KNN models.

DRSA: a non-hierarchical clustering algorithm using k-NN graph and its application in vegetation classification

2015 ◽  
pp. 125-138 ◽  
Author(s):  
I. V. Goncharenko
Keyword(s):  
Cluster Analysis ◽  
Clustering Algorithm ◽  
Nearest Neighbor ◽  
Clustering Algorithms ◽  
Protein Structures ◽  
Hierarchical Cluster ◽  
Vegetation Classification ◽  
K Nearest Neighbor ◽  
Neighbor Graph ◽  
Nearest Neighbor Graph

In this article we proposed a new method of non-hierarchical cluster analysis using k-nearest-neighbor graph and discussed it with respect to vegetation classification. The method of k-nearest neighbor (k-NN) classification was originally developed in 1951 (Fix, Hodges, 1951). Later a term “k-NN graph” and a few algorithms of k-NN clustering appeared (Cover, Hart, 1967; Brito et al., 1997). In biology k-NN is used in analysis of protein structures and genome sequences. Most of k-NN clustering algorithms build «excessive» graph firstly, so called hypergraph, and then truncate it to subgraphs, just partitioning and coarsening hypergraph. We developed other strategy, the “upward” clustering in forming (assembling consequentially) one cluster after the other. Until today graph-based cluster analysis has not been considered concerning classification of vegetation datasets.

scholarly journals A Novel Method for Detecting Abnormal Energy Data in Building Energy Monitoring System

2014 ◽  
Vol 2014 ◽  
pp. 1-5 ◽  
Author(s):  
Liang Zhao
Keyword(s):  
Energy Consumption ◽  
Power Consumption ◽  
Real Time ◽  
Difference Method ◽  
Building Energy ◽  
Energy Monitoring ◽  
Order Difference ◽  
Energy Data ◽  
First Order ◽  
Novel Method

This paper presents a novel abnormal data detecting algorithm based on the first order difference method, which could be used to find out outlier in building energy consumption platform real time. The principle and criterion of methodology are discussed in detail. The results show that outlier in cumulative power consumption could be detected by our method.

An improved OPTICS clustering algorithm for discovering clusters with uneven densities

2021 ◽  
Vol 25 (6) ◽  
pp. 1453-1471
Author(s):  
Chunhua Tang ◽  
Han Wang ◽  
Zhiwen Wang ◽  
Xiangkun Zeng ◽  
Huaran Yan ◽  
...  
Keyword(s):  
Time Complexity ◽  
Clustering Algorithm ◽  
Nearest Neighbor ◽  
Clustering Algorithms ◽  
Substantial Improvement ◽  
Experimental Results ◽  
High Time ◽  
Parameter Setting ◽  
K Nearest Neighbor ◽  
Density Based Clustering

Most density-based clustering algorithms have the problems of difficult parameter setting, high time complexity, poor noise recognition, and weak clustering for datasets with uneven density. To solve these problems, this paper proposes FOP-OPTICS algorithm (Finding of the Ordering Peaks Based on OPTICS), which is a substantial improvement of OPTICS (Ordering Points To Identify the Clustering Structure). The proposed algorithm finds the demarcation point (DP) from the Augmented Cluster-Ordering generated by OPTICS and uses the reachability-distance of DP as the radius of neighborhood eps of its corresponding cluster. It overcomes the weakness of most algorithms in clustering datasets with uneven densities. By computing the distance of the k-nearest neighbor of each point, it reduces the time complexity of OPTICS; by calculating density-mutation points within the clusters, it can efficiently recognize noise. The experimental results show that FOP-OPTICS has the lowest time complexity, and outperforms other algorithms in parameter setting and noise recognition.

scholarly journals K-Nearest Neighbor Intervals Based AP Clustering Algorithm for Large Incomplete Data

2015 ◽  
Vol 2015 ◽  
pp. 1-9 ◽  
Author(s):  
Cheng Lu ◽  
Shiji Song ◽  
Cheng Wu
Keyword(s):  
Clustering Analysis ◽  
Incomplete Data ◽  
Clustering Algorithm ◽  
Nearest Neighbor ◽  
Interval Data ◽  
Similarity Function ◽  
K Nearest Neighbor ◽  
Partial Data ◽  
Missing Attributes ◽  
Ap Clustering

The Affinity Propagation (AP) algorithm is an effective algorithm for clustering analysis, but it can not be directly applicable to the case of incomplete data. In view of the prevalence of missing data and the uncertainty of missing attributes, we put forward a modified AP clustering algorithm based onK-nearest neighbor intervals (KNNI) for incomplete data. Based on an Improved Partial Data Strategy, the proposed algorithm estimates the KNNI representation of missing attributes by using the attribute distribution information of the available data. The similarity function can be changed by dealing with the interval data. Then the improved AP algorithm can be applicable to the case of incomplete data. Experiments on several UCI datasets show that the proposed algorithm achieves impressive clustering results.

scholarly journals A Deep Learning Based Method for the Non-Destructive Measuring of Rock Strength through Hammering Sound

2019 ◽  
Vol 9 (17) ◽  
pp. 3484
Author(s):  
Shuai Han ◽  
Heng Li ◽  
Mingchao Li ◽  
Timothy Rose
Keyword(s):  
Clustering Algorithm ◽  
Nearest Neighbor ◽  
Rock Strength ◽  
Support Vector ◽  
K Nearest Neighbor ◽  
Strength Measurement ◽  
Regression Algorithms ◽  
Almost All ◽  
The Relationship ◽  
Non Destructive

Hammering rocks of different strengths can make different sounds. Geological engineers often use this method to approximate the strengths of rocks in geology surveys. This method is quick and convenient but subjective. Inspired by this problem, we present a new, non-destructive method for measuring the surface strengths of rocks based on deep neural network (DNN) and spectrogram analysis. All the hammering sounds are transformed into spectrograms firstly, and a clustering algorithm is presented to filter out the outliers of the spectrograms automatically. One of the most advanced image classification DNN, the Inception-ResNet-v2, is then re-trained with the spectrograms. The results show that the training accurate is up to 94.5%. Following this, three regression algorithms, including Support Vector Machine (SVM), K-Nearest Neighbor (KNN), and Random Forest (RF) are adopted to fit the relationship between the outputs of the DNN and the strength values. The tests show that KNN has the highest fitting accuracy, and SVM has the strongest generalization ability. The strengths (represented by rebound values) of almost all the samples can be predicted within an error of [−5, 5]. Overall, the proposed method has great potential in supporting the implementation of efficient rock strength measurement methods in the field.

scholarly journals 3D Point Cloud Simplification Based on k-Nearest Neighbor and Clustering

2020 ◽  
Vol 2020 ◽  
pp. 1-10 ◽  
Author(s):  
Abdelaaziz Mahdaoui ◽  
El Hassan Sbai
Keyword(s):  
Point Cloud ◽  
Clustering Algorithm ◽  
Nearest Neighbor ◽  
3D Point Cloud ◽  
K Nearest Neighbor ◽  
Test Dataset ◽  
New Approach ◽  
Entropy Estimation ◽  
3D Objects ◽  
Point Cloud Simplification

While the reconstruction of 3D objects is increasingly used today, the simplification of 3D point cloud, however, becomes a substantial phase in this process of reconstruction. This is due to the huge amounts of dense 3D point cloud produced by 3D scanning devices. In this paper, a new approach is proposed to simplify 3D point cloud based on k-nearest neighbor (k-NN) and clustering algorithm. Initially, 3D point cloud is divided into clusters using k-means algorithm. Then, an entropy estimation is performed for each cluster to remove the ones that have minimal entropy. In this paper, MATLAB is used to carry out the simulation, and the performance of our method is testified by test dataset. Numerous experiments demonstrate the effectiveness of the proposed simplification method of 3D point cloud.

scholarly journals Artificial Intelligence Assisted Heating Ventilation and Air Conditioning Control and the Unmet Demand for Sensors: Part 2. Prior Information Notice (PIN) Sensor Design and Simulation Results

Sensors ◽  
2019 ◽  
Vol 19 (15) ◽  
pp. 3440 ◽  
Author(s):  
Chin-Chi Cheng ◽  
Dasheng Lee
Keyword(s):  
Artificial Intelligence ◽  
Energy Consumption ◽  
Air Conditioning ◽  
Prior Information ◽  
Energy Savings ◽  
Theoretical Derivation ◽  
Consumption Data ◽  
Temperature And Humidity ◽  
Hvac Control ◽  
Comparative Results

The study continues the theoretical derivation from Part 1, and the experiment is carried out at a bus station equipped with six water-cooled chillers. Between 2012 and 2017, historical data collected from temperature and humidity sensors, as well as the energy consumption data, were used to build artificial intelligence (AI) assisted heating ventilation and air conditioning (HVAC) control models. The AI control system, in conjunction with a specifically designed prior information notice (PIN) sensor, was used to improve the prediction accuracy. This data collected between 2012 and 2016 was used for AI training and PIN sensor testing. During the hottest week of 2017 in Taiwan, the PIN sensor was used to conduct temperature and humidity data predictions. A model-based predictive control was developed to obtain air conditioning energy consumption data. The comparative results between the predictive and actual data showed that the temperature and humidity prediction accuracies were between 95.5 and 96.6%, respectively. Additionally, energy savings amounting to 39.8% were achieved compared to the theoretical estimates of 44.6%, a difference of less than 5%. These results show that the experimental model supports the theoretical estimations. In the future, a PIN sensor will be installed in a chiller to further verify the energy savings of the AI assisted HVAC control.

Sign in / Sign up

Export Citation Format

Share Document