Change detection

Revision as of 21:49, 18 October 2007 by Jackbot (Talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

Change detection is a common way of determining when a discrete change occurs in a given sequence of data points. It is often used in data mining, statistics, and dynamic programming. One common example is trying to find a best-fit line for an "L-shaped" graph, where two distinct lines could be better used to minimize error.

References

  • Algorithm Design by Jon Kleinberg and Eva Tardos.
Template:Math-stub

Navigation WikiDoc | WikiPatient | Popular pages | Recently Edited Pages | Recently Added Pictures

Table of Contents In Alphabetical Order | By Individual Diseases | Signs and Symptoms | Physical Examination | Lab Tests | Drugs

Editor Tools Become an Editor | Editors Help Menu | Create a Page | Edit a Page | Upload a Picture or File | Printable version | Permanent link | Maintain Pages | What Pages Link Here
There is no pharmaceutical or device industry support for this site and we need your viewer supported Donations | Editorial Board | Governance | Licensing | Disclaimers | Avoid Plagiarism | Policies
Linked-in.jpg
Personal tools
Namespaces

Variants
Actions
Navigation
Toolbox