Patents by Inventor Parul Jain

Parul Jain has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 10474681
    Abstract: In an example, a method includes generating a targeted communication to respective computing devices of one or more members of an online social networking service, electronically collecting the responses to the targeted communication, mapping the responses to a cohort by updating a record in a database of members, the record identifying the cohort for the respective member, filtering information corresponding to a cohort to provide filtered cohort, and suppressing displaying of information corresponding to the cohort in response to the filtered information for the cohort indicating one or more of the biases being above a bias threshold value.
    Type: Grant
    Filed: September 26, 2017
    Date of Patent: November 12, 2019
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Krishnaram Kenthapadi, Stuart MacDonald Ambler, Parul Jain
  • Patent number: 10380145
    Abstract: A machine may be configured to generate a universal concept graph. For example, the machine generates an internal set of concept phrases based on an internal dataset including content from internal documents associated with a social networking service (SNS). The machine generates an external set of concept phrases based on an external dataset including content from external documents that are external to the SNS. The machine generates a set of nodes for a universal concept graph based on performing a union operation of the internal set of concept phrases and the external set of concept phrases. Each node corresponds to a particular concept phrase. The machine generates a set of edges among a plurality of nodes of the set of nodes based on one or more relationship indicators for pairs of nodes. The machine generates the universal concept graph based on the set of nodes and the set of edges.
    Type: Grant
    Filed: February 24, 2016
    Date of Patent: August 13, 2019
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Krishnaram Kenthapadi, Fedor Vladimirovich Borisyuk, Parul Jain
  • Publication number: 20190188591
    Abstract: The disclosed embodiments provide a system for processing data. During operation, the system obtains events reflecting responses by a user to job recommendations outputted to the user. Next, the system updates a set of features for the user from the events. The system then includes the updated set of features in a feature repository for use by a statistical model in generating a ranking of jobs for the user. Finally, the system retrains the statistical model using the events prior to using the statistical model to update the outputted job recommendations using the ranking.
    Type: Application
    Filed: December 18, 2017
    Publication date: June 20, 2019
    Applicant: Microsoft Technology Licensing, LLC
    Inventors: Kevin Kao, Benjamin Hoan Le, Vijay K. Dialani, Parul Jain, Caleb T. Johnson, Anthony D. Duerr
  • Patent number: 10255282
    Abstract: A machine may be configured to determining key concepts in documents. For example, the machine accesses a universal concept graph that includes a first set of nodes that represent concept phrases derived from internal documents associated with a social networking service (SNS) and external documents that are external to the SNS, and a first set of edges that connect a plurality of nodes of the first set of nodes. The machine accesses a content object associated with the SNS. The machine generates an induced concept graph associated with the content object based on an analysis of the content object and the universal concept graph. The machine identifies one or more key concept phrases in the content object based on applying one or more key concept selection algorithms to the induced concept graph. The machine stores the one or more key concept phrases in a record of a database.
    Type: Grant
    Filed: March 4, 2016
    Date of Patent: April 9, 2019
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Krishnaram Kenthapadi, Fedor Vladimirovich Borisyuk, Parul Jain
  • Publication number: 20190065612
    Abstract: A machine may be configured to identify top jobs for a member of a social networking service (SNS) based on a universal concept graph. For example, the machine accesses a first record that identifies a universal concept graph. The machine accesses a second record that identifies a first induced concept graph associated with a member profile of a member of the SNS. The machine identifies a numerical value that represents a desired number of job descriptions. The machine generates, for a job description, a similarity value based on the first induced concept graph and a second induced concept graph associated with the job description. The similarity value represents a degree of similarity between the member profile and the job description. The machine causes a presentation of identifiers of job descriptions in a user interface based on the numerical value and the similarity values associated with the identifiers of job descriptions.
    Type: Application
    Filed: August 24, 2017
    Publication date: February 28, 2019
    Inventors: Krishnaram Kenthapadi, Fedor Vladimirovich Borisyuk, Parul Jain
  • Publication number: 20190066054
    Abstract: A machine may be configured to identify top members of a social networking service (SNS) for a job based on a universal concept graph. For example, the machine accesses a first record that identifies a universal concept graph. The machine accesses a second record that identifies a first induced concept graph associated with a job description. The machine identifies a numerical value that represents a desired number of member profiles. The machine generates, for a member profile, a similarity value based on the first induced concept graph, and a second induced concept graph associated with the member profile. The similarity value represents a degree of similarity between the job description and the member profile. The machine causes a presentation of identifiers of member profiles in a user interface of a client device based on the numerical value and the similarity values associated with the identifiers of the member profiles.
    Type: Application
    Filed: August 24, 2017
    Publication date: February 28, 2019
    Inventors: Krishnaram Kenthapadi, Fedor Vladimirovich Borisyuk, Parul Jain
  • Publication number: 20180337784
    Abstract: Embodiments presented herein provide a partner authentication (PA) system that coordinates a network-based authorization process for an application. The PA system exchanges a series of messages with the application seeking an access token for a protected resource, an authorization server associated with the resource, and an agent executing on a device accessed by a user who wants the application to access the resource. The PA system and the agent communicate with the authorization server on behalf of the application throughout the authorization process. At the completion of the authorization process, the PA system receives an access token and a refresh token from the server on behalf of the application and sends a partner authorization (PA) token to the application. When the application seeks access to the resource that is available to authorized parties via the resource server, the application sends the PA token to the PA system and receives the access token in return.
    Type: Application
    Filed: July 14, 2017
    Publication date: November 22, 2018
    Inventors: Parul JAIN, Douglas L. FOILES, Nagaraj JANARDHANA
  • Publication number: 20180336525
    Abstract: A recommendation system is configured to perform some operations related to recommending jobs to a member after the member has logged in into the online social network system, and also configured to perform some of the operations related to recommending jobs preemptively, prior to detecting an indication that the member is logged in. The elements of the recommendation system that perform operations offline are termed an offline ranker. The elements of the recommendation system that perform operations online are termed an online ranker. The online ranker uses the values pre-computed by the offline ranker in selecting job postings to be recommended to a member represented by a subject member profile.
    Type: Application
    Filed: May 16, 2017
    Publication date: November 22, 2018
    Inventors: Krishnaram Kenthapadi, Parul Jain, Jian Wang
  • Publication number: 20180322463
    Abstract: Techniques for enhancing usability and electronic resource efficiency using job relevance are disclosed herein. In some embodiments, a list of a predetermined number of top job openings for a member of the social networking system is generated. The list is communicated to a device of the user for presentation in a user interface on the device. The user interface allows the member to browse through and provide an indication of a lack of relevancy of each of the list of the predetermined number of top job openings to the member and an indication of a reason for the lack of relevancy. Based on the user providing the indication of the lack of relevancy and the reason, a modified relevancy assessment of each of the plurality of job openings is generated. The list of the predetermined number of top job openings for the member is regenerated and communicated to the device.
    Type: Application
    Filed: May 5, 2017
    Publication date: November 8, 2018
    Inventors: Kumaresh Pattabiraman, Kevin Chuang, Dezhen Li, Kevin Kao, Parul Jain, Caleb Timothy Johnson, Anthony Duane Duerr, Mohammad Aleagha, Jeffrey Warren Lee, Minhtu Nguyen
  • Publication number: 20180322464
    Abstract: Techniques for enhancing usability and electronic resource efficiency using job relevance are disclosed herein. In some embodiments, a plurality of members of the social networking system are identified for which the new job is relevant. The job posting is identified as a top job posting for each of a subset of the plurality of members for which the new job is relevant, the identifying of the job posting as a top job posting including accessing an online data store that includes enhanced relevancy data, the enhanced relevancy data including real-time feedback provided by one or more of the plurality of members with respect to the values of the attributes specified within the job posting. A specialized notification of the top job posting is generated for each of the identified subset of the identified plurality of members.
    Type: Application
    Filed: May 5, 2017
    Publication date: November 8, 2018
    Inventors: Kumaresh Pattabiraman, Kevin Chuang, Dezhen Li, Jiuling Wang, Jason Wang, Kunal Mukesh Cholera, Parul Jain
  • Publication number: 20180300471
    Abstract: A data management system manages secured data for a plurality of users. The data management system utilizes an access authorization system to authenticate users seeking access to the data management system. The access authorization system provides access tokens to authenticated users. The access tokens enable the authenticated users to access the data management system without again providing authentication data. The access authorization system includes, for each user, an access policy that governs whether the users can use the access tokens to access the data management system. The access tokens have a finite lifetime. If the users use the access tokens within the finite lifetime and if the users satisfy all of the access rules of the access policies, then the lifetime of the access tokens can be extended a finite number of times.
    Type: Application
    Filed: April 18, 2017
    Publication date: October 18, 2018
    Applicant: Intuit Inc.
    Inventors: Parul Jain, Doug Foiles, Erik Peterson
  • Patent number: 10095753
    Abstract: In an example, a plurality of previously submitted confidential data values of a first confidential data type retrieved for a slice having one or more attributes. For a confidential data type, one or more submitted confidential data values of the confidential data type from the slice that are considered outliers based on an external data set or internal data set. A confidence score is calculated by multiplying a support score for the confidential data type in the slice by a non-outlier score for the confidential data type in the slice, the support score being equal to n?/(n?+c), where c is a smoothing constant and n? is the number of non-excluded submitted confidential data values of the confidential data type in the slice and the non-outlier score being equal to n?/n, where n is the total number of non-null submitted confidential data value of the confidential data type in the slice.
    Type: Grant
    Filed: September 28, 2016
    Date of Patent: October 9, 2018
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Krishnaram Kenthapadi, Stuart MacDonald Ambler, Parul Jain
  • Patent number: 10043019
    Abstract: In an example, a plurality of segments of percentile information indicating submitted confidential data values from users matching at least one attribute of a submitting user are retrieved. Then, for each of the segments, an interquartile range is calculated for a first and a second of a plurality of percentiles in the segment, an initial lower limit is computed for the segment by taking a maximum of zero or the difference between the value for the first of the plurality of percentiles and a product of a preset alpha parameter and the interquartile range, and interpolation is performed on values for the plurality of percentiles for the segment to obtain values for a third percentile. The initial lower limits and the interpolated values for the third percentiles are aggregated across the segments. A merged lower limit is determined by applying a function to the aggregated initial lower limits and aggregated interpolated values.
    Type: Grant
    Filed: September 28, 2016
    Date of Patent: August 7, 2018
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Krishnaram Kenthapadi, Stuart MacDonald Ambler, Parul Jain
  • Patent number: 10025939
    Abstract: In an example, a submission of a confidential data value of a first confidential data type is received from a first user with one or more attributes. A plurality of previously submitted confidential data values of a first confidential data type for a cohort matching the one or more attributes of the first user are retrieved. A plurality of percentiles for the confidential data values are calculated. Then, an interquartile range is calculated for a first and a second of the plurality of percentiles. A lower limit for the first confidential data type and the cohort is computed by taking a maximum of zero or the difference between the value for the first of the plurality of percentiles and a product of a preset alpha parameter and the interquartile range. Then it is determined if the confidential data value submitted by the user is lower than the lower limit.
    Type: Grant
    Filed: September 28, 2016
    Date of Patent: July 17, 2018
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Krishnaram Kenthapadi, Stuart MacDonald Ambler, Parul Jain
  • Publication number: 20180089196
    Abstract: In an example, a plurality of previously submitted confidential data values of a first confidential data type retrieved for a slice having one or more attributes. For a confidential data type, one or more submitted confidential data values of the confidential data type from the slice that are considered outliers based on an external data set or internal data set. A confidence score is calculated by multiplying a support score for the confidential data type in the slice by a non-outlier score for the confidential data type in the slice, the support score being equal to n?/(n?+c), where c is a smoothing constant and n? is the number of non-excluded submitted confidential data values of the confidential data type in the slice and the non-outlier score being equal to n?/n, where n is the total number of non-null submitted confidential data value of the confidential data type in the slice.
    Type: Application
    Filed: September 28, 2016
    Publication date: March 29, 2018
    Inventors: Krishnaram Kenthapadi, Stuart MacDonald Ambler, Parul Jain
  • Publication number: 20180089443
    Abstract: In an example, a submission of a confidential data value of a first confidential data type is received from a first user with one or more attributes. A plurality of previously submitted confidential data values of a first confidential data type for a cohort matching the one or more attributes of the first user are retrieved. A plurality of percentiles for the confidential data values are calculated. Then, an interquartile range is calculated for a first and a second of the plurality of percentiles. A lower limit for the first confidential data type and the cohort is computed by taking a maximum of zero or the difference between the value for the first of the plurality of percentiles and a product of a preset alpha parameter and the interquartile range. Then it is determined if the confidential data value submitted by the user is lower than the lower limit.
    Type: Application
    Filed: September 28, 2016
    Publication date: March 29, 2018
    Inventors: KRISHNARAM KENTHAPADI, Stuart MacDonald Ambler, Parul Jain
  • Publication number: 20180089442
    Abstract: In an example, a plurality of segments of percentile information indicating submitted confidential data values from users matching at least one attribute of a submitting user are retrieved. Then, for each of the segments, an interquartile range is calculated for a first and a second of a plurality of percentiles in the segment, an initial lower limit is computed for the segment by taking a maximum of zero or the difference between the value for the first of the plurality of percentiles and a product of a preset alpha parameter and the interquartile range, and interpolation is performed on values for the plurality of percentiles for the segment to obtain values for a third percentile. The initial lower limits and the interpolated values for the third percentiles are aggregated across the segments. A merged lower limit is determined by applying a function to the aggregated initial lower limits and aggregated interpolated values.
    Type: Application
    Filed: September 28, 2016
    Publication date: March 29, 2018
    Inventors: Krishnaram Kenthapadi, Stuart MacDonald Ambler, Parul Jain
  • Publication number: 20180046986
    Abstract: A referral system is provided with an on-line social network system. The referral system selects a set of (connected profile, job posting) pairs for presentation to a member of the on-line social network system who is an employee of a particular target organization, based on each pair's respective presentation score. The presentation score for a (connected profile, job posting) pair reflects likelihood that the employee refers a candidate represented by the connected profile from the (connected profile, job posting) pair for the job represented by the job posting from the (connected profile, job posting) pair.
    Type: Application
    Filed: January 5, 2016
    Publication date: February 15, 2018
    Inventors: Jian Wang, Rahul Aggarwal, Parul Jain, Harpaul Singh Sambhi
  • Publication number: 20180039944
    Abstract: A referral system is provided with an on-line social network system. The referral system accesses a member profile representing an employee of a certain company. For each job posting that represents a job at the target organization, the referral system generates a presentation score that reflects the likelihood of the employee referring someone from their network for the job represented by that job posting. The referral system uses respective presentation scores generated for the job postings to determine which of these job postings are to be selected for inclusion into a referral UI for presentation to the employee.
    Type: Application
    Filed: January 5, 2016
    Publication date: February 8, 2018
    Inventors: Jian Wang, Rahul Aggarwal, Parul Jain, Harpaul Singh Sambhi
  • Publication number: 20170255621
    Abstract: A machine may be configured to determining key concepts in documents. For example, the machine accesses a universal concept graph that includes a first set of nodes that represent concept phrases derived from internal documents associated with a social networking service (SNS) and external documents that are external to the SNS, and a first set of edges that connect a plurality of nodes of the first set of nodes. The machine accesses a content object associated with the SNS. The machine generates an induced concept graph associated with the content object based on an analysis of the content object and the universal concept graph. The machine identifies one or more key concept phrases in the content object based on applying one or more key concept selection algorithms to the induced concept graph. The machine stores the one or more key concept phrases in a record of a database.
    Type: Application
    Filed: March 4, 2016
    Publication date: September 7, 2017
    Inventors: Krishnaram Kenthapadi, Fedor Vladimirovich Borisyuk, Parul Jain