Theodore C Belding

US Patent:

20070179944, Aug 2, 2007

Filed:

Nov 22, 2006

Appl. No.:

11/562437

Inventors:

Henry Van Dyke Parunak - Ann Arbor MI, US
Theodore Belding - Ann Arbor MI, US
Sven Brueckner - Dexter MI, US
Paul Chiusano - Medford MA, US
Peter Weinstein - Saline MI, US

International Classification:

G06F 17/30

US Classification:

707005000

Abstract:

A clustering method yields a searchable hierarchy to speed retrieval, and can function dynamically with a changing document population. Nodes of the hierarchy climb up and down the emerging hierarchy based on locally sensed information. Like previous ant clustering algorithms, the inventive process is dynamic, decentralized, and anytime. Unlike them, it yields a hierarchical structure. For simplicity, and reflecting our initial application in the domain of textual information, the items being clustered are documents, but the principles may be applied to any collection of data items.

US Patent:

20120284269, Nov 8, 2012

Filed:

Feb 7, 2012

Appl. No.:

13/368036

Inventors:

Henry Van Dyke Parunak - Ann Arbor MI, US
Theodore C. Belding - Ann Arbor MI, US
Sven Brueckner - Dexter MI, US
Paul Chiusano - Medford MA, US
Peter Weinstein - Saline MI, US

International Classification:

G06F 17/30

US Classification:

707737, 707E17089

Abstract:

A clustering method yields a searchable hierarchy to speed retrieval, and can function dynamically with a changing document population. Nodes of the hierarchy climb up and down the emerging hierarchy based on locally sensed information. Like previous ant clustering algorithms, the inventive process is dynamic, decentralized, and anytime. Unlike them, it yields a hierarchical structure. For simplicity, and reflecting our initial application in the domain of textual information, the items being clustered are documents, but the principles may be applied to any collection of data items.