Difference between pages "Talk:Endianness" and "Datamining for Forensics"
From Forensics Wiki
(Difference between pages)
(New page: There should probably be a redirect from little endian and big endian to this article. That way if someone searches for either of these terms they will be brought to this article. That's...) |
m (moved Datamining for Foresnics to Datamining for Forensics) |
||
| Line 1: | Line 1: | ||
| − | + | This page is a place-holder for algorithms and approaches that might be useful in dataming as applied for computer forensics. | |
| + | |||
| + | ==Algorithms== | ||
| + | * http://en.wikipedia.org/wiki/DBSCAN — DBScan clustering algorithm. | ||
| + | * http://en.wikipedia.org/wiki/Okapi_BM25 — Okapi BM25 — A ranking function used by search engines. | ||
| + | * http://en.wikipedia.org/wiki/Soundex — Soundex, for doing "sounds like" searching. | ||
Latest revision as of 02:29, 20 August 2011
This page is a place-holder for algorithms and approaches that might be useful in dataming as applied for computer forensics.
[edit] Algorithms
- http://en.wikipedia.org/wiki/DBSCAN — DBScan clustering algorithm.
- http://en.wikipedia.org/wiki/Okapi_BM25 — Okapi BM25 — A ranking function used by search engines.
- http://en.wikipedia.org/wiki/Soundex — Soundex, for doing "sounds like" searching.
