IP Library Granted Patent US 12,271,447
Granted Patent B2
US 12,271,447 · App. 17/494,405 · Granted Apr 8, 2025

Methods and servers for determining metric-specific thresholds to be used with a plurality of nested metrics for binary classification of a digital object

Inventors: Aleksey Vasilevich Toshchakov (Vologda, RU); Mikhail Mikhailovich Nosovsky (Moscow, RU); Artem Vladimirovich Meshcheryakov (Shchelkovo, RU)
Assignee: Y.E. Hub Armenia LLC
G06F18/241G06F18/217G06F18/2431G06N20/00
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,271,447
App. No.
17/494,405
Granted
Apr 8, 2025
Kind
B2
Abstract

Method and server for determining a target combination of metric-specific thresholds to be used with a plurality of nested metrics for performing binary classification of a digital object are disclosed. The method includes acquiring object-specific validation datasets, and a plurality of nested metrics thereon, thereby generating a plurality of prediction values. During a first iteration, the server compares predictions values against a first combination of metric-specific thresholds and generates first precision parameters and first recall parameters for the first iteration. During a second iteration, the server adjusts one of the first combination thereby generating a second combination, compares the predictions values against the second combination, and generates second precision parameters and second recall parameters for the second iteration. The method includes selecting, by the one of the first combination and the second combination as the target combination of metric-specific thresholds.

Claims (62)

1. A method of determining a target combination of metric-specific thresholds to be used with a plurality of nested metrics for performing binary classification of a digital object into a first class or a second class, the object being associated with past object events an indication of which is stored in a storage, the method executable by a server configured to access the storage, the method comprising:

acquiring, by the server, a plurality of object-specific validation datasets, a given one of the plurality of object-specific validation datasets comprising an indication of a plurality of past object events associated with a respective validation object and a ground-truth class of the respective validation object being one of the first class and the second class;

applying, by the server, a plurality of nested metrics onto the plurality of object-specific validation datasets, thereby generating a plurality of prediction values,

a given prediction value being indicative of a respective probability of the respective validation object belonging to one of the first class and the second class;

during a first iteration:

comparing, by the server, the plurality of predictions values against respective ones from a first combination of metric-specific thresholds for determining predicted classes of the respective validation objects for the first iteration;

generating, by the server, first precision parameters and first recall parameters for the plurality of nested metrics for the first iteration by comparing the ground-truth classes against the respective predicted classes of respective validation objects of the first iteration;

during a second iteration:

adjusting, by the server, one of the first combination of metric-specific thresholds thereby generating a second combination of metric-specific thresholds;

comparing, by the server, the plurality of predictions values against respective ones from the second combination of metric-specific thresholds for determining predicted classes of the respective validation objects for the second iteration;

generating, by the server, second precision parameters and second recall parameters for the plurality of nested metrics for the second iteration by comparing the ground-truth classes against the respective predicted classes of respective validation objects of the second iteration; and

selecting, by the server, one of the first combination of metric-specific thresholds and the second combination of metric-specific thresholds as the target combination of metric-specific thresholds by:

comparing at least one of (i) the first precision parameters and the second precision parameters against a precision threshold, and (ii) the first recall parameters and the second recall parameters against a recall threshold, and

the target combination of metric-specific thresholds to be used with the plurality of nested metrics in an in-use mode for performing binary classification of the digital object,

such that in response to an in-use predicted value of at least one of the plurality of nested metrics for the digital object being above a respective one of the target combination of metric-specific thresholds, determining the digital object to be of the first class.

2. The method of claim 1 , wherein the method further comprises:

performing, by the server, a plurality of iterations until at least one of (i) precision parameters for a given iteration are above the precision threshold, and (ii) recall parameters for the given iteration are above the recall threshold; and

selecting, by the server, a given combination of metric-specific thresholds from the given iteration as the target combination of metric-specific thresholds.

3. The method of claim 1 , wherein the method further comprises:

during the in-use mode:

acquiring, by the server, an object-specific dataset comprising an indication of a plurality of past object events associated with the object;

applying, by the server, a plurality of nested metrics onto the object-specific dataset, thereby generating one or more prediction values indicative of a respective probability of the object belonging to one of the first class and the second class;

comparing, by the server, the one or more prediction values against the respective ones from the target combination of metric-specific thresholds,

in response to at least one of the one or more prediction values being above the respective one from the target combination of metric-specific thresholds, determining, by the server, the object to be of the first class; and

in response to none of the one or more prediction values being above the respective one from the target combination of metric-specific thresholds, determining, by the server, the object to be of the second class.

4. The method of claim 1 , wherein a first metric from the plurality of nested metrics is based on a first type of object events, and wherein a second metric from the plurality of nested metrics is based on a second type of object events, the second type of object events occurring only if the first type of object events have occurred.

5. The method of claim 4 , wherein the second type of object events is a subset of the first type of object events.

6. The method of claim 1 , wherein the target combination of metric-specific thresholds is selected simultaneously for the plurality of nested metrics during a single iteration.

7. The method of claim 1 , wherein the object is a given email and the first class is spam and the second class is non-spam.

8. The method of claim 1 , wherein the object is a given user of an e-market platform and the first class is a fraudulent class and the second class is a non-fraudulent class.

9. The method of claim 1 , wherein the object is a given document and the first class is a relevant class and the second class is a non-relevant class.

10. A server for determining a target combination of metric-specific thresholds to be used with a plurality of nested metrics for performing binary classification of a digital object into a first class or a second class, the object being associated with past object events an indication of which is stored in a storage, the server configured to access the storage, the server being configured to:

acquire a plurality of object-specific validation datasets, a given one of the plurality of object-specific validation datasets comprising an indication of a plurality of past object events associated with a respective validation object and a ground-truth class of the respective validation object being one of the first class and the second class;

apply a plurality of nested metrics onto the plurality of object-specific validation datasets, thereby generating a plurality of prediction values,

a given prediction value being indicative of a respective probability of the respective validation object belonging to one of the first class and the second class;

during a first iteration:

compare the plurality of predictions values against respective ones from a first combination of metric-specific thresholds for determining predicted classes of the respective validation objects for the first iteration;

generate first precision parameters and first recall parameters for the plurality of nested metrics for the first iteration by comparing the ground-truth classes against the respective predicted classes of respective validation objects of the first iteration;

during a second iteration:

adjust one of the first combination of metric-specific thresholds thereby generating a second combination of metric-specific thresholds;

compare the plurality of predictions values against respective ones from the second combination of metric-specific thresholds for determining predicted classes of the respective validation objects for the second iteration;

generate second precision parameters and second recall parameters for the plurality of nested metrics for the second iteration by comparing the ground-truth classes against the respective predicted classes of respective validation objects of the second iteration; and

select one of the first combination of metric-specific thresholds and the second combination of metric-specific thresholds as the target combination of metric-specific thresholds by:

comparing at least one of (i) the first precision parameters and the second precision parameters against a precision threshold, and (ii) the first recall parameters and the second recall parameters against a recall threshold, and

the target combination of metric-specific thresholds to be used with the plurality of nested metrics in an in-use mode for performing binary classification of the digital object,

such that in response to an in-use predicted value of at least one of the plurality of nested metrics for the digital object being above a respective one of the target combination of metric-specific thresholds, determining the digital object to be of the first class.

11. The server of claim 10 , wherein the server is further configured to:

perform a plurality of iterations until at least one of (i) precision parameters for a given iteration are above the precision threshold, and (ii) recall parameters for the given iteration are above the recall threshold; and

select a given combination of metric-specific thresholds from the given iteration as the target combination of metric-specific thresholds.

12. The server of claim 10 , wherein the server is further configured to:

during the in-use mode:

acquire an object-specific dataset comprising an indication of a plurality of past object events associated with the object;

apply a plurality of nested metrics onto the object-specific dataset, thereby generating one or more prediction values indicative of a respective probability of the object belonging to one of the first class and the second class;

compare the one or more prediction values against the respective ones from the target combination of metric-specific thresholds,

in response to at least one of the one or more prediction values being above the respective one from the target combination of metric-specific thresholds, determine the object to be of the first class; and

in response to none of the one or more prediction values being above the respective one from the target combination of metric-specific thresholds, determine the object to be of the second class.

13. The server of claim 10 , wherein a first metric from the plurality of nested metrics is based on a first type of object events, and wherein a second metric from the plurality of nested metrics is based on a second type of object events, the second type of object events occurring only if the first type of object events have occurred.

14. The server of claim 13 , wherein the second type of object events is a subset of the first type of object events.

15. The server of claim 10 , wherein the target combination of metric-specific thresholds is selected simultaneously for the plurality of nested metrics during a single iteration.

16. The server of claim 10 , wherein the object is a given email and the first class is spam and the second class is non-spam.

17. The server of claim 10 , wherein the object is a given user of an e-market platform and the first class is a fraudulent class and the second class is a non-fraudulent class.

18. The server of claim 10 , wherein the object is a given document and the first class is a relevant class and the second class is a non-relevant class.

Assignments (5)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 9, 2024
From: DIRECT CURSUS TECHNOLOGY L.L.C
To: Y.E. HUB ARMENIA LLC
Reel/Frame 068534/0687 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 15, 2023
From: YANDEX EUROPE AG
To: DIRECT CURSUS TECHNOLOGY L.L.C
Reel/Frame 065692/0720 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 6, 2021
From: YANDEX.TECHNOLOGIES LLC
To: YANDEX LLC
Reel/Frame 057709/0375 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 6, 2021
From: YANDEX LLC
To: YANDEX EUROPE AG
Reel/Frame 057709/0378 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 5, 2021
From: TOSHCHAKOV, ALEKSEY VASILEVICH; NOSOVSKY, MIKHAIL MIKHAILOVICH; MESHCHERYAKOV, ARTEM VLADIMIROVICH
To: YANDEX.TECHNOLOGIES LLC
Reel/Frame 057706/0336 →
Priority Claims (1)
RU RU2020133324 · Oct 9, 2020 · national
Continuity (1)
Related Publication 20220114402A1 · Apr 14, 2022
References Cited (94)
US 5467006A · Sims · 1995 [cited by applicant]
US 7519562B1 · Vander et al. · 2009 [cited by applicant]
US 7610276B2 · Yomtobian · 2009 [cited by applicant]
US 7827054B2 · Campbell et al. · 2010 [cited by applicant]
US 7877800B1 · Satish et al. · 2011 [cited by applicant]
US 8578462B2 · Petrovic · 2013 [cited by applicant]
US 8661299B1 · Ip · 2014 [cited by applicant]
US 8966631B2 · El-Moussa et al. · 2015 [cited by applicant]
US 9047628B2 · Mislove et al. · 2015 [cited by applicant]
US 9092510B1 · Stets et al. · 2015 [cited by applicant]
US 9098459B2 · Davis et al. · 2015 [cited by applicant]
US 9183387B1 · Altman et al. · 2015 [cited by applicant]
US 9241010B1 · Bennett et al. · 2016 [cited by applicant]
US 9349134B1 · Adams et al. · 2016 [cited by applicant]
US 9479516B2 · Mote et al. · 2016 [cited by applicant]
US 9652354B2 · Filimonov et al. · 2017 [cited by applicant]
US 9672242B2 · Jung et al. · 2017 [cited by applicant]
US 9846896B2 · Shah et al. · 2017 [cited by applicant]
US 9866566B2 · Dulkin et al. · 2018 [cited by applicant]
US 9870596B2 · Babinowich et al. · 2018 [cited by applicant]
US 10009358B1 · Xie et al. · 2018 [cited by applicant]
US 10084816B2 · Zhang et al. · 2018 [cited by applicant]
US 10089660B2 · Luan et al. · 2018 [cited by applicant]
US 10218733B1 · Amidon et al. · 2019 [cited by applicant]
US 10348767B1 · Lee et al. · 2019 [cited by applicant]
US 10362057B1 · Wu · 2019 [cited by applicant]
US 10565372B1 · Stickle et al. · 2020 [cited by applicant]
US 20040260922A1 · Goodman et al. · 2004 [cited by applicant]
US 20050262026A1 · Watkins et al. · 2005 [cited by applicant]
US 20080162475A1 · Meggs et al. · 2008 [cited by applicant]
US 20080172271A1 · Wee et al. · 2008 [cited by applicant]
US 20080301090A1 · Sadagopan et al. · 2008 [cited by applicant]
US 20080301811A1 · Jung · 2008 [cited by applicant]
US 20090049547A1 · Fan · 2009 [cited by applicant]
US 20090083184A1 · Eisen et al. · 2009 [cited by applicant]
US 20090249480A1 · Osipkov et al. · 2009 [cited by applicant]
US 20100262688A1 · Hussain et al. · 2010 [cited by applicant]
US 20110055104A1 · Sun et al. · 2011 [cited by applicant]
US 20110208714A1 · Soukal et al. · 2011 [cited by applicant]
US 20120233692A1 · Oh et al. · 2012 [cited by applicant]
US 20130246302A1 · Black · 2013 [cited by applicant]
US 20130332468A1 · Hardas et al. · 2013 [cited by applicant]
US 20140114877A1 · Montano · 2014 [cited by applicant]
US 20140214570A1 · Smolev et al. · 2014 [cited by applicant]
US 20140258169A1 · Wong et al. · 2014 [cited by applicant]
US 20150095417A1 · Chetuparambil et al. · 2015 [cited by applicant]
US 20150205862A1 · Campagne et al. · 2015 [cited by applicant]
US 20150264073A1 · Tavakoli et al. · 2015 [cited by applicant]
US 20150326674A1 · Kruglick et al. · 2015 [cited by applicant]
US 20150332353A1 · Chauhan · 2015 [cited by applicant]
US 20150341383A1 · Reddy et al. · 2015 [cited by applicant]
US 20160065600A1 · Lee et al. · 2016 [cited by applicant]
US 20160196566A1 · Murali et al. · 2016 [cited by applicant]
US 20160259742A1 · Faulkner et al. · 2016 [cited by applicant]
US 20160294775A1 · Mahadik et al. · 2016 [cited by applicant]
US 20160321711A1 · Wouhaybi et al. · 2016 [cited by applicant]
US 20170171186A1 · Purushothaman et al. · 2017 [cited by applicant]
US 20170220971A1 · Giammaria et al. · 2017 [cited by applicant]
US 20170221111A1 · Salehi et al. · 2017 [cited by applicant]
US 20170230229A1 · Sasturkar et al. · 2017 [cited by applicant]
US 20170272458A1 · Muddu et al. · 2017 [cited by applicant]
US 20170288955A1 · Yin · 2017 [cited by applicant]
US 20180048658A1 · Hittel et al. · 2018 [cited by applicant]
US 20180114261A1 · Jayachandran · 2018 [cited by applicant]
US 20180124095A1 · Hamdi · 2018 [cited by applicant]
US 20180196684A1 · Pengfei et al. · 2018 [cited by applicant]
US 20180218295A1 · Hasija et al. · 2018 [cited by applicant]
US 20180278647A1 · Gabaev et al. · 2018 [cited by applicant]
US 20180357683A1 · Pickover et al. · 2018 [cited by applicant]
US 20190034986A1 · Robinson et al. · 2019 [cited by applicant]
US 20190064752A1 · Marwah et al. · 2019 [cited by applicant]
US 20190379700A1 · Canzanese et al. · 2019 [cited by applicant]
US 20200012981A1 · Davison et al. · 2020 [cited by applicant]
US 20200098018A1 · Narula · 2020 [cited by applicant]
US 20200311309A1 · Dawer et al. · 2020 [cited by applicant]
US 20200342006A1 · Rossi et al. · 2020 [cited by applicant]
US 20210271727A1 · Fan et al. · 2021 [cited by applicant]
CN 103853744A · 2014 [cited by applicant]
RU 2378692C2 · 2010 [cited by applicant]
WO 2018222797A1 · 2018 [cited by applicant]
WO 2019013771A1 · 2019 [cited by applicant]
Wever, Marcel, Felix Mohr, and Eyke Hüllermeier. “Ensembles of evolved nested dichotomies for classification.” In Proceedings of the Genetic and Evolutionary Computation Conference, pp. 561-568. 2018. (Year: 2018). [cited by examiner]
Yang, Gen, Sébastien Destercke, and Marie-Hélène Masson. “Cautious classification with nested dichotomies and imprecise probabilities.” Soft Computing 21 (2017): 7447-7462. (Year: 2017). [cited by examiner]
Kosmopoulos, Aris, Ioannis Partalas, Eric Gaussier, Georgios Paliouras, and Ion Androutsopoulos. “Evaluation measures for hierarchical classification: a unified view and novel approaches.” Data Mining and Knowledge Disc… [cited by examiner]
Notice of Allowance with regard to the counterpart U.S. Appl. No. 16/911,503 mailed Feb. 24, 2022. [cited by applicant]
Craw, “Using Word2Vec to Classify Review Keywords”, article published on Oct. 13, 2017, retrieved on Jul. 6, 2022, pp. 1-17. [cited by applicant]
Office Action issued on May 4, 2022 in respect of the related U.S. Appl. No. 16/869,828. [cited by applicant]
“Search Engine Click Spam Detection Based on Bipartite Graph Propagation” http://www.thuir.cn/group/˜YQLiu/publications/wsdm2014.pdf, published in WSDM '14 Proceedings of the 7th ACM international conference on Web sear… [cited by applicant]
Walgampaya “Cracking the Smart ClickBot”, Conference: 13th IEEE International Symposium on Web Systems Evolution, WSE 2011, Williamsburg, VA, USA, Sep. 30, 2011 Cite this publication, DOI: 10.1109/WSE.2011.6081830 , ret… [cited by applicant]
Yafeng “Positive Unlabeled Learning for Deceptive Reviews Detection”, Wuhan University, published in Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP), retrieved on Oct. 9, 2… [cited by applicant]
Jespersen, “Online reviews: How to figure out which are real and which are fake”, Article published on Apr. 26, 2019. [cited by applicant]
McCabe, “9 Ways to Spot a Fake Review (+How Amazon is Fighting Back)”, Article published on Mar. 1, 2019. [cited by applicant]
Notice of Allowance dated Mar. 8, 2023 received in respect of a related U.S. Appl. No. 16/869,828. [cited by applicant]
Russian Search Report dated Oct. 29, 2021 issued in respect of the related Russian Patent Application No. RU 2019126743. [cited by applicant]