Abstract: The present disclosure relates to optimizing one or more database tables that may include one or more redundant records. Records are clustered and assigned stable identifiers. In this manner, the underlying records within a cluster are not removed or deleted. As updates to the database are made, new clustering analyses are performed using the underlying records and any updates made. Newly identified clusters are reassigned stable identifiers.

Abstract: The present disclosure relates to fuse multiple database tables together. The fields of the database tables may be normalized using semantic fields. Under a first approach, database tables are deduplicated by consolidating redundant records. This may be done by performing pairwise comparisons to identify related pairs of records and then clustering the related pairs of records. Then, the deduplicated database tables are merged by performing another pairwise comparison. Under a second approach, the database tables may be concatenated. Thereafter, records are subject to pairwise comparisons and then clustered to create a merged database table.

Abstract: The present disclosure relates to optimizing one or more database tables that may include one or more redundant records. Records are clustered and assigned stable identifiers. In this manner, the underlying records within a cluster are not removed or deleted. As updates to the database are made, new clustering analyses are performed using the underlying records and any updates made. Newly identified clusters are reassigned stable identifiers.

Abstract: The present disclosure relates to optimizing one or more database tables that may include one or more redundant records. Records are clustered and assigned stable identifiers. In this manner, the underlying records within a cluster are not removed or deleted. As updates to the database are made, new clustering analyses are performed using the underlying records and any updates made. Newly identified clusters are reassigned stable identifiers.

Abstract: The present disclosure relates clustering similar data records together in a hierarchical clustering scheme. Each tier in a cluster corresponds to a minimal match score, which reflects a degree of confidence. In this respect, a higher confidence may lead to smaller sized clusters while a lower confidence may lead to larger sized clusters. Ordinal classification may be used to generate hierarchical clusters. In some embodiments, hierarchical clustering with conflict resolution is used to resolve user-defined hard conflicts in each tier of the clustering results.

Abstract: The present disclosure relates clustering similar data records together in a hierarchical clustering scheme. Each tier in a cluster corresponds to a minimal match score, which reflects a degree of confidence. A hierarchical cluster ID is generated for respective data records. The hierarchical cluster ID may be made up of a series of values, wherein each value reflects a tier within the hierarchical clustering scheme. A user may enter a partial hierarchical cluster ID to select clusters associated with a lower confidence. Thus, in some embodiments, the hierarchical cluster ID is variable in length in a manner that corresponds to the tiers in the hierarchical clustering scheme.

Abstract: The present disclosure relates clustering similar data records together in a hierarchical clustering scheme. Each tier in a cluster corresponds to a minimal match score, which reflects a degree of confidence. In this respect, a higher confidence may lead to smaller sized clusters while a lower confidence may lead to larger sized clusters. Ordinal classification may be used to generate hierarchical clusters. In some embodiments, hierarchical clustering with conflict resolution is used to resolve user-defined hard conflicts in each tier of the clustering results.

Abstract: The present disclosure relates to fuse multiple database tables together. The fields of the database tables may be normalized using semantic fields. Under a first approach, database tables are deduplicated by consolidating redundant records. This may be done by performing pairwise comparisons to identify related pairs of records and then clustering the related pairs of records. Then, the deduplicated database tables are merged by performing another pairwise comparison. Under a second approach, the database tables may be concatenated. Thereafter, records are subject to pairwise comparisons and then clustered to create a merged database table.

Abstract: The present disclosure relates clustering similar data records together in a hierarchical clustering scheme. Each tier in a cluster corresponds to a minimal match score, which reflects a degree of confidence. A hierarchical cluster ID is generated for respective data records. The hierarchical cluster ID may be made up of a series of values, wherein each value reflects a tier within the hierarchical clustering scheme. A user may enter a partial hierarchical cluster ID to select clusters associated with a lower confidence. Thus, in some embodiments, the hierarchical cluster ID is variable in length in a manner that corresponds to the tiers in the hierarchical clustering scheme.

Abstract: The present disclosure relates to fuse multiple database tables together. The fields of the database tables may be normalized using semantic fields. Under a first approach, database tables are deduplicated by consolidating redundant records. This may be done by performing pairwise comparisons to identify related pairs of records and then clustering the related pairs of records. Then, the deduplicated database tables are merged by performing another pairwise comparison. Under a second approach, the database tables may be concatenated. Thereafter, records are subject to pairwise comparisons and then clustered to create a merged database table.

Abstract: The present disclosure relates clustering similar data records together in a hierarchical clustering scheme. Each tier in a cluster corresponds to a minimal match score, which reflects a degree of confidence. A hierarchical cluster ID is generated for respective data records. The hierarchical cluster ID may be made up of a series of values, wherein each value reflects a tier within the hierarchical clustering scheme. A user may enter a partial hierarchical cluster ID to select clusters associated with a lower confidence. Thus, in some embodiments, the hierarchical cluster ID is variable in length in a manner that corresponds to the tiers in the hierarchical clustering scheme.

Abstract: The present disclosure relates clustering similar data records together in a hierarchical clustering scheme. Each tier in a cluster corresponds to a minimal match score, which reflects a degree of confidence. In this respect, a higher confidence may lead to smaller sized clusters while a lower confidence may lead to larger sized clusters. Ordinal classification may be used to generate hierarchical clusters. In some embodiments, hierarchical clustering with conflict resolution is used to resolve user-defined hard conflicts in each tier of the clustering results.

Abstract: The present disclosure relates to optimizing one or more database tables that may include one or more redundant records. Records are clustered and assigned stable identifiers. In this manner, the underlying records within a cluster are not removed or deleted. As updates to the database are made, new clustering analyses are performed using the underlying records and any updates made. Newly identified clusters are reassigned stable identifiers.

Abstract: Technologies are generally described for systems, methods and devices effective to remove information from a network such as the Internet. In some examples, a device may include a memory including instructions and a processor configured in communication with the memory. The processor may be configured effective to receive user information relating to a user and search the network using the user information. In response to the search, the processor may find additional information relating to the user stored in the network. The processor may receive a first request to remove particular information from the network. The particular information may be part of the additional information and the particular information may be removable by a second user. The processor may send a second request to remove the particular information from the network.

Abstract: In one example, a user interface may be configured to receive input from a hosting device, a transmitter may be configured to solicit competing bids to subscribing devices for a requested service based on the input from the hosting device, a queue may be configured to store bids from third-parties in response to the transmitted request for bids for the requested service, and a receiver may be configured to receive a manifestation of the requested service from one of the third-parties whose received bid was accepted.

Abstract: Technologies are provided for identifying context associated with received content and automatically forwarding the content to an associated communication network for posting. In some examples, a user may create content for posting to one or more communication networks and send the content over a network for posting to a first communication network. Upon receipt of the content for posting, the first communication network may identify a context of the received content and may associate the context with a second communication network based on a set of content forwarding rules. The first communication network may automatically forward the received content to the associated second communication network for posting at the second communication network. Additionally, a third party entity may be configured to monitor content received at a first communication network, identify a context of the received content, and automatically forward the received content to the associated second communication network for posting.

Abstract: Technologies are generally described for systems, methods and devices effective to remove information from a network such as the Internet. In some examples, a device may include a memory including instructions and a processor configured in communication with the memory. The processor may be configured effective to receive user information relating to a user and search the network using the user information. In response to the search, the processor may find additional information relating to the user stored in the network. The processor may receive a first request to remove particular information from the network. The particular information may be part of the additional information and the particular information may be removable by a second user. The processor may send a second request to remove the particular information from the network.

Abstract: Technologies are generally described for systems, methods and devices effective to remove information from a network such as the Internet. In some examples, a device may include a memory including instructions and a processor configured in communication with the memory. The processor may be configured effective to receive user information relating to a user and search the network using the user information. In response to the search, the processor may find additional information relating to the user stored in the network. The processor may receive a first request to remove particular information from the network. The particular information may be part of the additional information and the particular information may be removable by a second user. The processor may send a second request to remove the particular information from the network.

Abstract: Technologies are generally described for processes and systems effective to select or determine a wager for an event. A wager processor may be configured to be in communication with a wager database and an event status processor over a network. The wager processor may be effective to receive event information and crowd information. The event information may relate to a status of the event. The crowd information may relate to demographics and/or interests of the participants at the event. The wager processor may select or determine the wager based on the event information and the crowd information.

Abstract: A swim device comprising elongated foot pockets which surround each of the feet of the swimmer, continued distally with tapers ending in neckings connected in a functional manner to blades for each foot. The neckings of the tapers of both feet may be connected to one blade (monofin). A swim device comprising a cowling of generally elongated shape which surrounds both feet of the swimmer, continued distally with a taper, ending in a necking to which one blade (monofin) is connected in a functional manner. The tapers and the hydrodynamic cross-sections of the foot pockets and of the cowling, result in stronger thrust and lower drag than in the designs of prior art.