# Re: Indexed algorithms for approximate structure matching

*From*: "Marius Amado Alves" <amado.alves@xxxxxxxxxx>*Date*: 30 Dec 2005 04:56:51 -0800

My favorite technique for approximate search is spreading activation.

You model the data as a brain-like graph. Then activate the query

node(s) and let the energy spread over the graph, until some

satisfaction condition is reach. Then typically the nodes with more

energy constitute the result. See this paper for details and

references:

Minibrain : a generic model of spreading activation in computers, and

example specialisations / Mário Amado Alves ; Alípio Jorge. - 10 p.

- In: ECML/PKDD 2005 workshop "Subsymbolic paradigms for learning in

structured domains"

PDFs available at http://www.liacc.up.pt/~maa/publications.htm

.

**References**:**Indexed algorithms for approximate structure matching***From:*yaoziyuan

**Re: Indexed algorithms for approximate structure matching***From:*yaoziyuan

- Prev by Date:
**Get the count of all distinct continguous and non-continguous subsequences of a long string** - Next by Date:
**Re: How to get number of paths between two vertices s and t in an undirected graph?** - Previous by thread:
**Re: Indexed algorithms for approximate structure matching** - Next by thread:
**Watch Window** - Index(es):