Abstract: A data journaling method in a solid state storage device, the method including: receiving a read request; determining whether updated data mapping for the read request is located in at least one of a volatile journal and a nonvolatile journal using a Bloom filter; searching the volatile journal if the updated data mapping for the request is located in the Bloom filter, and then, searching the nonvolatile journal if the updated data mapping for the request is not found in the volatile journal; and stopping the search when the updated data mapping is found.

Abstract: It is proposed a device and method for finding nilcatenations, and proposes nilcatenation detection techniques, which can be applied to blockchains, and even constitute a proof of useful work, as the periodic removal of nilcatenations keeps a ledger size as small as possible. Banks and blockchains need to keep track of an ever-increasing list of transactions between the accounts owned by their users. However, as time goes by, many of these transactions can be safely “forgotten”, in the sense that purging a set of transactions that compensate each other does not impact the network's semantic meaning i.e. the vector Bt of amounts representing the balances of users at a given point in time t. Nilcatenation refers to a collection of past transaction vectors having no effect on Bt. Removing these transactions yields a smaller, but equivalent set of transactions.

Abstract: Extract, transform, and load application (ETL) complexity management framework systems and methods are described herein. The present disclosure describes systems and methods that reduce the complexity in managing ETL flow and correcting errant data that is subsequently identified. One or more methods include defining an ETL job definition, defining a data asset definition, defining a data asset dependency definition, receiving an ETL flow to provide execution of one or more ETL flow steps, providing retrieval of data from a source data asset, applying a data control to the source asset data, and producing an ETL job registration, a data asset status, a latest asset available date, a data asset consumer identifier, and a target data asset based on at least one of the ETL job definition, the data asset definition, the data dependency definition, and the source asset data.

Abstract: Disclosed herein are system, method, and computer program product embodiments for a data transfer and resource management system. An embodiment operates by retrieving both data and a schema from a table. A first offset corresponding to the retrieved data indicating a retrieval time of the retrieved data and a number of records is identified. It is determined that the retrieved data corresponds to the schema. The data is stored on a messaging platform and made available to one or more end users prior to a transfer to one or more cloud servers. A second offset corresponding to a number of records of the data retrieved by the one or more end users from the messaging platform is determined. It is validate that the second offset corresponds to the first offset. The records and the schema retrieved from the intermediary messaging platform are transferred to the one or more cloud servers.

Abstract: Techniques are provided for diverting, to cloned metadata, live access to original metadata of an application container that is being concurrently upgraded. In an embodiment, a database server stores, within an application container of an application, original metadata that defines objects for use by pluggable databases of the application. The database server receives a maintenance request to adjust the original metadata. The database server creates, in response to receiving the maintenance request, a reference container that contains cloned metadata that is a copy of the original metadata. The database server receives, during or after creating the reference container, a read request to read one of the objects. The database server concurrently performs both of: executing the maintenance request upon the original metadata, and executing the read request upon the cloned metadata of the reference container.

Abstract: Customization objects stored in a mobile database may be used to customize webpages and applications rendered in, or executed by a mobile application implemented by a mobile device. Upon authenticating the mobile application, a service provider may determine whether any customization objects have been updated since a previous authentication of the mobile application, and may update the mobile database with the updated customization objects. This way, the mobile device does not have to obtain customization objects from remote storage of the service provider each time a webpage is requested thereby reducing signaling overhead and decreasing webpage rendering time.

Abstract: Techniques for determining the state of data in database applications are described herein. Changes made to a first entry in a database table are recorded and an aggregate change is determined based at least in part on a data type of a second entry associated with the first entry. The second entry is then updated based at least in part on the aggregate change.

Abstract: In one embodiment, a method includes receiving from a first user a text query inputted by the first user using an I/O device associated with the client system, the I/O device including a first keyboard layout. The method also includes identifying one or more physical-proximity phrases corresponding to the text query based at least in part on the first keyboard layout and calculating a confidence score for each of the identified physical-proximity phrases based at least in part on a search history of the first user. The method also includes identifying one or more objects, where each identified object matches at least one of the identified physical-proximity phrases having a confidence score greater than a threshold confidence score and sending to the first user one or more search results corresponding to one or more of the identified objects, respectively.

Abstract: A method for multicategory classification of streaming data records includes receiving a list of signature rules, each comprising a Boolean expression of a set of atomic recognizers (ARs) of one or more input fields of an input record and an assignment of a signature if the Boolean expression evaluates to TRUE, generating a list of all signature contexts from the list of signature rules, generating a context lookup table for each context, and processing a stream of input records on which signature detection is performed by using said ARs, said list of signature contexts, and said context lookup table for each context, wherein each input record in the stream of input records is classified into one of a plurality of categories based on the signature detection result, wherein an amount of processing grows sublinearly with a number of signature rules being processed.

Abstract: Methods, devices, and systems may be used for semantics publishing and discovery. In an embodiment, a method for publishing semantics related resource identifiers may include adding a key word to an identifier of a semantics related resource and publishing the identifier to at least one of a sibling node and a child node. In another embodiment, a method may include using a Bloom filter to publish a semantics related resource. In another embodiment, a method may include publishing, by a semantics node, an identifier of a semantics related resource to a sibling node, while publishing a digest of the semantics node to a child node.

Abstract: A method and system is disclosed that identifies a job written in a first language. The job is to be performed in parallel on a plurality of nodes of a plurality of clusters. The first language describes functions supported by multiple frameworks but is not specific to any of the multiple frameworks. The method and system select one or more clusters from the plurality of clusters to run the job. The selected one or more clusters of the plurality of clusters operate a different framework from other clusters of the plurality of clusters. The method and system identify a second language associated with the selected one or more clusters. The method and system convert the first language of the job into the second language and cause the job in the second language to be run on the plurality of nodes of the selected one or more clusters.

Abstract: This disclosure presents systems and methods to facilitate artificial intelligence communications. One or more sensors may be configured to generate output signals conveying user behavior information and/or other information. The user behavior information may represent one or more communicative behaviors of a user in a real world. The one or more communicative behaviors may be interpreted based on communication structures of the one or more communicative behaviors to determine a meaning of a message conveyed by the one or more communicative behaviors. The communication structures may be categorized by structure type. The structure types may include one or more of a verbal type communication structure and/or a non-verbal type communication structure. Verbal type communication structure may refer to the conveyance of words via speech and/or non-speech communications. Non-verbal communication structure may refer to the conveyance of one or more of feelings, emotions, and/or impressions.

Abstract: Embodiments relate to a system, method, and device for index compilation to optimize index. Once a CREATE INDEX commands is fired, a first check determines if the user requested has to compile this index. If the index is to be compiled, a corresponding C-file is generated, and a DLL is generated out of the C-file. The DLL is then loaded with server. An INDEX DLL is natively compiled and generated corresponding to each INDEX during definition. The INDEX DLL will contain the required structure and method to perform on INDEX, based on the indexed column data-type.

Abstract: Automatically identifying insights from a dataset and presenting the insights graphically and in natural language text ranked by importance is provided. Different data types and structures in the dataset are automatic recognized and matched with a corresponding specific analysis type. The data is analyzed according to the determined corresponding analysis types, and insights from the analysis are automatically identified. The insights within a given insight type and between insight types are ranked and presented in order of importance. Insights include those having multiple pipelined attributes and other insights include multiple insights identified as having some relationship for the included insights.

Abstract: System, method, and computer program product to perform an operation comprising determining that a sort sequence of a query specifying to access data in a first column of a shared weight object based on a first selection predicate applied to the first column does not match a sort sequence of the shared weight object, adding a second selection predicate to the query based on the sort sequence of the first selection predicate and the shared weight sort sequence of the first column of the shared weight object, and executing the query by using the second selection predicate as a key selection against the first column in the shared weight object to return a result set, wherein the result set does not include a shared weight data value of a first row of the first column that would have been returned using the shared weight object to process the query.

Abstract: Data engine integration and data refinement are described. The actions include receiving, by a data refinement engine, a request for data. The actions include determining a first amount of processing to be performed by the data refinement engine and a second amount of processing to be performed by one or more processors of a data source that include a plurality of data nodes. The actions include transmitting, by the data refinement engine, code to the plurality of data nodes of instructions associated with the second amount of processing. The actions include receiving, by the data refinement engine and from the plurality of data nodes, unprocessed first data and processed second data. The actions include processing, by the data refinement engine, the unprocessed first data. The actions include, in response to the request for data, transmitting, by the data refinement engine, the processed first data and the processed second data.

Abstract: In one respect, there is provided a distributed database system. The distributed database system can include a plurality of hosts configured to store and/or manage data, a first query processing engine comprising a master node and an executor node, and a second query processing engine. The master node can be implemented on one or more programmable processors and configured to perform operations. The operations can include: generating an execution plan for a query on data that is stored at and/or managed by one or more of the plurality of hosts; determining to push down, to the second query processing engine, at least one data processing operations in the execution plan; and dispatching, to the executor node, at least a portion of the execution plan, the portion of the execution plan including the at least one data processing operation that is pushed down to the second query processing engine.

Abstract: Techniques herein optimize sort-merge join method for a band join. In an embodiment, for a query comprising a query block specifying a join between a first table and a second table, a band join condition is detected between the first table and the second table. Once the band join condition in detected, an execution plan is generated and executed. The execution of the execution plan includes: for a first row of at least a subset of first sorted rows, scanning second rows from a set of second sorted rows, joining each of said second rows with said first row, and ceasing to scan when encountering a row from the second sorted rows that falls outside a bound of said band join condition. Techniques also include parallelizing a workload by overlapping the distribution of rows to the same slave process and computing cost and cardinality estimation for enhanced band join.

Abstract: The present teaching relates to methods, systems, and programming for reconciling or merging real time data with bulk data. In one example, a first attribute value is obtained. The first attribute value characterizes an aspect of a data item. A second attribute value related to the first attribute value is obtained. The second attribute value characterizes the aspect of the data item. A scheme is selected to be used to determine a third attribute value to characterize the data item. The third attribute value is determined in accordance with the selected scheme as well as the first and second attribute values.

Abstract: Linking of a child table to a parent table in a database system. For a given parent table row, an expression associated with the particular row is identified. The expression may be a semantic expression that comprises something different than or more than an equals expression or a contains expression. The expression might also take as input a field of the parent table other than the primary key of the parent table. For each of multiple (and potentially all) rows of a child table, the expression is evaluated against a foreign key of the corresponding row of the child table. If the foreign key matches the expression, an association is created, and perhaps saved, between the foreign key and the particular row of the parent table. The expressions may differ even down to the granularity of a single row in the parent table, thereby enabling perhaps custom per-row expressions.

Abstract: Embodiments provide a migration instruction that effectuates the migration of a pluggable database from a source database server instance to a destination database server instance. Upon receiving the migration instruction, the migrating pluggable database is opened at the destination instance. Connections are terminated at the source instance at a rate that is determined based on statistics maintained for one or more of: the migrating pluggable database, the source instance, the destination instance, a container database, etc. Furthermore, once the migration instruction is received, a certain amount of time is provided before the source instance flushes the dirty buffers for the migrating pluggable database from the buffer cache of the source instance. The delay in flushing dirty buffers from buffer cache allows the source instance to provide data blocks, of the migrating pluggable database, directly to the destination database server instance from the cache.

Abstract: A pluggable database (PDB) that is encoded using a particular character set (differing character set) may be plugged into a container database (CDB) and queried, even when the CDB in which the particular PDB resides is encoded using a different character set. The DBMS records what character set is used to encode the PDB. Any predicate that may prune results from a PDB that is encoded in a differing character set is converted to the differing character set as needed, such that the predicate may be applied within the PDB to prune results. At times, cross-container views will require data from a PDB that is encoded using a differing character set. The data returned from a recursive query over the PDB is converted to being encoded using the character set of the root database of the CDB.

Abstract: A text query from a user may be received. Playlists associated with the text query may be identified. A relevance score may be calculated for each of the playlists based at least in part on a relevance of the corresponding playlist to the text query. Furthermore, content items may be identified where each of the content items is included in at least one of the playlists. For each of the identified content items, one or more playlists that includes the corresponding content item may be identified. A score for each of the content items may be calculated based on the relevance score for each of the playlists that includes the corresponding content item. Furthermore, a new playlist may be generated for the user based on the scores for each of the content items.

Abstract: A fast browsing architecture for exploring hierarchical lists of entities through a search user interface. A graphical UI operates to handle the hierarchical lists and sub-lists in different ways for different scenarios such as a hierarchical level is zero (only one list of entities associated with a query and the list cannot be further drilled down), a second scenario where the hierarchical level is one (a list of entities associated with the query and these entities can be further drilled down to a number of sub-lists) and the sub-lists cannot be further drilled down, and a third scenario where the hierarchical level is more than one (a list of entities associated with the query and these entities can be further drilled down to a number of sub-lists), sub-lists can be further drilled down to a number of lists, until there is no more drill down lists to be found.

Abstract: The disclosure provides a method and apparatus for processing search data. For a historical search query that includes a knowledge requirement, the disclosure mines entity information for the historical search query and uses that as an answer recommended to users. Thus, the accuracy of entity information recommended to users is improved, and the current problem of poor search results for a historical search query that includes a knowledge requirement is solved.

Abstract: Systems, methods, and computer-readable media for providing for display an estimated breadth indicator and/or search terms proximity for a result set of documents are disclosed. A method includes receiving a natural language search query including a plurality of search concepts, determining the plurality of search concepts from the natural language query, searching a database using the natural language search query to identify the result set of documents, where the result set of documents are identified based on the plurality of search concepts, calculating a breadth of the result set of documents, where the breadth is calculated from an estimated relevance score that is indicative of a degree to which the result set of documents are relevant to the search query, and providing for display, the breadth as a feedback meter element. The feedback meter element provides a visual indication of the breadth of the natural language search query.

Abstract: A method for ranking genealogical records includes using a machine learning model to rank multiple searched records based on relevancy. The relevancy may be determined by identifying features included in a record and scaling each feature by a corresponding weight factor. In addition, a method for training a machine learning model and increasing the convergence speed of the training is described. To train the model, a machine learning process is used to optimize a ranking performance metric. A set of weights corresponding to multiple features are used to rank multiple past search records in a training set. An initial set of the weights are set by the expectation values of the weights. The weights are incrementally changed to optimize the ranking performance metric. The step size of the increment is determined based on the sensitivity of the ranking performance metric relative to the step size.

Abstract: The present invention extends to methods, systems, and computer program products for forming data responsive to a query. Responding to a query can include selecting data views on top of data sources. A data catalog stores data elements from different data sources and stores links between data elements from the different data sources. A view can be selected for a query based on one or more of: classification of data included in the data catalog or prior usage of data included in the data catalog. A selected data view is populated with data elements from the data catalog using the links to determine that data elements spanning multiple data sources satisfy the query. The data catalog can be used to identify relationships between data elements from different data sources that would not otherwise be identified.

Abstract: Analyzing log data. The method includes obtaining a first bucket of a log data. The first bucket of log data includes a plurality of log lines. The method further includes analyzing the first bucket of log data to identify different sets of similar log lines. The method further includes providing to a user in a user interface one or more summaries of the different sets of similar lines. The summary comprises at least one user selectable indicator representing differences in log lines in a set of similar log lines that when selected by a user in the user interface reveals specific differences in the log lines in the set of similar log lines.

Abstract: The present invention provides a search capability to allow a user to easily locate a preference control, file, folder, control, or other system resource or data item associated with a search result. In one embodiment, a user enters a search term (or a portion thereof) in a search field associated with one or more resource types that may be searched. The user may be presented with a pop-up menu containing a list of likely matches. The user selects the desired preference control from the pop-up menu, and the corresponding preference pane, or other container, containing the selected data item, control, or other resource is displayed. In one aspect, as the user enters the search term (or portion thereof), certain icons are highlighted. Specifically, those icons that represent containers containing matching data items (such as preference panes having controls that match the search term) are highlighted.

Abstract: Disclosed are systems, methods, and non-transitory computer-readable storage media for shared folder backed integrated workspaces. In some implementations, a content management system can provide a graphical user interface (GUI) that integrates communications and content management into a single user interface. The user interface can include mechanisms that allow a user to provide input to generate a new workspace. The user interface can provide a mechanism to allow a user to view conversations related to the workspace and/or content items associated with the workspace. The user interface can present representations of content items associated with the workspace and allow the user to provide input to generate, view, edit, and share content items associated with the workspace.

Abstract: A system and method allowing customization of a user-interface into a data repository are disclosed. Customization options are provided via a hierarchy and/or compartmentalization of structured control files such as Extensible Markup Language (XML) files. The control files may be defined in a hierarchical fashion allowing a particular end-user or group of end-users to customize their interface without impacting other users of the same data and user-interface system. Compartmentalization of functions to specific files may also aid in ease of maintenance of customizations. Customization may include an ability to customize what data is shown on a screen and which capabilities are available on each screen for data interaction pertaining to a particular job responsibility. Capabilities to provide these and other customization options to an end-user are disclosed in a non-limiting embodiment of an import export trade transaction storage and retrieval system.

Abstract: Systems and methods for implementing extensible attributes in ETL are disclosed. In some examples, attributes configured at a source file may be extracted from the source file. The extracted attributes can be mapped to a target column of a data warehouse table, and then a dynamic ETL script may be generated. The dynamic script may be executed to move data associated with the attributes to an appropriate new column of the data warehouse.

Abstract: A technology is provided for delivering a data object to device. Data delivery instructions to distribute a data object to a device may be received at a delivery service and include a storage location of the data object, a messaging topic, and a size of data receivable by the device. The data object is then divided into blocks corresponding to the size of data receivable by the device. A messaging topic is identified to which the device is subscribed via a messaging service. The blocks are sent to the device using the messaging topic and a network protocol installed on the device.

Abstract: Systems, methods, and articles of manufacture provide for simplified and partially-automated data operation services, such as data transfer, storage, management, and analysis operations. Non-IT data consumers may, for example, initiate such data operations by providing only a subset of the required parameters for the operation, with the specially-coded system automatically fetching any missing parameters or values from one or more metadata stores and initiating the requested operation.

Abstract: Example implementations are directed to a system and method to reduce deployment cost of data analytics application by designing both an application deployment plan and data integration plan, implementing the plans into an application template automatically and deploying application components and data in accordance with the desired implementation. Through example implementations, the need for separate terminals for a data engineer and an application engineer can be eliminated.

Abstract: A method for synchronizing records stored at a first data storage location with records stored at a second, remote data storage location utilizes bitwise fingerprints and bitwise operations to determine records that exist in a first data set but not a second data set. A method for synchronizing records stored at a first data storage location with records stored at a second, remote data storage location utilizes bitwise fingerprints, and bitwise operations, and dynamic temporal segmentation to compare the timeliness of records in the first and second data sets.

Abstract: A database server receives a request from a client application for performing a data transaction on persistent data storage. The request is sent to a set of replication servers. An acknowledgement for the request is received from each replication server, including a start sequence number and an end sequence number for data that is stored in local cache of the replication server, and a latest committed sequence number for data that was written to the persistent data storage by the replication server. A maximum value of latest committed sequence numbers received from the set of replication servers is determined. For each replication server, it is examined whether there is a gap between the start sequence number for data stored in local cache and the maximum value of the latest committed sequence numbers. Based on the examining, it is determined whether there is an occurrence of loss of data.

Abstract: Systems and methods are provided for creating templates in an information management tool that are designed to track and timely and accurately report certain information in accordance with the requirements of a specific process, form or other requirement. Information relating to a user is obtained from one or more sources through electronic means, and the information is then organized and securely stored in a database using field mapping and other techniques to classify the information into specific categories. The information that is obtained and organized may include contact information, financial information, health information and historical information. The organized information may then be accessed by the user to automatically and instantaneously populate or supplement an electronic document, form or web-based application without requiring the user to manually enter the information.

Abstract: A method, system and computer program product for finding groups of potential duplicates in attribute values. Each attribute value of the attribute values is converted to a respective set of bigrams. All bigrams present in the attribute values may be determined. Bigrams present in the attribute values may be represented as bits. This may result in a bitmap representing the presence of the bigrams in the attribute values. The attribute values may be grouped using bitwise operations on the bitmap, where each group includes attribute values that are determined based on pairwise bigram-based similarity scores. The pairwise bigram-based similarity score reflects the number of common bigrams between two attribute values.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for instrumentation and control of workloads in a massively parallel processing database. Deployment is in a cluster which mirrors the cluster of the database to be controlled. The system includes data publishing modules, action agents, rules processing modules, deployment managers, rule compilation and management tools. Together these provide a distributed, fault tolerant system for the automated rules-based control of work in a database cluster. For example, in deploying an update, a deployment manager pushes the update to one or more nodes and instructs each of the one or more nodes to restart in a bootstrap mode. The deployment manager generates a respective configuration package for each of the one or more nodes, and restarts each of the one or more nodes in a production mode.

Abstract: The disclosure is related to mining of text to derive information from the text that is useful for a variety of purposes. The text mining process can be implemented in a service oriented industry such as a call center, where a customer and an agent engage in a dialog, e.g., to discuss product/service related issues. The messages in dialogues between the customers and the agents are tagged with features that describe an aspect of the conversation. The text mining process can mine various dialogues and identify a set of features and messages based on prediction algorithms. The identified set of features and messages can be used to infer an intent of a particular customer for contacting the agent, and to generate a recommendation based on the determined intent.

Abstract: In one embodiment, a method includes receiving, from a client system of a first user, a text query including one or more n-grams, including an ambiguous n-gram. The method includes searching multiple keyword generators to identify one or more keyword suggestions matching the ambiguous n-gram, each keyword generator having a particular type. The method includes calculating, by a particular scoring algorithm for each keyword generator, a keyword score for each identified keyword suggestion. The scoring algorithm includes multiple weighting factors chosen based on the type of the keyword generator. The method includes generating a set of suggested queries including at least a portion of the text query and one or more identified keyword suggestions and filtering suggested queries from the set based on privacy settings associated with the identified keyword suggestions. The method includes sending, to the client system, instructions for presenting one or more of the suggested queries.

Abstract: Techniques are presented herein for improved automatic suggestions based on group relevance. The techniques include determining groups of account based on the interactions of those accounts with content items, e.g., on a federated system, and ranking tokens extracted from those content items based at least in part on one or more factors. When a partial input is received from a particular account, tokens are ranked based on groups associated with the account and are presented in the user interface.

Abstract: A dialogue system including: an input receiving data relating to a speech or text signal originating from a user; and a processor configured to: update a system state based on the input data using a state tracker model, the system state including probability values associated with each of plural possible values for each of plural categories; identify one or more relevant categories based on at least part of the updated system state information using an identifier model; define a set of information from stored information including plural action functions and categories, excluding categories not identified as relevant; generate a reduced system state, including the probability values associated with one or more of the plural possible values for each relevant category; determine an action based on the reduced system state and the set of information using a policy model; output information specified by the determined action at an output.

Abstract: Systems and methods are disclosed for normalizing strings to identify computing resources and improve performance and utilization of computing resources. For example, methods may include determining a comparison length based on lengths of strings in a set of strings; padding a first string from the set of strings to the comparison length to obtain a padded string; receiving a second string; determining a distance between the second string and the padded string; and identifying a match between the first string and the second string based on the distance.

Abstract: Transient computing clusters can be temporarily provisioned in cloud-based infrastructure to run data processing tasks. Such tasks may be run by services operating in the clusters that consume and produce data including operational metadata. Techniques are introduced for tracking data lineage across multiple clusters, including transient computing clusters, based on the operational metadata. In some embodiments, operational metadata is extracted from the transient computing clusters and aggregated at a metadata system for analysis. Based on the analysis of the metadata, operations can be summarized at a cluster level even if the transient computing cluster no longer exists. Further relationships between workflows, such as dependencies or redundancies, can be identified and utilized to optimize the provisioning of computing clusters and tasks performed by the computing clusters.

Abstract: A neural network-based classifier system can receive a query including a media signal and, in response, provide an indication that the query corresponds to a specified media type or media class. The neural network-based classifier system can select and apply various models to facilitate media classification. In an example embodiment, a query can be analyzed for various characteristics, such as a noise profile, before it is input to the network-based classifier. If the query has greater than a specified threshold noise characteristic, then a successful classification can be unlikely and a classification process based on the query can be terminated before computational resources are expended. Query signals that meet or exceed a threshold condition can be provided to the network-based classifier for media classification. In an example embodiment, a remote device or a central media classifier circuit can determine a noise profile for a query.

Abstract: An aspect includes aggregating a plurality of disparate datasets into a document store with semi-structured attributes that includes a plurality of documents specifying a plurality of different geo spatial locations and a plurality of different environmental parameters. Niche model layers are generated for the environmental parameters at the geospatial locations based on contents of the document store. The niche model layers include a model layer for each of the different environmental parameters. An additional niche model layer is created for a derived environmental parameter at the geospatial locations based at least in part on one of the previously generated niche model layers. A future geospatial location of a species is predicted based on environmental attributes of the species and contents of at least a subset of the niche model layers. The predicted future geospatial location of the species overlaid on a geographic map is output.

Abstract: A set of data comprising heterogeneous data is processed in accordance with a data clustering algorithm so as to obtain an initial data cluster comprising homogeneous data. A supervised data cluster generated based on a human analysis of the set of data is obtained and compared with the initial data cluster to obtain a comparison result. The data clustering algorithm is modified based on the comparison result.