Graph analytics for task management
This final year project explores the usage of Graph Analytics for Tasks Management. In the area of graph theory in mathematics, signed graphs are special graphs whereby the edges are either labelled as positive or negative. If the product of the weights of each edge in a cycle produces a positive re...
Saved in:
Main Author: | |
---|---|
Other Authors: | |
Format: | Final Year Project |
Language: | English |
Published: |
Nanyang Technological University
2020
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/140687 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
id |
sg-ntu-dr.10356-140687 |
---|---|
record_format |
dspace |
spelling |
sg-ntu-dr.10356-1406872023-07-07T18:03:15Z Graph analytics for task management Kor, Yong Wee Meng-Hiot Lim School of Electrical and Electronic Engineering emhlim@ntu.edu.sg Engineering::Electrical and electronic engineering This final year project explores the usage of Graph Analytics for Tasks Management. In the area of graph theory in mathematics, signed graphs are special graphs whereby the edges are either labelled as positive or negative. If the product of the weights of each edge in a cycle produces a positive result, that said signed graph is considered balanced. Therefore, it has the capability to simulate real-life scenarios as visual and structural models that otherwise can be difficult to achieve using traditional ways such as performance-based indicators. There are new tools that are available in the market now and development of graph analysis has also taken a leap forward. The purpose of this project is to develop a system which can analyse an organisational structure based on the notion of structural balanced of the signed graph. The system incorporates graphing techniques and trust-based calculations to establish the optimal output for the user. Bachelor of Engineering (Electrical and Electronic Engineering) 2020-06-01T07:24:10Z 2020-06-01T07:24:10Z 2020 Final Year Project (FYP) https://hdl.handle.net/10356/140687 en A2110-191 application/pdf Nanyang Technological University |
institution |
Nanyang Technological University |
building |
NTU Library |
continent |
Asia |
country |
Singapore Singapore |
content_provider |
NTU Library |
collection |
DR-NTU |
language |
English |
topic |
Engineering::Electrical and electronic engineering |
spellingShingle |
Engineering::Electrical and electronic engineering Kor, Yong Wee Graph analytics for task management |
description |
This final year project explores the usage of Graph Analytics for Tasks Management. In the area of graph theory in mathematics, signed graphs are special graphs whereby the edges are either labelled as positive or negative. If the product of the weights of each edge in a cycle produces a positive result, that said signed graph is considered balanced. Therefore, it has the capability to simulate real-life scenarios as visual and structural models that otherwise can be difficult to achieve using traditional ways such as performance-based indicators. There are new tools that are available in the market now and development of graph analysis has also taken a leap forward. The purpose of this project is to develop a system which can analyse an organisational structure based on the notion of structural balanced of the signed graph. The system incorporates graphing techniques and trust-based calculations to establish the optimal output for the user. |
author2 |
Meng-Hiot Lim |
author_facet |
Meng-Hiot Lim Kor, Yong Wee |
format |
Final Year Project |
author |
Kor, Yong Wee |
author_sort |
Kor, Yong Wee |
title |
Graph analytics for task management |
title_short |
Graph analytics for task management |
title_full |
Graph analytics for task management |
title_fullStr |
Graph analytics for task management |
title_full_unstemmed |
Graph analytics for task management |
title_sort |
graph analytics for task management |
publisher |
Nanyang Technological University |
publishDate |
2020 |
url |
https://hdl.handle.net/10356/140687 |
_version_ |
1772826491452653568 |