Conduent Business Services, LLC

Adobe, Inc.

International Business Machines Corporation

Koyel Mukherjee

Asmita Metrewar

Theja Tulabandhula

Narayanan Unny Edakunni

Pallavi Manohar

Gurulingesh Raravi

Sharmistha Jat

Raja Subramaniam Thangaraj

Ashish Verma

Yogish Sabharwal

Partha Dutta

Iftikhar Ahamath Burhanuddin

Subrata Mitra

Arun Rajkumar

Shrihari Vasudevan

Vibhor Porwal

Narendra Annamaneni

Ayush Chauhan

Shivam Pravin Bhosale

Sai Keerthana Karnam

Koushik Chattopadhyay

Harish Krishnamurthy

Ankit Kumar

Raunak Shah

Khushi

Alind Khare

Harsh Kesarwani

Karanpreet Singh

Dhruv Joshi

Kavya Barnwal

Rebin Silva V

Jonathan Ve Vance

Gadikoyila Satya Vamsi

Meenakshi Chembil Shaji

A dataset comprising tables is received. Embeddings are generated for column titles of a table. Based on the embeddings, similar tables are clustered. The tables are organized into smaller clusters based on statistical similarities. Similarity scores are calculated for tables within the same cluster. A relatedness graph is created based on the similarity scores; similar tables are represented by nodes connected by edges. If the similarity score for a pair of tables exceeds a threshold, a table is deleted.

Relating data in data lakes

Methods, systems, and non-transitory computer readable media are disclosed for intelligently generating comprehensive and relevant visual data stories from tabular data. The disclosed system can create data stories from a given dataset guided by some user selections to set a theme for the story. In particular, the disclosed system evaluates facts of a dataset to identify significant facts. The disclosed system can order significant facts to create a backbone for the data story based on user selections by utilizing a beam search. Furthermore, the disclosed system can expand the backbone of the data story by generating coherence facts. The disclosed system may present the generated story via a graphical user interface.

Generating visual stories from data sets

Some techniques described herein relate to determining how to optimally store datasets in a multi-tiered storage device with compression. In one example, a method includes assigning, to a data partition of a dataset, a priority based on access patterns of the data partition. Compression data is accessed describing results of compressing a data sample associated with the data partition using multiple compression schemes. Based both on the priority of the data partition and the compression data, a storage tier is determined for storing the data partition in the multi-tiered storage device. Further, based both on the priority of the data partition and the compression data, a compression scheme is determined for compressing the data partition for storage in the multi-tiered storage device. The data partition is compressed using the compression scheme to produce a compressed data partition, and the compressed data partition is stored in the storage tier.

Optimizing storage-related costs with compression in a multi-tiered storage device

Methods, systems, and computer program products for determining operating range of hyperparameters are provided herein. A computer-implemented method includes obtaining a machine learning model, a list of candidate values for a hyperparameter, and a dataset; performing one or more hyperparameter range trials based on the machine learning model, the list of candidate values for the hyperparameter, and the dataset; automatically determining an operating range of the hyperparameter based on the one or more hyperparameter range trials; and training the machine learning model to convergence based at least in part on the determined operating range.

Determining operating range of hyperparameters

The disclosed embodiments illustrate methods and systems for managing allocation of transportation services. The method includes receiving real-time vehicle data of vehicles of a plurality of service types from sensors associated with the vehicles. The method further includes detecting an availability status of each of the vehicles based on at least the received real-time vehicle data and a service request for a vehicle of a preferred service type for travel by a customer, to determine available service types. The method further includes rendering, in response to the service request, at least the available service types that comprises at least a flexible service type, at a user interface of a customer-computing device. The method further includes allocating the transportation services of the service provider to the customer based on a selection of a service type from the rendered plurality of available service types by the customer.

Method and system for managing allocation of transportation services

The disclosed embodiments illustrate method for displaying targeted multimedia items to a ridesharing group. The method includes transmitting a plurality of multimedia items to a computing device installed in a vehicle. The method further includes receiving at least one feedback provided by a plurality of users on each of the transmitted plurality of multimedia items. The method includes determining an effectiveness score for each of the transmitted plurality of multimedia items based on the corresponding at least one feedback provided by the plurality of users. The method includes selecting a plurality of targeted multimedia items from the plurality of multimedia items in real-time based on the determined effectiveness score and a pre-specified constraint. The method includes transmitting the selected plurality of targeted multimedia items in a prioritized order to the computing device. The transmitted plurality of targeted multimedia items is displayed to the plurality of users traveling in the vehicle.

Method and system for displaying targeted multimedia items to a ridesharing group

According to embodiments illustrated herein there is provided a method for transportation service recommendation. The method includes determining, one or more routes between a first location and a second location. The method further includes identifying one or more transportation services between each pair of adjacent intermediate nodes of a plurality of intermediate nodes, of the one or more routes. A pre-initiated pooled transportation service for at least a first pair of adjacent intermediate nodes, and a public transportation for at least a second pair of adjacent intermediate nodes are identified. The method further includes determining a likelihood to find one or more other users on a route at least between the first pair of adjacent intermediate nodes, if a user initiates a new-pooled transportation service in an event of unavailability of the pre-initiated pooled transportation service. Additionally, the method includes transmits one or more transportation service recommendations to the user.

Methods and systems for transportation service recommendation

The disclosed embodiments illustrate method of data processing for ridesharing management. The method includes retrieving multi-tier location data, comprising at least a plurality of clusters, of a geographical area from one or more data storage devices. The method further includes determining a set of available rides from a plurality of available rides in real time, associated with one or more source clusters and one or more destination clusters from the plurality of clusters. The method further includes rendering first information pertaining to the set of available rides through a first user-interface on the mobile computing device for user selection of at least one available ride from the set of available rides. The method further includes determining a shortest route for the selected at least one available ride, wherein second information pertaining to the determined shortest route is rendered through a second user-interface on the mobile computing device of the user.

Method and system for ridesharing management

Embodiments disclose methods and systems for forming one or more ride-sharing groups of a ride-sharing system before executing a ride. The system receives a request for a ride from each user, each request includes details related to the ride and the user. Then, a compatibility score for each pair of users is computed. Based on the computed score, a ride-sharing group is created including one or more members estimated to be compatible with each other. The ride-sharing group is displayed to each member of the ride-sharing group along with pre-defined details of each member. Then a feedback about the ride-sharing group from each group member is received, the feedback being in the form of an acceptance or a rejection. Based on the feedback, the ride-sharing group is updated to include one or more new members or allocate one or more resources to the ride-sharing group.

Methods and systems for automatically creating and suggesting compatible ride-sharing groups

The disclosed embodiments illustrate methods and systems for recommending one or more vehicles, commuting on a predefined route, for one or more requestors. The method includes determining a first additional distance traversable by each vehicle apart from the predefined route to accommodate each requestor. Further, a graph comprising a first set of nodes representing the one or more requestors, and a second set of nodes representing the one or more vehicles, is generated. Thereafter, a mapping between the first set of nodes and the second set of nodes is determined based on the first additional distance. The mapping corresponds to an allocation of a requestor to a vehicle such that an additional distance traversable by the vehicle is less than an additional distance traversable by remaining vehicles apart from the predefined route. Thereafter, the one or more vehicles are recommended for the one or more requestors based on the mapping.

Method and system for recommending one or more vehicles for one or more requestors

The disclosed embodiments illustrate methods and systems for scheduling one or more first vehicles along a route in a transportation system. The method includes determining one or more demands pertaining to a commutation along a route, where the route comprises at least one pair of stations such that there is a unique path between the pair of stations. The method further includes determining a set of constraints associated with the transportation system. The set of constraints are based on at least a count of second vehicles plying on one or more routes in the transportation system at a time instance, a capacity of a first vehicle, and a performance metric of the transportation system. Further, the method includes determining a count of first vehicles, for plying along the route at the time instance, based on at least the set of constraints.

Method and system for scheduling vehicles along routes in a transportation system

Growing community of inventors

Bengaluru, India

Koyel Mukherjee