Abstract: Incremental update of a neighbor graph via an orthogonal transform based indexing is disclosed. One example is a system including a hash transform module to apply an orthogonal transform to a data object in a data stream, and to associate the data object with a collection of ordered hash positions. An indexing module retrieves an index of ordered key positions, where each key position is indicative of data objects in the data stream that have a hash position at the key position. A neighbor determination module determines a ranked collection of neighbors for the data object in a neighbor graph, where the ranking is based on the index. A graph update module incrementally updates the neighbor graph by including the data object as a neighbor for a selected sub-plurality of data objects in the ranked collection.

Abstract: Incremental clustering of a data stream via an orthogonal transform based indexing is disclosed. One example is a system including an indexing module that retrieves a ranked neighbor list for a data object in a data stream, where the ranked list is based on an orthogonal transform based indexing of an incrementally updated nearest neighbor graph. A reverse neighbor determination module identifies a reverse neighbor list for the data object, the reverse neighbor list comprising previously received data objects that include the data object in their respective ranked lists. An evaluator determines a hub measure for the data object, where the hub measure is a size of the reverse neighbor list. A hub identification module determines, based on the hub measure, if the data object is a hub, where the hub is representative of a cluster of similar data objects.

Abstract: Incremental clustering of a data stream via an orthogonal transform based indexing is disclosed. One example is a system including an indexing module that retrieves a ranked neighbor list for a data object in a data stream, where the ranked list is based on an orthogonal transform based indexing of an incrementally updated nearest neighbor graph. A reverse neighbor determination module identifies a reverse neighbor list for the data object, the reverse neighbor list comprising previously received data objects that include the data object in their respective ranked lists. An evaluator determines a hub measure for the data object, where the hub measure is a size of the reverse neighbor list. A hub identification module determines, based on the hub measure, if the data object is a hub, where the hub is representative of a cluster of similar data objects.

Abstract: Incremental update of a neighbor graph via an orthogonal transform based indexing is disclosed. One example is a system including a hash transform module to apply an orthogonal transform to a data object in a data stream, and to associate the data object with a collection of ordered hash positions. An indexing module retrieves an index of ordered key positions, where each key position is indicative of data objects in the data stream that have a hash position at the key position. A neighbor determination module determines a ranked collection of neighbors for the data object in a neighbor graph, where the ranking is based on the index. A graph update module incrementally updates the neighbor graph by including the data object as a neighbor for a selected sub-plurality of data objects in the ranked collection.