Unsupervised edge map scoring: a statistical complexity approach

2013-02-21 · Javier Gimenez, Jorge Martinez, Ana Georgina Flesia

We propose a new Statistical Complexity Measure (SCM) to qualify edge maps without Ground Truth (GT) knowledge. The measure is the product of two indices, an \emph{Equilibrium} index $\mathcal{E}$ obtained by projecting the edge map into a family of edge patterns, and an \emph{Entropy} index $\mathcal{H}$, defined as a function of the Kolmogorov Smirnov (KS) statistic. This new measure can be used for performance characterization which includes: (i)~the specific evaluation of an algorithm (intra-technique process) in order to identify its best parameters, and (ii)~the comparison of different algorithms (inter-technique process) in order to classify them according to their quality. Results made over images of the South Florida and Berkeley databases show that our approach significantly improves over Pratt's Figure of Merit (PFoM) which is the objective reference-based edge map evaluation standard, as it takes into account more features in its evaluation.

📄 PDF Abstract BibTeX arXiv:1302.5186

Code (0)

등록된 구현이 없습니다.

Toward a Unified Statistical Theory of Unsupervised Pretraining and Supervised Neural Knowledge Graph Learning

2026-07-28 · Jifan Zhang, Miklos Racz, Suqi Liu arxiv

Knowledge graph learning provides a powerful framework for representing and inferring structured knowledge, with broad practical applications. However, the scarcity of relation-specific labeled triples per entity hinders…

Graph Learning

Optimal Scoring for Unsupervised Learning

2009-12-01 · NeurIPS 2009 12 · Zhihua Zhang, Guang Dai

We are often interested in casting classification and clustering problems in a regression framework, because it is feasible to achieve some statistical properties in this framework by imposing some penalty criteria. In t…

Clustering General Classification regression

ARES: Anomaly Recognition Model For Edge Streams

2025-11-27 · Simone Mungari, Albert Bifet, Giuseppe Manco, Bernhard Pfahringer arxiv

Many real-world scenarios involving streaming information can be represented as temporal graphs, where data flows through dynamic changes in edges over time. Anomaly detection in this context has the objective of identif…

Unsupervised Anomaly Detection

Learning Bayesian Networks: The Combination of Knowledge and Statistical Data

2013-02-27 · David Heckerman, Dan Geiger, David Maxwell Chickering

We describe algorithms for learning Bayesian networks from a combination of user knowledge and statistical data. The algorithms have two components: a scoring metric and a search procedure. The scoring metric takes a net…

Heuristic Search

Learning Gaussian Networks

2013-02-27 · Dan Geiger, David Heckerman