ruvector/examples/data/framework/examples/optimized_benchmark.rs
rUv b07fb3e804
feat: Add comprehensive dataset discovery framework for RuVector (#104)
* 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>
2026-01-04 14:36:41 -05:00

600 lines
22 KiB
Rust

//! Optimized Discovery Benchmark
//!
//! Compares baseline vs optimized engine performance using realistic
//! data from climate, finance, and research domains.
//!
//! Run: cargo run --example optimized_benchmark -p ruvector-data-framework --features parallel
use std::collections::HashMap;
use std::time::{Duration, Instant};
use chrono::{Utc, Duration as ChronoDuration};
use rand::{Rng, SeedableRng};
use rand::rngs::StdRng;
use ruvector_data_framework::ruvector_native::{
NativeDiscoveryEngine, NativeEngineConfig, Domain, SemanticVector,
};
use ruvector_data_framework::optimized::{
OptimizedDiscoveryEngine, OptimizedConfig, simd_cosine_similarity,
};
fn main() {
println!("╔══════════════════════════════════════════════════════════════╗");
println!("║ RuVector Discovery Engine Benchmark ║");
println!("║ Baseline vs Optimized (SIMD + Parallel + Statistical) ║");
println!("╚══════════════════════════════════════════════════════════════╝\n");
// Generate realistic test data
let data = generate_multi_domain_data();
println!("📊 Generated {} vectors across 3 domains\n", data.len());
// Run benchmarks
let baseline_results = benchmark_baseline(&data);
let optimized_results = benchmark_optimized(&data);
// Print comparison
print_comparison(&baseline_results, &optimized_results);
// Run SIMD microbenchmark
simd_microbenchmark();
// Run discovery quality benchmark
discovery_quality_benchmark(&data);
println!("\n✅ Benchmark complete");
}
/// Generate realistic multi-domain data
fn generate_multi_domain_data() -> Vec<SemanticVector> {
let mut rng = StdRng::seed_from_u64(42);
let mut vectors = Vec::with_capacity(500);
// Climate data - temperature, precipitation, pressure patterns
let climate_topics = [
"temperature_anomaly", "precipitation_index", "drought_severity",
"ocean_heat_content", "arctic_sea_ice", "atmospheric_co2",
"el_nino_index", "atlantic_oscillation", "monsoon_intensity",
"wildfire_risk", "flood_probability", "hurricane_potential",
];
for (i, topic) in climate_topics.iter().enumerate() {
for month in 0..12 {
let embedding = generate_climate_embedding(&mut rng, i, month);
vectors.push(SemanticVector {
id: format!("climate_{}_{}", topic, month),
embedding,
domain: Domain::Climate,
timestamp: Utc::now() - ChronoDuration::days((11 - month as i64) * 30),
metadata: {
let mut m = HashMap::new();
m.insert("topic".to_string(), topic.to_string());
m.insert("month".to_string(), month.to_string());
m
},
});
}
}
// Financial data - sector performance, market indicators
let finance_sectors = [
"energy_sector", "utilities_sector", "agriculture_commodities",
"insurance_sector", "real_estate", "transportation",
"consumer_staples", "materials_sector",
];
for (i, sector) in finance_sectors.iter().enumerate() {
for quarter in 0..8 {
let embedding = generate_finance_embedding(&mut rng, i, quarter);
vectors.push(SemanticVector {
id: format!("finance_{}_{}", sector, quarter),
embedding,
domain: Domain::Finance,
timestamp: Utc::now() - ChronoDuration::days((7 - quarter as i64) * 90),
metadata: {
let mut m = HashMap::new();
m.insert("sector".to_string(), sector.to_string());
m.insert("quarter".to_string(), quarter.to_string());
m
},
});
}
}
// Research data - papers on climate-finance connections
let research_topics = [
"climate_risk_pricing", "stranded_assets", "carbon_markets",
"physical_risk_modeling", "transition_risk", "climate_disclosure",
"green_bonds", "sustainable_finance",
];
for (i, topic) in research_topics.iter().enumerate() {
for year in 0..5 {
let embedding = generate_research_embedding(&mut rng, i, year);
vectors.push(SemanticVector {
id: format!("research_{}_{}", topic, 2020 + year),
embedding,
domain: Domain::Research,
timestamp: Utc::now() - ChronoDuration::days((4 - year as i64) * 365),
metadata: {
let mut m = HashMap::new();
m.insert("topic".to_string(), topic.to_string());
m.insert("year".to_string(), (2020 + year).to_string());
m
},
});
}
}
vectors
}
/// Generate climate-like embedding with topic/temporal structure
fn generate_climate_embedding(rng: &mut StdRng, topic_id: usize, time_id: usize) -> Vec<f32> {
let dim = 128;
let mut embedding = vec![0.0_f32; dim];
// Base topic signature
for i in 0..dim {
embedding[i] = rng.gen::<f32>() * 0.1;
}
// Topic-specific cluster
let topic_start = (topic_id * 10) % dim;
for i in 0..10 {
embedding[(topic_start + i) % dim] += 0.5 + rng.gen::<f32>() * 0.3;
}
// Seasonal pattern (affects climate similarity)
let season = time_id % 4;
let season_start = 80 + season * 10;
for i in 0..10 {
embedding[(season_start + i) % dim] += 0.3 + rng.gen::<f32>() * 0.2;
}
// Cross-domain bridge: climate topics 0-2 correlate with finance
if topic_id < 3 {
// Add finance-like signature
for i in 40..50 {
embedding[i] += 0.3;
}
}
normalize_embedding(&mut embedding);
embedding
}
/// Generate finance-like embedding
fn generate_finance_embedding(rng: &mut StdRng, sector_id: usize, time_id: usize) -> Vec<f32> {
let dim = 128;
let mut embedding = vec![0.0_f32; dim];
for i in 0..dim {
embedding[i] = rng.gen::<f32>() * 0.1;
}
// Sector cluster
let sector_start = 40 + (sector_id * 8) % 40;
for i in 0..8 {
embedding[(sector_start + i) % dim] += 0.5 + rng.gen::<f32>() * 0.3;
}
// Temporal trend
let trend_strength = time_id as f32 / 8.0;
for i in 100..110 {
embedding[i] += trend_strength * 0.2;
}
// Cross-domain: energy/utilities correlate with climate
if sector_id < 2 {
// Climate-like signature
for i in 0..10 {
embedding[i] += 0.35;
}
}
normalize_embedding(&mut embedding);
embedding
}
/// Generate research-like embedding
fn generate_research_embedding(rng: &mut StdRng, topic_id: usize, year_id: usize) -> Vec<f32> {
let dim = 128;
let mut embedding = vec![0.0_f32; dim];
for i in 0..dim {
embedding[i] = rng.gen::<f32>() * 0.1;
}
// Research topic cluster
let topic_start = 10 + (topic_id * 12) % 60;
for i in 0..12 {
embedding[(topic_start + i) % dim] += 0.5 + rng.gen::<f32>() * 0.2;
}
// Bridge to both climate and finance
// Climate connection
for i in 0..8 {
embedding[i] += 0.25;
}
// Finance connection
for i in 45..53 {
embedding[i] += 0.25;
}
// Recent papers have evolved vocabulary
let recency = year_id as f32 / 5.0;
for i in 115..125 {
embedding[i] += recency * 0.3;
}
normalize_embedding(&mut embedding);
embedding
}
fn normalize_embedding(embedding: &mut [f32]) {
let norm: f32 = embedding.iter().map(|x| x * x).sum::<f32>().sqrt();
if norm > 0.0 {
for x in embedding.iter_mut() {
*x /= norm;
}
}
}
/// Benchmark results
#[derive(Debug)]
struct BenchmarkResults {
name: String,
vector_add_time: Duration,
coherence_time: Duration,
pattern_detection_time: Duration,
total_time: Duration,
edges_created: usize,
patterns_found: usize,
cross_domain_edges: usize,
}
/// Benchmark the baseline engine
fn benchmark_baseline(data: &[SemanticVector]) -> BenchmarkResults {
println!("━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━");
println!("📈 Running Baseline Engine Benchmark...\n");
let config = NativeEngineConfig {
similarity_threshold: 0.55,
mincut_sensitivity: 0.10,
cross_domain: true,
..Default::default()
};
let mut engine = NativeDiscoveryEngine::new(config);
let total_start = Instant::now();
// Add vectors
let add_start = Instant::now();
for vector in data {
engine.add_vector(vector.clone());
}
let vector_add_time = add_start.elapsed();
println!(" Vector insertion: {:?}", vector_add_time);
// Compute coherence
let coherence_start = Instant::now();
let snapshot = engine.compute_coherence();
let coherence_time = coherence_start.elapsed();
println!(" Coherence computation: {:?}", coherence_time);
println!(" Min-cut value: {:.4}", snapshot.mincut_value);
// Pattern detection
let pattern_start = Instant::now();
let patterns = engine.detect_patterns();
let pattern_detection_time = pattern_start.elapsed();
println!(" Pattern detection: {:?}", pattern_detection_time);
let total_time = total_start.elapsed();
let stats = engine.stats();
println!("\n Results:");
println!(" - Edges: {}", stats.total_edges);
println!(" - Cross-domain edges: {}", stats.cross_domain_edges);
println!(" - Patterns found: {}", patterns.len());
BenchmarkResults {
name: "Baseline".to_string(),
vector_add_time,
coherence_time,
pattern_detection_time,
total_time,
edges_created: stats.total_edges,
patterns_found: patterns.len(),
cross_domain_edges: stats.cross_domain_edges,
}
}
/// Benchmark the optimized engine
fn benchmark_optimized(data: &[SemanticVector]) -> BenchmarkResults {
println!("\n━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━");
println!("🚀 Running Optimized Engine Benchmark...\n");
let config = OptimizedConfig {
similarity_threshold: 0.55,
mincut_sensitivity: 0.10,
cross_domain: true,
use_simd: true,
batch_size: 128,
significance_threshold: 0.05,
causality_lookback: 8,
causality_min_correlation: 0.5,
..Default::default()
};
let mut engine = OptimizedDiscoveryEngine::new(config);
let total_start = Instant::now();
// Batch add vectors
let add_start = Instant::now();
#[cfg(feature = "parallel")]
{
engine.add_vectors_batch(data.to_vec());
}
#[cfg(not(feature = "parallel"))]
{
for vector in data {
engine.add_vector(vector.clone());
}
}
let vector_add_time = add_start.elapsed();
println!(" Vector insertion (batch): {:?}", vector_add_time);
// Compute coherence with caching
let coherence_start = Instant::now();
let snapshot = engine.compute_coherence();
let coherence_time = coherence_start.elapsed();
println!(" Coherence computation: {:?}", coherence_time);
println!(" Min-cut value: {:.4}", snapshot.mincut_value);
// Pattern detection with significance
let pattern_start = Instant::now();
let patterns = engine.detect_patterns_with_significance();
let pattern_detection_time = pattern_start.elapsed();
println!(" Pattern detection (w/ stats): {:?}", pattern_detection_time);
let total_time = total_start.elapsed();
let stats = engine.stats();
let metrics = engine.metrics();
println!("\n Results:");
println!(" - Edges: {}", stats.total_edges);
println!(" - Cross-domain edges: {}", stats.cross_domain_edges);
println!(" - Patterns found: {}", patterns.len());
println!(" - Significant patterns: {}", patterns.iter().filter(|p| p.is_significant).count());
println!(" - Vector comparisons: {}", stats.total_comparisons);
// Show significant patterns
let significant: Vec<_> = patterns.iter().filter(|p| p.is_significant).collect();
if !significant.is_empty() {
println!("\n 📊 Significant Patterns (p < 0.05):");
for pattern in significant.iter().take(5) {
println!("{} (p={:.4}, effect={:.3})",
pattern.pattern.description,
pattern.p_value,
pattern.effect_size
);
}
}
BenchmarkResults {
name: "Optimized".to_string(),
vector_add_time,
coherence_time,
pattern_detection_time,
total_time,
edges_created: stats.total_edges,
patterns_found: patterns.len(),
cross_domain_edges: stats.cross_domain_edges,
}
}
/// Print comparison of results
fn print_comparison(baseline: &BenchmarkResults, optimized: &BenchmarkResults) {
println!("\n╔══════════════════════════════════════════════════════════════╗");
println!("║ Performance Comparison ║");
println!("╚══════════════════════════════════════════════════════════════╝\n");
let speedup = |base: Duration, opt: Duration| -> f64 {
base.as_secs_f64() / opt.as_secs_f64().max(0.0001)
};
println!(" ┌─────────────────────┬─────────────┬─────────────┬──────────┐");
println!(" │ Operation │ Baseline │ Optimized │ Speedup │");
println!(" ├─────────────────────┼─────────────┼─────────────┼──────────┤");
println!(" │ Vector Insertion │ {:>9.2}ms │ {:>9.2}ms │ {:>6.2}x │",
baseline.vector_add_time.as_secs_f64() * 1000.0,
optimized.vector_add_time.as_secs_f64() * 1000.0,
speedup(baseline.vector_add_time, optimized.vector_add_time)
);
println!(" │ Coherence Compute │ {:>9.2}ms │ {:>9.2}ms │ {:>6.2}x │",
baseline.coherence_time.as_secs_f64() * 1000.0,
optimized.coherence_time.as_secs_f64() * 1000.0,
speedup(baseline.coherence_time, optimized.coherence_time)
);
println!(" │ Pattern Detection │ {:>9.2}ms │ {:>9.2}ms │ {:>6.2}x │",
baseline.pattern_detection_time.as_secs_f64() * 1000.0,
optimized.pattern_detection_time.as_secs_f64() * 1000.0,
speedup(baseline.pattern_detection_time, optimized.pattern_detection_time)
);
println!(" ├─────────────────────┼─────────────┼─────────────┼──────────┤");
println!(" │ TOTAL │ {:>9.2}ms │ {:>9.2}ms │ {:>6.2}x │",
baseline.total_time.as_secs_f64() * 1000.0,
optimized.total_time.as_secs_f64() * 1000.0,
speedup(baseline.total_time, optimized.total_time)
);
println!(" └─────────────────────┴─────────────┴─────────────┴──────────┘");
println!("\n Quality Metrics:");
println!(" - Edges created: {}{} (same algorithm)",
baseline.edges_created, optimized.edges_created);
println!(" - Cross-domain: {}{}",
baseline.cross_domain_edges, optimized.cross_domain_edges);
println!(" - Patterns: {}{} (+ statistical filtering)",
baseline.patterns_found, optimized.patterns_found);
}
/// SIMD microbenchmark
fn simd_microbenchmark() {
println!("\n━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━");
println!("⚡ SIMD Vector Operations Microbenchmark\n");
let mut rng = StdRng::seed_from_u64(123);
let dim = 128;
let iterations = 100_000;
// Generate test vectors
let vectors: Vec<Vec<f32>> = (0..100)
.map(|_| {
let mut v: Vec<f32> = (0..dim).map(|_| rng.gen()).collect();
let norm: f32 = v.iter().map(|x| x * x).sum::<f32>().sqrt();
for x in &mut v {
*x /= norm;
}
v
})
.collect();
// Benchmark SIMD cosine
let start = Instant::now();
let mut sum = 0.0_f32;
for i in 0..iterations {
let a = &vectors[i % 100];
let b = &vectors[(i + 1) % 100];
sum += simd_cosine_similarity(a, b);
}
let simd_time = start.elapsed();
// Benchmark standard cosine
let start = Instant::now();
let mut sum2 = 0.0_f32;
for i in 0..iterations {
let a = &vectors[i % 100];
let b = &vectors[(i + 1) % 100];
sum2 += standard_cosine(a, b);
}
let std_time = start.elapsed();
println!(" {} cosine similarity operations on {}-dim vectors:\n", iterations, dim);
println!(" SIMD version: {:>8.2}ms ({:.2} M ops/sec)",
simd_time.as_secs_f64() * 1000.0,
iterations as f64 / simd_time.as_secs_f64() / 1_000_000.0
);
println!(" Standard version: {:>8.2}ms ({:.2} M ops/sec)",
std_time.as_secs_f64() * 1000.0,
iterations as f64 / std_time.as_secs_f64() / 1_000_000.0
);
println!(" Speedup: {:.2}x", std_time.as_secs_f64() / simd_time.as_secs_f64());
println!(" (checksum: {:.4}, {:.4})", sum, sum2);
}
fn standard_cosine(a: &[f32], b: &[f32]) -> f32 {
let dot: f32 = a.iter().zip(b.iter()).map(|(x, y)| x * y).sum();
let norm_a: f32 = a.iter().map(|x| x * x).sum::<f32>().sqrt();
let norm_b: f32 = b.iter().map(|x| x * x).sum::<f32>().sqrt();
dot / (norm_a * norm_b)
}
/// Discovery quality benchmark
fn discovery_quality_benchmark(data: &[SemanticVector]) {
println!("\n━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━");
println!("🔍 Discovery Quality Analysis\n");
let config = OptimizedConfig {
similarity_threshold: 0.55,
cross_domain: true,
significance_threshold: 0.05,
causality_lookback: 8,
causality_min_correlation: 0.5,
..Default::default()
};
let mut engine = OptimizedDiscoveryEngine::new(config);
// Add data in temporal batches to detect patterns
let batch_size = data.len() / 4;
let mut all_patterns = Vec::new();
for (batch_idx, batch) in data.chunks(batch_size).enumerate() {
#[cfg(feature = "parallel")]
{
engine.add_vectors_batch(batch.to_vec());
}
#[cfg(not(feature = "parallel"))]
{
for v in batch {
engine.add_vector(v.clone());
}
}
let patterns = engine.detect_patterns_with_significance();
all_patterns.extend(patterns);
println!(" Batch {} ({} vectors): {} patterns detected",
batch_idx + 1, batch.len(), all_patterns.len());
}
// Analyze cross-domain discoveries
let stats = engine.stats();
println!("\n Cross-Domain Analysis:");
println!(" ─────────────────────────");
println!(" Climate nodes: {}", stats.domain_counts.get(&Domain::Climate).unwrap_or(&0));
println!(" Finance nodes: {}", stats.domain_counts.get(&Domain::Finance).unwrap_or(&0));
println!(" Research nodes: {}", stats.domain_counts.get(&Domain::Research).unwrap_or(&0));
println!(" Cross-domain edges: {} ({:.1}% of total)",
stats.cross_domain_edges,
100.0 * stats.cross_domain_edges as f64 / stats.total_edges.max(1) as f64
);
// Domain coherence
println!("\n Domain Coherence Scores:");
if let Some(coh) = engine.domain_coherence(Domain::Climate) {
println!(" Climate: {:.3}", coh);
}
if let Some(coh) = engine.domain_coherence(Domain::Finance) {
println!(" Finance: {:.3}", coh);
}
if let Some(coh) = engine.domain_coherence(Domain::Research) {
println!(" Research: {:.3}", coh);
}
// Show discovered cross-domain bridges
let bridges: Vec<_> = all_patterns.iter()
.filter(|p| !p.pattern.cross_domain_links.is_empty())
.collect();
if !bridges.is_empty() {
println!("\n 🌉 Cross-Domain Bridges Found: {}", bridges.len());
for bridge in bridges.iter().take(3) {
for link in &bridge.pattern.cross_domain_links {
println!(" {:?}{:?} (strength: {:.3}, type: {})",
link.source_domain,
link.target_domain,
link.link_strength,
link.link_type
);
}
}
}
// Causality patterns
let causality: Vec<_> = all_patterns.iter()
.filter(|p| matches!(p.pattern.pattern_type, ruvector_data_framework::ruvector_native::PatternType::Cascade))
.collect();
if !causality.is_empty() {
println!("\n 🔗 Temporal Causality Patterns: {}", causality.len());
for pattern in causality.iter().take(3) {
println!(" {} (p={:.4})", pattern.pattern.description, pattern.p_value);
}
}
}