Positional Encoding-based Resident Identification in Multi-resident
Smart Homes
- URL: http://arxiv.org/abs/2310.17836v1
- Date: Fri, 27 Oct 2023 01:29:41 GMT
- Title: Positional Encoding-based Resident Identification in Multi-resident
Smart Homes
- Authors: Zhiyi Song, Dipankar Chaki, Abdallah Lakhdari, Athman Bouguettaya
- Abstract summary: We propose a novel resident identification framework to identify residents in a multi-occupant smart environment.
The proposed framework employs a feature extraction model based on the concepts of positional encoding.
We design a novel algorithm to build such graphs from layout maps of smart environments.
- Score: 1.2084539012992412
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We propose a novel resident identification framework to identify residents in
a multi-occupant smart environment. The proposed framework employs a feature
extraction model based on the concepts of positional encoding. The feature
extraction model considers the locations of homes as a graph. We design a novel
algorithm to build such graphs from layout maps of smart environments. The
Node2Vec algorithm is used to transform the graph into high-dimensional node
embeddings. A Long Short-Term Memory (LSTM) model is introduced to predict the
identities of residents using temporal sequences of sensor events with the node
embeddings. Extensive experiments show that our proposed scheme effectively
identifies residents in a multi-occupant environment. Evaluation results on two
real-world datasets demonstrate that our proposed approach achieves 94.5% and
87.9% accuracy, respectively.
Related papers
- Scalable Property Valuation Models via Graph-based Deep Learning [5.172964916120902]
We develop two novel graph neural network models that effectively identify sequences of neighboring houses with similar features.
We show that employing tailored graph neural networks significantly improves the accuracy of house price prediction.
arXiv Detail & Related papers (2024-05-10T15:54:55Z) - Coupled Laplacian Eigenmaps for Locally-Aware 3D Rigid Point Cloud Matching [0.0]
We propose a new technique, based on graph Laplacian eigenmaps, to match point clouds by taking into account fine local structures.
To deal with the order and sign ambiguity of Laplacian eigenmaps, we introduce a new operator, called Coupled Laplacian.
We show that the similarity between those aligned high-dimensional spaces provides a locally meaningful score to match shapes.
arXiv Detail & Related papers (2024-02-27T10:10:12Z) - Deep Manifold Graph Auto-Encoder for Attributed Graph Embedding [51.75091298017941]
This paper proposes a novel Deep Manifold (Variational) Graph Auto-Encoder (DMVGAE/DMGAE) for attributed graph data.
The proposed method surpasses state-of-the-art baseline algorithms by a significant margin on different downstream tasks across popular datasets.
arXiv Detail & Related papers (2024-01-12T17:57:07Z) - Pose-Graph Attentional Graph Neural Network for Lidar Place Recognition [16.391871270609055]
This paper proposes a pose-graph attentional graph neural network, called P-GAT.
It compares keynodes between sequential and non-sequential sub-graphs for place recognition tasks.
P-GAT uses the maximum spatial and temporal information between neighbour cloud descriptors.
arXiv Detail & Related papers (2023-08-31T23:17:44Z) - Multilayer Multiset Neuronal Networks -- MMNNs [55.2480439325792]
The present work describes multilayer multiset neuronal networks incorporating two or more layers of coincidence similarity neurons.
The work also explores the utilization of counter-prototype points, which are assigned to the image regions to be avoided.
arXiv Detail & Related papers (2023-08-28T12:55:13Z) - Targeting occupant feedback using digital twins: Adaptive
spatial-temporal thermal preference sampling to optimize personal comfort
models [0.0]
This paper outlines a scenario-based (virtual experiment) method for optimizing data sampling using a smartwatch to achieve comparable accuracy in a personal thermal preference model with less data.
The proposed Build2Vec method is 18-23% more in the overall sampling quality than the spaces-based and the square-grid-based sampling methods.
arXiv Detail & Related papers (2022-02-22T07:38:23Z) - Spatial-spectral Hyperspectral Image Classification via Multiple Random
Anchor Graphs Ensemble Learning [88.60285937702304]
This paper proposes a novel spatial-spectral HSI classification method via multiple random anchor graphs ensemble learning (RAGE)
Firstly, the local binary pattern is adopted to extract the more descriptive features on each selected band, which preserves local structures and subtle changes of a region.
Secondly, the adaptive neighbors assignment is introduced in the construction of anchor graph, to reduce the computational complexity.
arXiv Detail & Related papers (2021-03-25T09:31:41Z) - Graph-PCNN: Two Stage Human Pose Estimation with Graph Pose Refinement [54.29252286561449]
We propose a two-stage graph-based and model-agnostic framework, called Graph-PCNN.
In the first stage, heatmap regression network is applied to obtain a rough localization result, and a set of proposal keypoints, called guided points, are sampled.
In the second stage, for each guided point, different visual feature is extracted by the localization.
The relationship between guided points is explored by the graph pose refinement module to get more accurate localization results.
arXiv Detail & Related papers (2020-07-21T04:59:15Z) - Structural Temporal Graph Neural Networks for Anomaly Detection in
Dynamic Graphs [54.13919050090926]
We propose an end-to-end structural temporal Graph Neural Network model for detecting anomalous edges in dynamic graphs.
In particular, we first extract the $h$-hop enclosing subgraph centered on the target edge and propose the node labeling function to identify the role of each node in the subgraph.
Based on the extracted features, we utilize Gated recurrent units (GRUs) to capture the temporal information for anomaly detection.
arXiv Detail & Related papers (2020-05-15T09:17:08Z) - Binarized Graph Neural Network [65.20589262811677]
We develop a binarized graph neural network to learn the binary representations of the nodes with binary network parameters.
Our proposed method can be seamlessly integrated into the existing GNN-based embedding approaches.
Experiments indicate that the proposed binarized graph neural network, namely BGN, is orders of magnitude more efficient in terms of both time and space.
arXiv Detail & Related papers (2020-04-19T09:43:14Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.