𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Algorithmic procedure for finding semantically related journals

✍ Scribed by Alexander I. Pudovkin; Eugene Garfield

Publisher
John Wiley and Sons
Year
2002
Tongue
English
Weight
102 KB
Volume
53
Category
Article
ISSN
1532-2882

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An Algorithm for Finding Recurrence Rela
An Algorithm for Finding Recurrence Relations of Binomial Sums and its Complexity
✍ Nobuki Takayama πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 355 KB

A new algorithm to find recurrence relations of binomial sums and a complexity analysis are given. The algorithm is based on the theory of hypergeometric functions and algorithmic method to get contiguity relations of hyperegeometric functions.

A simple greedy algorithm for finding fu
A simple greedy algorithm for finding functional relations: efficient implementation and average case analysis
✍ Tatsuya Akutsu; Satoru Miyano; Satoru Kuhara πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 186 KB

Inferring functional relations from relational databases is important for the discovery of scientiΓΏc knowledge because many experimental data are represented in the form of tables and many rules are represented in the form of functions. A simple greedy algorithm has been known as an approximation al