How Graph Databases Expose Fraud Rings That Relational Systems Miss

·1 views

Graph databases detect fraud by mapping entities such as people, addresses, and transactions into a unified network, revealing hidden connections that traditional relational databases cannot efficiently identify. Unlike relational systems, which rely on costly JOIN operations that become computationally prohibitive beyond two or three degrees of separation, graph databases use relationship-focused algorithms suited for real-time analysis. By linking shared identifiers like phone numbers, physical addresses, or device IDs, the technology can surface coordinated fraud rings rather than isolated incidents. A real-world demo at a major bank in a corruption-prone country illustrated the power of the approach when the software inadvertently identified senior executives in the room as participants in a detected fraud ring. Despite the awkward outcome, the bank ultimately purchased the software, underscoring the effectiveness of graph-based entity resolution in uncovering financial crime.

Read the full story at DEV Community

This is an AI-generated summary. ShortSingh links to the original source for the complete article.

Discussion (0)

Sentiment Analysis Is Trickier Than Benchmarks Suggest, Experts Warn

Sentiment analysis is widely regarded as a solved problem, but practitioners argue the real challenge lies in poorly defined labels and mismatched tools rather than model quality. Researchers distinguish three distinct tasks — document polarity, aspect-based sentiment, and emotion or intent detection — each requiring different approaches and datasets. A common pitfall is negation handling, where standard preprocessing strips words like 'not,' causing models to misread negative statements as positive ones. Rule-based tools such as VADER offer a fast, free alternative for high-volume social text, while transformer models handle negation and context more reliably at greater computational cost. Studies, including Wallace et al. at ACL 2014, show that sarcasm and irony are fundamentally difficult even for human annotators, meaning no model can be reliably evaluated on examples where labelers themselves disagree.

0 comments Read more at DEV Community

ProgrammingDEV Community ·

How GPQA Benchmarks Measure AI Scientific Reasoning Beyond Search and Recall

Benchmarks like GPQA are designed to test genuine scientific reasoning in AI models by filtering out questions that skilled non-experts can answer using unrestricted web access and time. Domain experts write questions in their specialties, which are then vetted by peers and discarded if solvable through search, making the remaining score meaningful. The benchmark includes measured human baselines for both experts and non-experts, allowing a model's performance to be judged against a real human reference point rather than in isolation. A model scoring well above the non-expert baseline demonstrates real knowledge and multi-step reasoning across sciences, a capability absent in earlier model generations. However, the format has notable limits: multiple-choice structure allows elimination shortcuts, experimental design skills go untested, and contradictory or unverified real-world evidence is entirely absent from such question sets.

0 comments Read more at DEV Community

ProgrammingDEV Community ·

How to Handle Schema Versioning for AI Extraction Pipelines

When building AI-powered data extraction systems, schema changes over time can silently corrupt historical records if not managed carefully. Every extraction row depends on four inputs — the document, schema version, prompt version, and model ID — and changing any one makes new rows incomparable with older ones. Three types of schema changes exist: structural (renameable via pure transforms), additive (requiring a backfill decision), and semantic (where a field's meaning shifts invisibly, making old rows quietly incorrect). Semantic changes are the most dangerous because existing records still validate against the new schema while carrying the wrong meaning, requiring either a full re-extraction or treating old and new records as separate datasets. Storing all four identifiers with every record, including the resolved model ID rather than a provider alias, is essential for diagnosing accuracy shifts and writing reliable migrations.

0 comments Read more at DEV Community

ProgrammingDEV Community ·

Two-Stage LLM Design Solves the 200-Table Schema Problem

Feeding a full 200-table database schema into an LLM prompt is inefficient, even when it technically fits within the context window. A two-stage approach works better: a first cheap call uses a compact catalogue of roughly 5,000 tokens to identify relevant tables, while a second call receives only those selected tables in full detail. Sending all 200 tables wastes tokens, increases cost on every query, and causes the model to confuse similarly named columns across irrelevant tables. The key insight is that any given question typically involves fewer than six tables, making the rest noise. A read-only guarantee should also be enforced at the database level rather than relying on prompt instructions alone.

0 comments Read more at DEV Community