dmarx / dmarx/Topological-Anomaly-Detection

nan's in the data

Open
#3 0 comments 0 reactions 0 assignees View on GitHub
Dominant language
Python
Stars
69
Forks
12
PR merge metrics
No merged PRs in 30d

Description

It looks like in the presence of nan's in the data, the complete graph will always be connected as `if d` in `construct_graph` will always add an edge to the graph. Or am I missing something?

Contributor guide

No contributing guide indexed for this repository

Research direction

Locate construct_graph and reproduce the reported behavior with data containing NaN values, checking how the `if d` condition affects edge creation. Done means the NaN case has an explicitly verified graph behavior rather than incorrectly producing a complete graph.

Written by the indexing model from the issue text.

Assessment

Tech stack
python
Domain
machine-learning
Issue type
Bug
Difficulty
3/5
Estimated time
1-2 days
Activity status
Stale
Clarity
Mostly clear
Newbie friendliness
35/100

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.