Approximate Matching Algorithm

An Approximate Matching Algorithm is a Matching Algorithm with a Probabilistic Output.

• AKA: Relatedness-Match Algorithm.
• Context:
  • It can make use of a Distance Function.
  • …
• Example(s):
  • an Approximate String Matching Algorithm.
  • an Approximate Tuple Matching Algorithm.
  • an Approximate Graph Matching Algorithm.
  • …
• Counter-Example(s):
  • an Exact String Matching Algorithm.
• See: Exact Matching Algorithm.

---

---

References

2009

• (Hu et al., 1999) ⇒ Xiaohua Hu, Xiaodan Zhang, Caimei Lu, E. K. Park, and Xiaohua Zhou. (2009). “Exploiting Wikipedia as External Knowledge for Document Clustering.” In: Proceedings of ACM SIGKDD Conference (KDD-2009). doi:10.1145/1557019.1557066
  • We develop two approaches, exact match and relatedness-match, to map text documents to Wikipedia concepts, and further to Wikipedia categories.

---