{"paper_id":"2311.00964","title":"On Finding Bi-objective Pareto-optimal Fraud Prevention Rule Sets for Fintech Applications","authors":["Chengyao Wen","Yin Lou"],"paper_date":"2023-11-02","paper_type":"empirical","paper_url":"https://arxiv.org/pdf/2311.00964v3","page_url":"https://thequant.space/flowcharts/on-finding-bi-objective-pareto-optimal-fraud-prevention-rule/","scores":{"empirical_rigor":8.5,"math_complexity":7,"quadrant":"Holy Grail"},"proposes":{"status":"available","statement":"The paper proposes SpectralRules, a novel sequential covering algorithm for diverse rule generation, and PORS, a heuristic framework for Pareto-optimal rule subsets.","quote":"We propose a novel variant of the sequential covering algorithm called SpectralRules that directly generates a compact pool of rules with high diversity, and demonstrate on both public and proprietary datasets that SpectralRules improves HV over existing tree-based approaches [16] for Stage 1.","summary":"Rules are widely used in Fintech institutions to make fraud prevention decisions, since rules are highly interpretable thanks to their intuitive if-then structure. In practice, a two-stage framework of fraud prevention decision rule set mining is usually employed in large Fintech institutions…","strategy":null},"assumptions":{"status":"none_found","items":[]},"datasets":{"status":"none_found","items":[],"known":[],"sample":{"start":null,"end":null,"market":null,"asset_class":null,"frequency":null},"data_resolution":"unclear"},"transaction_costs":{"status":"not_applicable","modeled":"n/a","headline_net_of_costs":null,"detail":null,"quote":null,"source":"front_matter","rule":"R3","candidates":{"front_matter":"n/a","evidence_card":"n/a","evidence_card_quoted":false},"meaning":"the paper reports no trading or execution result"},"results":{"status":"available","evaluation_type":"forecast-accuracy","findings":[{"finding":"SpectralRules improves hypervolume (HV) over existing tree-based approaches for Stage 1.","kind":"performance","quote":"We propose a novel variant of the sequential covering algorithm called SpectralRules ... that"},{"finding":"PORS with the hvc-ss SSF method outperforms CRSL on most public and proprietary datasets.","kind":"performance","quote":"PORS with hvc-ss outperforms CRSL on most cases."},{"finding":"There is a positive correlation between HV (intermediate metric) and recall (final objective).","kind":"statistical","quote":"we observe that there is a positive correlation between HV (as an intermediate evaluation metric) and recall (as a final objective)."},{"finding":"PORS algorithm converges quickly, whereas NSGA‑II is less efficient.","kind":"performance","quote":"PORS algorithm quickly converges while NSGA-II is less efficient."},{"finding":"High diversity of rules in Stage 1 leads to higher HV.","kind":"performance","quote":"Combined with results in Section 5.2, we conclude that high diversity in Stage 1"}],"reported_performance":null,"out_of_sample":{"method":"holdout","headline_out_of_sample":null}},"independent_evidence":{"status":"none_found","supports":[],"contradicts":[],"qualifies":[],"compared_with":40,"citations":{"cited_by_in_corpus":0,"by_independent_authors":0,"how_cited":{"used_as_baseline":0,"uses_method_or_data":0,"extends":0,"discusses_findings":0,"mentions":0,"unclassified":0},"independent_papers":[],"scope":"Citations between papers in this corpus only; citations from outside it are not counted."}},"implementation":{"status":"available","public":false,"code_url":null,"note":"No repository presented by the authors as their own was found in the paper. Absence here is not proof that no code exists."},"replication":{"status":"none_found","card":null,"note":"No replication of this paper has been run by thequant.space yet."},"extraction":{"text_source":"fulltext","model":"openai/gpt-oss-120b","version":1,"extracted_at":"2026-11-14T18:20:03Z"},"provenance":{"claims":"Everything here is what the authors state in the paper. Nothing was re-run or reproduced by the platform.","quotes":"Assumptions, datasets, cost detail and findings were extracted by a language model. Every quote is verbatim paper text. Where an item has `support`, \"full\" means every figure in it appears in the quoted sentences and \"partial\" means a figure is stated elsewhere in the paper; items with a figure found nowhere in the paper were discarded.","datasets_known":"datasets.known lists well-known vendors and public datasets by a stable id, found by a dictionary over the full text where the sentence says the data is used; it is independent of the model and covers only names in the dictionary.","flags":"transaction_costs.modeled, results.evaluation_type and results.out_of_sample.method are platform classifications (structured-decision models); see https://thequant.space/score-guide/#penalty-flags","comparisons":"supports / contradicts / qualifies are a language model's reading of two papers' quoted findings, restricted to closely related papers that share no author. They are pointers to read, not verified replications, and coverage is partial.","implementation":"code_url is a repository the paper itself presents as its own (rule-scored, ambiguous cases judged by a model), checked for liveness when it was recorded."},"docs":"https://thequant.space/agents/"}