mirror of
https://github.com/ruvnet/RuVector.git
synced 2026-05-30 20:43:38 +00:00
* feat: Add comprehensive dataset discovery framework for RuVector
This commit introduces a powerful dataset discovery framework with
integrations for three high-impact public data sources:
## Core Framework (examples/data/framework/)
- DataIngester: Streaming ingestion with batching and deduplication
- CoherenceEngine: Min-cut based coherence signal computation
- DiscoveryEngine: Pattern detection for emerging structures
## OpenAlex Integration (examples/data/openalex/)
- Research frontier radar: Detect emerging fields via boundary motion
- Cross-domain bridge detection: Find connector subgraphs
- Topic graph construction from citation networks
- Full API client with cursor-based pagination
## Climate Integration (examples/data/climate/)
- NOAA GHCN and NASA Earthdata clients
- Sensor network graph construction
- Regime shift detection using min-cut coherence breaks
- Time series vectorization for similarity search
- Seasonal decomposition analysis
## SEC EDGAR Integration (examples/data/edgar/)
- XBRL financial statement parsing
- Peer network construction
- Coherence watch: Detect fundamental vs narrative divergence
- Filing analysis with sentiment and risk extraction
- Cross-company contagion detection
Each integration leverages RuVector's unique capabilities:
- Vector memory for semantic similarity
- Graph structures for relationship modeling
- Dynamic min-cut for coherence signal computation
- Time series embeddings for pattern matching
Discovery thesis: Detect emerging patterns before they have names,
find non-obvious cross-domain bridges, and map causality chains.
* feat: Add working discovery examples for climate and financial data
- Fix borrow checker issues in coherence analysis modules
- Create standalone workspace for data examples
- Add regime_detector.rs for climate network coherence analysis
- Add coherence_watch.rs for SEC EDGAR narrative-fundamental divergence
- Add frontier_radar.rs template for OpenAlex research discovery
- Update Cargo.toml dependencies for example executability
- Add rand dev-dependency for demo data generation
Examples successfully detect:
- Climate regime shifts via min-cut coherence analysis
- Cross-regional teleconnection patterns
- Fundamental vs narrative divergence in SEC filings
- Sector fragmentation signals in financial data
* feat: Add working discovery examples for climate and financial data
- Add RuVector-native discovery engine with Stoer-Wagner min-cut
- Implement cross-domain pattern detection (climate ↔ finance)
- Add cosine similarity for vector-based semantic matching
- Create cross_domain_discovery example demonstrating:
- 42% cross-domain edge connectivity
- Bridge formation detection with 0.73-0.76 confidence
- Climate and finance correlation hypothesis generation
* perf: Add optimized discovery engine with SIMD and parallel processing
Performance improvements:
- 8.84x speedup for vector insertion via parallel batching
- 2.91x SIMD speedup for cosine similarity (chunked + AVX2)
- Incremental graph updates with adjacency caching
- Early termination in Stoer-Wagner min-cut
Statistical analysis features:
- P-value computation for pattern significance
- Effect size (Cohen's d) calculation
- 95% confidence intervals
- Granger-style temporal causality detection
Benchmark results (248 vectors, 3 domains):
- Cross-domain edges: 34.9% of total graph
- Domain coherence: Climate 0.74, Finance 0.94, Research 0.97
- Detected climate-finance temporal correlations
* feat: Add discovery hunter and comprehensive README tutorial
New features:
- Discovery hunter example with multi-phase pattern detection
- Climate extremes, financial stress, and research data generation
- Cross-domain hypothesis generation
- Anomaly injection testing
Documentation:
- Detailed README with step-by-step tutorial
- API reference for OptimizedConfig and patterns
- Performance benchmarks and best practices
- Troubleshooting guide
* feat: Complete discovery framework with all features
HNSW Indexing (754 lines):
- O(log n) approximate nearest neighbor search
- Configurable M, ef_construction parameters
- Cosine, Euclidean, Manhattan distance metrics
- Batch insertion support
API Clients (888 lines):
- OpenAlex: academic works, authors, topics
- NOAA: climate observations
- SEC EDGAR: company filings
- Rate limiting and retry logic
Persistence (638 lines):
- Save/load engine state and patterns
- Gzip compression (3-10x size reduction)
- Incremental pattern appending
CLI Tool (1,109 lines):
- discover, benchmark, analyze, export commands
- Colored terminal output
- JSON and human-readable formats
Streaming (570 lines):
- Async stream processing
- Sliding and tumbling windows
- Real-time pattern detection
- Backpressure handling
Tests (30 unit tests):
- Stoer-Wagner min-cut verification
- SIMD cosine similarity accuracy
- Statistical significance
- Granger causality
- Cross-domain patterns
Benchmarks:
- CLI: 176 vectors/sec @ 2000 vectors
- SIMD: 6.82M ops/sec (2.06x speedup)
- Vector insertion: 1.61x speedup
- Total: 44.74ms for 248 vectors
* feat: Add visualization, export, forecasting, and real data discovery
Visualization (555 lines):
- ASCII graph rendering with box-drawing characters
- Domain-based ANSI coloring (Climate=blue, Finance=green, Research=yellow)
- Coherence timeline sparklines
- Pattern summary dashboard
- Domain connectivity matrix
Export (650 lines):
- GraphML export for Gephi/Cytoscape
- DOT export for Graphviz
- CSV export for patterns and coherence history
- Filtered export by domain, weight, time range
- Batch export with README generation
Forecasting (525 lines):
- Holt's double exponential smoothing for trend
- CUSUM-based regime change detection (70.67% accuracy)
- Cross-domain correlation forecasting (r=1.000)
- Prediction intervals (95% CI)
- Anomaly probability scoring
Real Data Discovery:
- Fetched 80 actual papers from OpenAlex API
- Topics: climate risk, stranded assets, carbon pricing, physical risk, transition risk
- Built coherence graph: 592 nodes, 1049 edges
- Average min-cut: 185.76 (well-connected research cluster)
* feat: Add medical, real-time, and knowledge graph data sources
New API Clients:
- PubMed E-utilities for medical literature search (NCBI)
- ClinicalTrials.gov v2 API for clinical study data
- FDA OpenFDA for drug adverse events and recalls
- Wikipedia article search and extraction
- Wikidata SPARQL queries for structured knowledge
Real-time Features:
- RSS/Atom feed parsing with deduplication
- News aggregator with multiple source support
- WebSocket and REST polling infrastructure
- Event streaming with configurable windows
Examples:
- medical_discovery: PubMed + ClinicalTrials + FDA integration
- multi_domain_discovery: Climate-health-finance triangulation
- wiki_discovery: Wikipedia/Wikidata knowledge graph
- realtime_feeds: News feed aggregation demo
Tested across 70+ unit tests with all domains integrated.
* feat: Add economic, patent, and ArXiv data source clients
New API Clients:
- FredClient: Federal Reserve economic indicators (GDP, CPI, unemployment)
- WorldBankClient: Global development indicators and climate data
- AlphaVantageClient: Stock market daily prices
- ArxivClient: Scientific preprint search with category and date filters
- UsptoPatentClient: USPTO patent search by keyword, assignee, CPC class
- EpoClient: Placeholder for European patent search
New Domain:
- Domain::Economic for economic/financial indicator data
Updated Exports:
- Domain colors and shapes for Economic in visualization and export
Examples:
- economic_discovery: FRED + World Bank integration demo
- arxiv_discovery: AI/ML/Climate paper search demo
- patent_discovery: Climate tech and AI patent search demo
All 85 tests passing. APIs tested with live endpoints.
* feat: Add Semantic Scholar, bioRxiv/medRxiv, and CrossRef research clients
New Research API Clients:
- SemanticScholarClient: Citation graph analysis, paper search, author lookup
- Methods: search_papers, get_citations, get_references, search_by_field
- Builds citation networks for graph analysis
- BiorxivClient: Life sciences preprints
- Methods: search_recent, search_by_category (neuroscience, genomics, etc.)
- Automatic conversion to Domain::Research
- MedrxivClient: Medical preprints
- Methods: search_covid, search_clinical, search_by_date_range
- Automatic conversion to Domain::Medical
- CrossRefClient: DOI metadata and scholarly communication
- Methods: search_works, get_work, search_by_funder, get_citations
- Polite pool support for better rate limits
All clients include:
- Rate limiting respecting API guidelines
- Retry logic with exponential backoff
- SemanticVector conversion with rich metadata
- Comprehensive unit tests
Examples:
- biorxiv_discovery: Fetch neuroscience and clinical research
- crossref_demo: Search publications, funders, datasets
Total: 104 tests passing, ~2,500 new lines of code
* feat: Add MCP server with STDIO/SSE transport and optimized discovery
MCP Server Implementation (mcp_server.rs):
- JSON-RPC 2.0 protocol with MCP 2024-11-05 compliance
- Dual transport: STDIO for CLI, SSE for HTTP streaming
- 22 discovery tools exposing all data sources:
- Research: OpenAlex, ArXiv, Semantic Scholar, CrossRef, bioRxiv, medRxiv
- Medical: PubMed, ClinicalTrials.gov, FDA
- Economic: FRED, World Bank
- Climate: NOAA
- Knowledge: Wikipedia, Wikidata SPARQL
- Discovery: Multi-source, coherence analysis, pattern detection
- Resources: discovery://patterns, discovery://graph, discovery://history
- Pre-built prompts: cross_domain_discovery, citation_analysis, trend_detection
Binary Entry Point (bin/mcp_discovery.rs):
- CLI arguments with clap
- Configurable discovery parameters
- STDIO/SSE mode selection
Optimized Discovery Runner:
- Parallel data fetching with tokio::join!
- SIMD-accelerated vector operations (1.1M comparisons/sec)
- 6-phase discovery pipeline with benchmarking
- Statistical significance testing (p-values)
- Cross-domain correlation analysis
- CSV export and hypothesis report generation
Performance Results:
- 180 vectors from 3 sources in 7.5s
- 686 edges computed in 8ms
- SIMD throughput: 1,122,216 comparisons/sec
All 106 tests passing.
* feat: Add space, genomics, and physics data source clients
Add exotic data source integrations:
- Space clients: NASA (APOD, NEO, Mars, DONKI), Exoplanet Archive, SpaceX API, TNS Astronomy
- Genomics clients: NCBI (genes, proteins, SNPs), UniProt, Ensembl, GWAS Catalog
- Physics clients: USGS Earthquakes, CERN Open Data, Argo Ocean, Materials Project
New domains: Space, Genomics, Physics, Seismic, Ocean
All 106 tests passing, SIMD benchmark: 208k comparisons/sec
* chore: Update export/visualization and output files
* docs: Add API client inventory and reference documentation
* fix: Update API clients for 2025 endpoint changes
- ArXiv: Switch from HTTP to HTTPS (export.arxiv.org)
- USPTO: Migrate to PatentSearch API v2 (search.patentsview.org)
- Legacy API (api.patentsview.org) discontinued May 2025
- Updated query format from POST to GET
- Note: May require API authentication
- FRED: Require API key (mandatory as of 2025)
- Added error handling for missing API key
- Added response error field parsing
All tests passing, ArXiv discovery confirmed working
* feat: Implement comprehensive 2025 API client library (11,810 lines)
Add 7 new API client modules implementing 35+ data sources:
Academic APIs (1,328 lines):
- OpenAlexClient, CoreClient, EricClient, UnpaywallClient
Finance APIs (1,517 lines):
- FinnhubClient, TwelveDataClient, CoinGeckoClient, EcbClient, BlsClient
Geospatial APIs (1,250 lines):
- NominatimClient, OverpassClient, GeonamesClient, OpenElevationClient
News & Social APIs (1,606 lines):
- HackerNewsClient, GuardianClient, NewsDataClient, RedditClient
Government APIs (2,354 lines):
- CensusClient, DataGovClient, EuOpenDataClient, UkGovClient
- WorldBankGovClient, UNDataClient
AI/ML APIs (2,035 lines):
- HuggingFaceClient, OllamaClient, ReplicateClient
- TogetherAiClient, PapersWithCodeClient
Transportation APIs (1,720 lines):
- GtfsClient, MobilityDatabaseClient
- OpenRouteServiceClient, OpenChargeMapClient
All clients include:
- Async/await with tokio and reqwest
- Mock data fallback for testing without API keys
- Rate limiting with configurable delays
- SemanticVector conversion for RuVector integration
- Comprehensive unit tests (252 total tests passing)
- Full error handling with FrameworkError
* docs: Add API client documentation for new implementations
Add documentation for:
- Geospatial clients (Nominatim, Overpass, Geonames, OpenElevation)
- ML clients (HuggingFace, Ollama, Replicate, Together, PapersWithCode)
- News clients (HackerNews, Guardian, NewsData, Reddit)
- Finance clients implementation notes
* feat: Implement dynamic min-cut tracking system (SODA 2026)
Based on El-Hayek, Henzinger, Li (SODA 2026) subpolynomial dynamic min-cut algorithm.
Core Components (2,626 lines):
- dynamic_mincut.rs (1,579 lines): EulerTourTree, DynamicCutWatcher, LocalMinCutProcedure
- cut_aware_hnsw.rs (1,047 lines): CutAwareHNSW, CoherenceZones, CutGatedSearch
Key Features:
- O(log n) connectivity queries via Euler-tour trees
- n^{o(1)} update time when λ ≤ 2^{(log n)^{3/4}} (vs O(n³) Stoer-Wagner)
- Cut-gated HNSW search that respects coherence boundaries
- Real-time cut monitoring with threshold-based deep evaluation
- Thread-safe structures with Arc<RwLock>
Performance (benchmarked):
- 75x speedup over periodic recomputation
- O(1) min-cut queries vs O(n³) recompute
- ~25µs per edge update
Tests & Benchmarks:
- 36+ unit tests across both modules
- 5 benchmark suites comparing periodic vs dynamic
- Integration with existing OptimizedDiscoveryEngine
This enables real-time coherence tracking in RuVector, transforming
min-cut from an expensive periodic computation to a maintained invariant.
---------
Co-authored-by: Claude <noreply@anthropic.com>
479 lines
13 KiB
Rust
479 lines
13 KiB
Rust
//! Sensor network graph construction and analysis
|
|
|
|
use std::collections::HashMap;
|
|
|
|
use chrono::{DateTime, Utc};
|
|
use serde::{Deserialize, Serialize};
|
|
|
|
use crate::{ClimateObservation, WeatherVariable, BoundingBox};
|
|
|
|
/// A sensor node in the network graph
|
|
#[derive(Debug, Clone, Serialize, Deserialize)]
|
|
pub struct SensorNode {
|
|
/// Station/sensor ID
|
|
pub id: String,
|
|
|
|
/// Station name
|
|
pub name: String,
|
|
|
|
/// Location (lat, lon)
|
|
pub location: (f64, f64),
|
|
|
|
/// Elevation (meters)
|
|
pub elevation: Option<f64>,
|
|
|
|
/// Variables measured
|
|
pub variables: Vec<WeatherVariable>,
|
|
|
|
/// Observation count
|
|
pub observation_count: u64,
|
|
|
|
/// Quality score (0-1)
|
|
pub quality_score: f64,
|
|
|
|
/// First observation
|
|
pub first_observation: Option<DateTime<Utc>>,
|
|
|
|
/// Last observation
|
|
pub last_observation: Option<DateTime<Utc>>,
|
|
}
|
|
|
|
/// An edge between sensors in the network
|
|
#[derive(Debug, Clone, Serialize, Deserialize)]
|
|
pub struct SensorEdge {
|
|
/// Source sensor ID
|
|
pub source: String,
|
|
|
|
/// Target sensor ID
|
|
pub target: String,
|
|
|
|
/// Correlation coefficient
|
|
pub correlation: f64,
|
|
|
|
/// Distance (km)
|
|
pub distance_km: f64,
|
|
|
|
/// Edge weight (for min-cut)
|
|
pub weight: f64,
|
|
|
|
/// Variables used for correlation
|
|
pub variables: Vec<WeatherVariable>,
|
|
|
|
/// Observation overlap count
|
|
pub overlap_count: usize,
|
|
}
|
|
|
|
/// A sensor network graph
|
|
#[derive(Debug, Clone, Serialize, Deserialize)]
|
|
pub struct SensorNetwork {
|
|
/// Network identifier
|
|
pub id: String,
|
|
|
|
/// Nodes (sensors)
|
|
pub nodes: HashMap<String, SensorNode>,
|
|
|
|
/// Edges (correlations)
|
|
pub edges: Vec<SensorEdge>,
|
|
|
|
/// Bounding box
|
|
pub bounding_box: Option<BoundingBox>,
|
|
|
|
/// Creation time
|
|
pub created_at: DateTime<Utc>,
|
|
|
|
/// Network statistics
|
|
pub stats: NetworkStats,
|
|
}
|
|
|
|
/// Network statistics
|
|
#[derive(Debug, Clone, Default, Serialize, Deserialize)]
|
|
pub struct NetworkStats {
|
|
/// Number of nodes
|
|
pub node_count: usize,
|
|
|
|
/// Number of edges
|
|
pub edge_count: usize,
|
|
|
|
/// Average correlation
|
|
pub avg_correlation: f64,
|
|
|
|
/// Network density
|
|
pub density: f64,
|
|
|
|
/// Average degree
|
|
pub avg_degree: f64,
|
|
|
|
/// Clustering coefficient
|
|
pub clustering_coefficient: f64,
|
|
|
|
/// Min-cut value
|
|
pub min_cut_value: Option<f64>,
|
|
}
|
|
|
|
impl SensorNetwork {
|
|
/// Create an empty network
|
|
pub fn new(id: &str) -> Self {
|
|
Self {
|
|
id: id.to_string(),
|
|
nodes: HashMap::new(),
|
|
edges: Vec::new(),
|
|
bounding_box: None,
|
|
created_at: Utc::now(),
|
|
stats: NetworkStats::default(),
|
|
}
|
|
}
|
|
|
|
/// Add a sensor node
|
|
pub fn add_node(&mut self, node: SensorNode) {
|
|
self.nodes.insert(node.id.clone(), node);
|
|
self.update_stats();
|
|
}
|
|
|
|
/// Add an edge
|
|
pub fn add_edge(&mut self, edge: SensorEdge) {
|
|
self.edges.push(edge);
|
|
self.update_stats();
|
|
}
|
|
|
|
/// Get a node by ID
|
|
pub fn get_node(&self, id: &str) -> Option<&SensorNode> {
|
|
self.nodes.get(id)
|
|
}
|
|
|
|
/// Get edges for a node
|
|
pub fn get_edges_for_node(&self, id: &str) -> Vec<&SensorEdge> {
|
|
self.edges
|
|
.iter()
|
|
.filter(|e| e.source == id || e.target == id)
|
|
.collect()
|
|
}
|
|
|
|
/// Get neighbors of a node
|
|
pub fn get_neighbors(&self, id: &str) -> Vec<&str> {
|
|
self.edges
|
|
.iter()
|
|
.filter_map(|e| {
|
|
if e.source == id {
|
|
Some(e.target.as_str())
|
|
} else if e.target == id {
|
|
Some(e.source.as_str())
|
|
} else {
|
|
None
|
|
}
|
|
})
|
|
.collect()
|
|
}
|
|
|
|
/// Update statistics
|
|
fn update_stats(&mut self) {
|
|
self.stats.node_count = self.nodes.len();
|
|
self.stats.edge_count = self.edges.len();
|
|
|
|
if !self.edges.is_empty() {
|
|
self.stats.avg_correlation = self.edges.iter().map(|e| e.correlation).sum::<f64>()
|
|
/ self.edges.len() as f64;
|
|
}
|
|
|
|
let max_edges = if self.nodes.len() > 1 {
|
|
self.nodes.len() * (self.nodes.len() - 1) / 2
|
|
} else {
|
|
1
|
|
};
|
|
self.stats.density = self.edges.len() as f64 / max_edges as f64;
|
|
|
|
if !self.nodes.is_empty() {
|
|
self.stats.avg_degree = (2 * self.edges.len()) as f64 / self.nodes.len() as f64;
|
|
}
|
|
}
|
|
|
|
/// Convert to format suitable for RuVector min-cut
|
|
pub fn to_mincut_edges(&self) -> Vec<(u64, u64, f64)> {
|
|
let mut node_ids: HashMap<&str, u64> = HashMap::new();
|
|
let mut next_id = 0u64;
|
|
|
|
for id in self.nodes.keys() {
|
|
node_ids.insert(id.as_str(), next_id);
|
|
next_id += 1;
|
|
}
|
|
|
|
self.edges
|
|
.iter()
|
|
.filter_map(|e| {
|
|
let src_id = node_ids.get(e.source.as_str())?;
|
|
let tgt_id = node_ids.get(e.target.as_str())?;
|
|
Some((*src_id, *tgt_id, e.weight))
|
|
})
|
|
.collect()
|
|
}
|
|
|
|
/// Get node ID mapping
|
|
pub fn node_id_mapping(&self) -> HashMap<u64, String> {
|
|
let mut mapping = HashMap::new();
|
|
for (i, id) in self.nodes.keys().enumerate() {
|
|
mapping.insert(i as u64, id.clone());
|
|
}
|
|
mapping
|
|
}
|
|
}
|
|
|
|
/// Builder for sensor networks
|
|
pub struct SensorNetworkBuilder {
|
|
id: String,
|
|
observations: Vec<ClimateObservation>,
|
|
correlation_threshold: f64,
|
|
max_distance_km: f64,
|
|
min_overlap: usize,
|
|
variables: Vec<WeatherVariable>,
|
|
}
|
|
|
|
impl SensorNetworkBuilder {
|
|
/// Create a new network builder
|
|
pub fn new() -> Self {
|
|
Self {
|
|
id: format!("network_{}", Utc::now().timestamp()),
|
|
observations: Vec::new(),
|
|
correlation_threshold: 0.5,
|
|
max_distance_km: 500.0,
|
|
min_overlap: 30,
|
|
variables: vec![WeatherVariable::Temperature],
|
|
}
|
|
}
|
|
|
|
/// Set network ID
|
|
pub fn with_id(mut self, id: &str) -> Self {
|
|
self.id = id.to_string();
|
|
self
|
|
}
|
|
|
|
/// Add observations
|
|
pub fn add_observations(mut self, observations: Vec<ClimateObservation>) -> Self {
|
|
self.observations.extend(observations);
|
|
self
|
|
}
|
|
|
|
/// Set correlation threshold
|
|
pub fn correlation_threshold(mut self, threshold: f64) -> Self {
|
|
self.correlation_threshold = threshold;
|
|
self
|
|
}
|
|
|
|
/// Set maximum distance
|
|
pub fn max_distance_km(mut self, distance: f64) -> Self {
|
|
self.max_distance_km = distance;
|
|
self
|
|
}
|
|
|
|
/// Set minimum overlap
|
|
pub fn min_overlap(mut self, min: usize) -> Self {
|
|
self.min_overlap = min;
|
|
self
|
|
}
|
|
|
|
/// Set variables to use
|
|
pub fn variables(mut self, vars: Vec<WeatherVariable>) -> Self {
|
|
self.variables = vars;
|
|
self
|
|
}
|
|
|
|
/// Build the network
|
|
pub fn build(self) -> SensorNetwork {
|
|
let mut network = SensorNetwork::new(&self.id);
|
|
|
|
// Group observations by station
|
|
let mut station_obs: HashMap<String, Vec<&ClimateObservation>> = HashMap::new();
|
|
for obs in &self.observations {
|
|
station_obs.entry(obs.station_id.clone()).or_default().push(obs);
|
|
}
|
|
|
|
// Create nodes
|
|
for (station_id, observations) in &station_obs {
|
|
let first_obs = observations.iter().min_by_key(|o| o.timestamp);
|
|
let last_obs = observations.iter().max_by_key(|o| o.timestamp);
|
|
|
|
let location = first_obs.map(|o| o.location).unwrap_or((0.0, 0.0));
|
|
let variables: Vec<_> = observations.iter().map(|o| o.variable).collect::<std::collections::HashSet<_>>().into_iter().collect();
|
|
|
|
let node = SensorNode {
|
|
id: station_id.clone(),
|
|
name: station_id.clone(),
|
|
location,
|
|
elevation: None,
|
|
variables,
|
|
observation_count: observations.len() as u64,
|
|
quality_score: self.compute_quality_score(observations),
|
|
first_observation: first_obs.map(|o| o.timestamp),
|
|
last_observation: last_obs.map(|o| o.timestamp),
|
|
};
|
|
|
|
network.add_node(node);
|
|
}
|
|
|
|
// Create edges based on correlation
|
|
let station_ids: Vec<_> = station_obs.keys().cloned().collect();
|
|
|
|
for i in 0..station_ids.len() {
|
|
for j in (i + 1)..station_ids.len() {
|
|
let id_i = &station_ids[i];
|
|
let id_j = &station_ids[j];
|
|
|
|
let obs_i = &station_obs[id_i];
|
|
let obs_j = &station_obs[id_j];
|
|
|
|
// Check distance
|
|
let loc_i = obs_i.first().map(|o| o.location).unwrap_or((0.0, 0.0));
|
|
let loc_j = obs_j.first().map(|o| o.location).unwrap_or((0.0, 0.0));
|
|
let distance = haversine_distance(loc_i.0, loc_i.1, loc_j.0, loc_j.1);
|
|
|
|
if distance > self.max_distance_km {
|
|
continue;
|
|
}
|
|
|
|
// Compute correlation
|
|
let (correlation, overlap) = self.compute_correlation(obs_i, obs_j);
|
|
|
|
if correlation.abs() >= self.correlation_threshold && overlap >= self.min_overlap {
|
|
let edge = SensorEdge {
|
|
source: id_i.clone(),
|
|
target: id_j.clone(),
|
|
correlation,
|
|
distance_km: distance,
|
|
weight: correlation.abs(), // Use abs correlation as weight
|
|
variables: self.variables.clone(),
|
|
overlap_count: overlap,
|
|
};
|
|
|
|
network.add_edge(edge);
|
|
}
|
|
}
|
|
}
|
|
|
|
network
|
|
}
|
|
|
|
/// Compute quality score for a station
|
|
fn compute_quality_score(&self, observations: &[&ClimateObservation]) -> f64 {
|
|
if observations.is_empty() {
|
|
return 0.0;
|
|
}
|
|
|
|
let good_count = observations
|
|
.iter()
|
|
.filter(|o| o.quality == crate::QualityFlag::Good)
|
|
.count();
|
|
|
|
good_count as f64 / observations.len() as f64
|
|
}
|
|
|
|
/// Compute correlation between two stations
|
|
fn compute_correlation(&self, obs_a: &[&ClimateObservation], obs_b: &[&ClimateObservation]) -> (f64, usize) {
|
|
// Build time-aligned series
|
|
let mut map_a: HashMap<i64, f64> = HashMap::new();
|
|
let mut map_b: HashMap<i64, f64> = HashMap::new();
|
|
|
|
for obs in obs_a {
|
|
if self.variables.contains(&obs.variable) {
|
|
// Round to daily
|
|
let day = obs.timestamp.timestamp() / 86400;
|
|
map_a.insert(day, obs.value);
|
|
}
|
|
}
|
|
|
|
for obs in obs_b {
|
|
if self.variables.contains(&obs.variable) {
|
|
let day = obs.timestamp.timestamp() / 86400;
|
|
map_b.insert(day, obs.value);
|
|
}
|
|
}
|
|
|
|
// Find overlapping days
|
|
let mut vals_a = Vec::new();
|
|
let mut vals_b = Vec::new();
|
|
|
|
for (day, val_a) in &map_a {
|
|
if let Some(&val_b) = map_b.get(day) {
|
|
vals_a.push(*val_a);
|
|
vals_b.push(val_b);
|
|
}
|
|
}
|
|
|
|
let overlap = vals_a.len();
|
|
if overlap < 3 {
|
|
return (0.0, overlap);
|
|
}
|
|
|
|
// Pearson correlation
|
|
let mean_a = vals_a.iter().sum::<f64>() / overlap as f64;
|
|
let mean_b = vals_b.iter().sum::<f64>() / overlap as f64;
|
|
|
|
let mut cov = 0.0;
|
|
let mut var_a = 0.0;
|
|
let mut var_b = 0.0;
|
|
|
|
for i in 0..overlap {
|
|
let da = vals_a[i] - mean_a;
|
|
let db = vals_b[i] - mean_b;
|
|
cov += da * db;
|
|
var_a += da * da;
|
|
var_b += db * db;
|
|
}
|
|
|
|
let correlation = if var_a * var_b > 0.0 {
|
|
cov / (var_a.sqrt() * var_b.sqrt())
|
|
} else {
|
|
0.0
|
|
};
|
|
|
|
(correlation, overlap)
|
|
}
|
|
}
|
|
|
|
impl Default for SensorNetworkBuilder {
|
|
fn default() -> Self {
|
|
Self::new()
|
|
}
|
|
}
|
|
|
|
/// Haversine distance between two points (km)
|
|
pub fn haversine_distance(lat1: f64, lon1: f64, lat2: f64, lon2: f64) -> f64 {
|
|
const R: f64 = 6371.0; // Earth radius in km
|
|
|
|
let lat1_rad = lat1.to_radians();
|
|
let lat2_rad = lat2.to_radians();
|
|
let delta_lat = (lat2 - lat1).to_radians();
|
|
let delta_lon = (lon2 - lon1).to_radians();
|
|
|
|
let a = (delta_lat / 2.0).sin().powi(2)
|
|
+ lat1_rad.cos() * lat2_rad.cos() * (delta_lon / 2.0).sin().powi(2);
|
|
let c = 2.0 * a.sqrt().asin();
|
|
|
|
R * c
|
|
}
|
|
|
|
#[cfg(test)]
|
|
mod tests {
|
|
use super::*;
|
|
|
|
#[test]
|
|
fn test_haversine_distance() {
|
|
// NYC to LA approximately 3940 km
|
|
let dist = haversine_distance(40.7128, -74.0060, 34.0522, -118.2437);
|
|
assert!((dist - 3940.0).abs() < 100.0);
|
|
}
|
|
|
|
#[test]
|
|
fn test_empty_network() {
|
|
let network = SensorNetwork::new("test");
|
|
assert_eq!(network.stats.node_count, 0);
|
|
assert_eq!(network.stats.edge_count, 0);
|
|
}
|
|
|
|
#[test]
|
|
fn test_network_builder() {
|
|
let builder = SensorNetworkBuilder::new()
|
|
.correlation_threshold(0.7)
|
|
.max_distance_km(100.0);
|
|
|
|
let network = builder.build();
|
|
assert!(network.nodes.is_empty());
|
|
}
|
|
}
|