Approximate Matching Algorithm: Difference between revisions
Jump to navigation
Jump to search
m (Text replacement - "** ..." to "** …") |
m (Text replacement - "> ↵" to "> ") |
||
| Line 4: | Line 4: | ||
** It can make use of a [[Distance Function]]. | ** It can make use of a [[Distance Function]]. | ||
** … | ** … | ||
* <B>Example(s):</B> | * <B>Example(s):</B> | ||
** an [[Approximate String Matching Algorithm]]. | ** an [[Approximate String Matching Algorithm]]. | ||
** an [[Approximate Tuple Matching Algorithm]]. | ** an [[Approximate Tuple Matching Algorithm]]. | ||
** an [[Approximate Graph Matching Algorithm]]. | ** an [[Approximate Graph Matching Algorithm]]. | ||
** … | ** … | ||
* <B>Counter-Example(s):</B> | * <B>Counter-Example(s):</B> | ||
** an [[Exact String Matching Algorithm]]. | ** an [[Exact String Matching Algorithm]]. | ||
* <B>See:</B> [[Exact Matching Algorithm]]. | * <B>See:</B> [[Exact Matching Algorithm]]. | ||
Latest revision as of 02:41, 27 March 2024
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):
- Counter-Example(s):
- 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.