Domain-Specific Algorithm

A Domain-Specific Algorithm is an algorithm that is customized apply to a limited range of tasks within a single task domain (domain-specific tasks).

• AKA: Domain Dependent Algorithm, Task Specific Algorithm.
• Context:
  • It can (typically) incorporate characteristics of the Domain that are not valid in another Domain.
  • It can incorporate a General Purpose Algorithm.
  • It can range from being a Highly Domain-Specific Algorithm to being a Lightly Domain-Specific Algorithm.
  • …
• 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):
  • a Sorting Algorithm, a General Purpose Algorithm.
  • a Supervised Learning Algorithm, a General Purpose Algorithm.
  • a Constraint Satisfaction Algorithm.
  • a Backtracking Algorithm.
• See: Domain Specific Task, Domain Independent Algorithm, Domain Specific Relation, Computing System.

---