Domain Specific Algorithm: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
m (Text replacement - "<B><U>AKA</U>:</B>" to "<U>AKA</U>:") |
||
| Line 1: | Line 1: | ||
A [[Domain Specific Algorithm]] is an [[Algorithm]] that is customized apply to a limited range of [[task]]s within a single [[task domain]]. | A [[Domain Specific Algorithm]] is an [[Algorithm]] that is customized apply to a limited range of [[task]]s within a single [[task domain]]. | ||
* | * <U>AKA</U>: [[Domain Dependent Algorithm]], [[Task Specific Algorithm]]. | ||
* <B><U>Context</U>:</B> | * <B><U>Context</U>:</B> | ||
** It can incorporate a [[General Purpose Algorithm]]. | ** It can incorporate a [[General Purpose Algorithm]]. | ||
Revision as of 21:34, 17 August 2014
A Domain Specific Algorithm is an Algorithm that is customized apply to a limited range of tasks within a single task domain.
- AKA: Domain Dependent Algorithm, Task Specific Algorithm.
- Context:
- It can incorporate a General Purpose Algorithm.
- It incorporates characteristics of the Domain that are not valid in another Domain.
- It is an ordering. Some algorithms are more Domain Specific than others.
- Example(s):
- a Word Sense Disambiguation Algorithm.
- a Duplicate Record Detection Algorithm.
- a Subcellular Localization Recognition Algorithm is a Relation Recognition Algorithm that is customized to Recognize Semantic Relations in the Biology Domain.
- a Person Record Duplicate Detection Algorithm.
- a Citation Network Analysis Algorithm.
- Counter-Example(s):
- See: Domain Specific Task, Domain Independent Algorithm, Domain Specific Relation, Computing System.