-- Method for node ranking in a linked database (PageRank) An application of Bayes' Theorem (1763) and heavily related to Markov chains (1906). Build a Markov

-- Method for node ranking in a linked database (PageRank) An application of Bayes' Theorem (1763) and heavily related to Markov chains (1906). Build a Markov chain of simulated users clicking around the internet and build its weights with Bayes' Theorem and you basically have PageRank. It's clever, but no more clever than what thousands of software engineers invent every day. https://en.wikipedia.org/wiki/Bayes%27_theorem https://en.wikipedia.org/wiki/Bayes%27_theorem https://en.wikipedia.org/wiki/Markov_chain https://en.wikipedia.org/wiki/Markov_chain -- RSA A pretty strong example, but largely based on Diffie-Hellman key exchange published a year before and known since 1969. At least this one was granted to its actual inventors. https://en.wikipedia.org/wiki/Diffie–Hellman_key_exchange#Cryptographic_explanation https://en.wikipedia.org/wiki/Diffie–Hellman_key_exchange#Cr... -- Support vector machine "The original SVM algorithm was invented by Vladimir N. Vapnik and Alexey Ya. Chervonenkis in 1964. In 1992, Bernhard Boser, Isabelle Guyon and Vladimir Vapnik suggested a way to create nonlinear classifiers by applying the kernel trick to maximum-margin hyperplanes. The "soft margin" incarnation, as is commonly used in software packages, was proposed by Corinna Cortes and Vapnik in 1993 and published in 1995." https://en.wikipedia.org/wiki/Support_vector_machine#History https://en.wikipedia.org/wiki/Support_vector_machine#History Patent issued in 2004 to none of the above people. Fail. Patent has FORTY YEARS of prior art. Should never have been issued. I personally remember SVMs being considered "old school" AI in my college AI class in 2005.