Patents by Inventor Vladimir Sevastyanov
Vladimir Sevastyanov 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).
-
Publication number: 20240004960Abstract: A processing system including at least one processor may obtain a data set comprising a plurality of records, each record associating at least one feature value of at least one feature with a value of a target variable. The processing system may next segregate the plurality of records into a plurality of subsets based upon a range of values of the at least one feature and calculate a plurality of sub-volumes for the plurality of subsets, each sub-volume comprising a sum of the values of the target variable from records in a respective subset. The processing system may then generate a significance metric that is based on a difference between a highest sub-volume and a lowest sub-volume of the plurality of sub-volumes and select the at least one feature to train a classification model associated with the target variable, based upon the significance metric.Type: ApplicationFiled: July 2, 2022Publication date: January 4, 2024Inventors: Vladimir Sevastyanov, James Pratt, Nikhlesh Agrawal, Abhay Dabholkar, Rakhi Gupta
-
Publication number: 20230359781Abstract: Aspects of the subject disclosure may include, for example, dividing a feature range of a feature into a plurality of subsets that span the feature range, calculating an average target variable value for each subset of the plurality of subsets, resulting in a plurality of average target variable values, and estimating a measure of feature significance with respect to a target variable by determining a difference between a maximum average target variable value and a minimum average target variable value in the plurality of average target variable values. Other embodiments are disclosed.Type: ApplicationFiled: May 4, 2022Publication date: November 9, 2023Applicant: AT&T Intellectual Property I, L.P.Inventors: Vladimir Sevastyanov, Abhay Dabholkar, Rakhi Gupta, James H. Pratt, Nikhlesh Agrawal
-
Publication number: 20230354051Abstract: Improving configuration of routing areas within an area of interest can include obtaining input data including a list of common language location identifiers within a defined area of interest and identification of a number of routing areas to be created within the area of interest; creating a bounding rectangle around the area of interest represented by the list of common language location identifiers; generating, within the bounding rectangle, a uniformly distributed sequence point; determining, from within the list of common language location identifiers, if the uniformly distributed sequence point is located in a particular common language location identifier of the list of common language location identifiers; if so, adding, to a list of kernel common language location identifiers the uniformly distributed sequence point; and if not, discarding the uniformly distributed sequence point.Type: ApplicationFiled: April 28, 2022Publication date: November 2, 2023Applicant: AT&T Intellectual Property I, L.P.Inventors: Vladimir Sevastyanov, Abhay Dabholkar, James Pratt, Rakhi Gupta, Nikhlesh Agrawal
-
Publication number: 20230104122Abstract: Facilitating achievement of equilibrium between supply and demand of resources is provided herein. Operations of a system include determining a first amount of resources that are to satisfy first requests in a first area, and a second amount of resources that are to satisfy second requests in a second area and comparing the first amount of resources with a first quantity of available resources in the first area, and the second amount of resources with a second quantity of available resources in the second area. Further, based on the first quantity of available resources being less than the first amount of resources and the second quantity of available resources being more than the second amount of resources: classifying the first area as an overloaded condition, classifying the second area as an underloaded condition, and moving a resource of the second quantity of available resources to the first area.Type: ApplicationFiled: October 5, 2021Publication date: April 6, 2023Inventors: Vladimir Sevastyanov, Abhay Dabholkar, Abhishek Mishra, Nikhlesh Agrawal
-
Publication number: 20230076592Abstract: Facilitating selection of the most significant set of categorical features in machine learning is provided herein. Operations of a system include determining a list of unique values of a categorical variable. The operations also include calculating respective mean values, of a target variable, for unique values of the list of unique values of the categorical variable. Further, the operations include sorting the list of unique values by the respective mean values, resulting in a sorted list. The operations also include calculating respective derivatives of the respective mean values in the sorted list considering the respective mean values as a function and a number of the respective mean values in the sorted list as an independent variable. Additionally, the operations include determining a minimum derivative value over the sorted list and outputting the minimum derivative value as a resulting variable significance value.Type: ApplicationFiled: September 7, 2021Publication date: March 9, 2023Inventors: James Pratt, Abhay Dabholkar, Vladimir Sevastyanov, Nikhlesh Agrawal
-
Patent number: 9141853Abstract: Various embodiments of the invention provide systems and methods for extracting information from digital documents, including physical documents that have been converted to digital documents. For example, some embodiments are configured to extract information from a field in a digital document by identifying a block of tokens before (i.e., a prior block) and a block of tokens after (i.e., a post block) the field from which the information is to be extracted, where both the prior block and post block are known to be associated with the field type of the field (e.g., name, address, phone number, etc.).Type: GrantFiled: November 13, 2013Date of Patent: September 22, 2015Assignee: First American Financial CorporationInventors: Christopher Lawrence Rubio, Vladimir Sevastyanov
-
Patent number: 8620079Abstract: Various embodiments of the invention provide systems and methods for extracting information from digital documents, including physical documents that have been converted to digital documents. For example, some embodiments are configured to extract information from a field in a digital document by identifying a block of tokens before (i.e., a prior block) and a block of tokens after (i.e., a post block) the field from which the information is to be extracted, where both the prior block and post block are known to be associated with the field type of the field (e.g., name, address, phone number, etc.).Type: GrantFiled: May 10, 2011Date of Patent: December 31, 2013Assignee: First American Data Tree LLCInventors: Christopher Lawrence Rubio, Vladimir Sevastyanov
-
Patent number: 8041545Abstract: Concurrent Gradients Analysis (CGA), and two multi-objective optimization methods based on CGA are provided: Concurrent Gradients Method (CGM), and Pareto Navigator Method (PNM). Dimensionally Independent Response Surface Method (DIRSM) for improving computational efficiency of optimization algorithms is also disclosed. CGM and PNM are based on CGA's ability to analyze gradients and determine the Area of Simultaneous Criteria Improvement (ASCI). CGM starts from a given initial point, and approaches the Pareto frontier sequentially stepping into the ASCI area until a Pareto optimal point is obtained. PNM starts from a Pareto-optimal point, and steps along the Pareto surface in the direction that allows improving a subset of objective functions with higher priority. DIRSM creates local approximations based on automatically recognizing the most significant design variables.Type: GrantFiled: August 18, 2006Date of Patent: October 18, 2011Inventors: Vladimir Sevastyanov, Oleg Shaposhnikov
-
Patent number: 7593834Abstract: The Exclusion of Regions Method (TERM) and Concurrent Gradients Method (CGM) for multi-objective optimization of objective functions considered in a multi-dimensional domain are provided. TERM decomposes the domain into a set of non-intersecting sub-regions, and applies a special criterion to each sub-region to determine if it does not contain Pareto-points. Non-prospective sub-regions are filtered out, while prospective ones are used for generating points-candidates, and their improvement by a recursive procedure until pre-assigned accuracy is achieved. CGM works as any gradient-based algorithm. But on each step CGM determines the area of simultaneous objective functions improvement and a direction for the next step in this area. The area is determined in a simple way based on gradients for each objective function calculated on current point.Type: GrantFiled: April 28, 2005Date of Patent: September 22, 2009Inventors: Lev Levitan, Vladimir Sevastyanov
-
Publication number: 20070005313Abstract: Concurrent Gradients Analysis (CGA), and two multi-objective optimization methods based on CGA are provided: Concurrent Gradients Method (CGM), and Pareto Navigator Method (PNM). Dimensionally Independent Response Surface Method (DIRSM) for improving computational efficiency of optimization algorithms is also disclosed. CGM and PNM are based on CGA's ability to analyze gradients and determine the Area of Simultaneous Criteria Improvement (ASCI). CGM starts from a given initial point, and approaches the Pareto frontier sequentially stepping into the ASCI area until a Pareto optimal point is obtained. PNM starts from a Pareto-optimal point, and steps along the Pareto surface in the direction that allows improving a subset of objective functions with higher priority. DIRSM creates local approximations based on automatically recognizing the most significant design variables.Type: ApplicationFiled: August 18, 2006Publication date: January 4, 2007Inventors: Vladimir Sevastyanov, Oleg Shaposhnikov
-
Patent number: 7113299Abstract: Printing over a network by inputting print data to be printed and associated credit card information at a host terminal, uploading a print job comprising the print data to be printed and the associated credit card information to a print data storage server, inputting credit card information at an input device that communicates with the print data storage server, transmitting print data stored in the print data storage server having associated credit card information that corresponds to the credit card information input at the input device, and printing the print data on a printing device. The uploaded print job may be marked as ready for printing such that the print data transmitted to the printing device is that which has been marked as ready for printing. In addition, a display of pending print jobs may be provided for a user to select a print job to print prior to the print data being transmitted to the input device.Type: GrantFiled: July 12, 2001Date of Patent: September 26, 2006Assignee: Canon Development Americas, Inc.Inventors: Stephanie Ann Suzuki, Rajini Bala Giridharagopal, Neil Y. Iwamoto, Vladimir Sevastyanov, Royce E. Slick, Martin Ervin Page, Katayoun Shoa, Yokichi Joe Tanaka, Paul Chen, Stephen Keung
-
Publication number: 20050246148Abstract: The Exclusion of Regions Method (TERM) and Concurrent Gradients Method (CGM) for multi-objective optimization of objective functions considered in a multi-dimensional domain are provided. TERM decomposes the domain into a set of non-intersecting sub-regions, and applies a special criterion to each sub-region to determine if it does not contain Pareto-points. Non-prospective sub-regions are filtered out, while prospective ones are used for generating points-candidates, and their improvement by a recursive procedure until pre-assigned accuracy is achieved. CGM works as any gradient-based algorithm. But on each step CGM determines the area of simultaneous objective functions improvement and a direction for the next step in this area. The area is determined in a simple way based on gradients for each objective function calculated on current point.Type: ApplicationFiled: April 28, 2005Publication date: November 3, 2005Inventors: Lev Levitan, Vladimir Sevastyanov
-
Patent number: 6417852Abstract: An interactive method of visualization and graphical analysis of functions considered in multi-dimensional domain is provided. The inventive method substitutes continuum objects represented by one or more functions by discrete approximation represented by a set of multi-dimensional points, to analyze the dataset graphically.Type: GrantFiled: January 19, 2001Date of Patent: July 9, 2002Inventor: Vladimir Sevastyanov
-
Publication number: 20020015051Abstract: An interactive method of visualization and graphical analysis of functions considered in multi-dimensional domain is provided. The inventive method substitutes continuum objects represented by one or more functions by discrete approximation represented by a set of multi-dimensional points, to analyze the dataset graphically.Type: ApplicationFiled: January 19, 2001Publication date: February 7, 2002Inventor: Vladimir Sevastyanov