http://rdf.ncbi.nlm.nih.gov/pubchem/patent/CN-107798597-A

Outgoing Links

Predicate Object
assignee http://rdf.ncbi.nlm.nih.gov/pubchem/patentassignee/MD5_64a9502298bb8bf27a92457ab8c39e86
classificationCPCInventive http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06Q40-03
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F18-22
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F18-23
classificationIPCInventive http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06K9-62
http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06Q40-02
filingDate 2017-10-09^^<http://www.w3.org/2001/XMLSchema#date>
inventor http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_ca3a47c5b0132e41999748f901a53b1d
http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_3cf6d6da8590192d5323e2cc43cfe3a5
http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_441aaa86a360f2fe16449ae6ff378936
publicationDate 2018-03-13^^<http://www.w3.org/2001/XMLSchema#date>
publicationNumber CN-107798597-A
titleOfInvention A dynamic high-risk customer group detection method and system
abstract The present invention provides a dynamic high-risk customer group detection algorithm, which is used to detect the risk degree of new users belonging to different customer groups, including the following steps: i. Using a clustering algorithm based on multiple historical data of multiple historical users Building a plurality of historical user groups to form a plurality of customer groups, the clustering algorithm is related to the type of the historical data; a. determining the risk degree of each customer group based on the evaluation index, and dividing the risk degree The customer group greater than the risk threshold is determined as a high-risk customer group; b. Determine the similarity between the new user and the high-risk customer group based on a distance function, and the new user whose similarity is greater than the first similarity threshold Determined as a risk user, the type of user data of the new user described in the distance function is related, and the beneficial effects of the present invention are redefined here. The present invention is simple to operate and easy to use, and provides a dynamic risk customer group detection algorithm and corresponding system with high commercial value.
isCitedBy http://rdf.ncbi.nlm.nih.gov/pubchem/patent/US-11082452-B2
http://rdf.ncbi.nlm.nih.gov/pubchem/patent/US-11223645-B2
http://rdf.ncbi.nlm.nih.gov/pubchem/patent/CN-112508696-A
http://rdf.ncbi.nlm.nih.gov/pubchem/patent/CN-111324338-A
http://rdf.ncbi.nlm.nih.gov/pubchem/patent/CN-111612041-B
http://rdf.ncbi.nlm.nih.gov/pubchem/patent/CN-115391670-A
http://rdf.ncbi.nlm.nih.gov/pubchem/patent/US-11677790-B2
http://rdf.ncbi.nlm.nih.gov/pubchem/patent/CN-111724007-B
http://rdf.ncbi.nlm.nih.gov/pubchem/patent/CN-110008977-A
http://rdf.ncbi.nlm.nih.gov/pubchem/patent/CN-111724007-A
http://rdf.ncbi.nlm.nih.gov/pubchem/patent/CN-110008977-B
http://rdf.ncbi.nlm.nih.gov/pubchem/patent/CN-111476653-A
http://rdf.ncbi.nlm.nih.gov/pubchem/patent/WO-2020081608-A1
priorityDate 2017-10-09^^<http://www.w3.org/2001/XMLSchema#date>
type http://data.epo.org/linked-data/def/patent/Publication

Incoming Links

Predicate Subject
isCitedBy http://rdf.ncbi.nlm.nih.gov/pubchem/patent/CN-106897918-A
isDiscussedBy http://rdf.ncbi.nlm.nih.gov/pubchem/protein/ACCQ8HZP3
http://rdf.ncbi.nlm.nih.gov/pubchem/protein/ACCQ8HZP2
http://rdf.ncbi.nlm.nih.gov/pubchem/protein/ACCQ8HZP1
http://rdf.ncbi.nlm.nih.gov/pubchem/protein/ACCP48748
http://rdf.ncbi.nlm.nih.gov/pubchem/protein/ACCQ8HZN9
http://rdf.ncbi.nlm.nih.gov/pubchem/protein/ACCQ9BDQ5
http://rdf.ncbi.nlm.nih.gov/pubchem/protein/ACCQ61125
http://rdf.ncbi.nlm.nih.gov/pubchem/substance/SID419514609
http://rdf.ncbi.nlm.nih.gov/pubchem/compound/CID7753
http://rdf.ncbi.nlm.nih.gov/pubchem/protein/ACCQ95L01
http://rdf.ncbi.nlm.nih.gov/pubchem/protein/ACCP20433
http://rdf.ncbi.nlm.nih.gov/pubchem/protein/ACCQ42963
http://rdf.ncbi.nlm.nih.gov/pubchem/protein/ACCQ3BCU0
http://rdf.ncbi.nlm.nih.gov/pubchem/protein/ACCP97583
http://rdf.ncbi.nlm.nih.gov/pubchem/protein/ACCP46663

Showing number of triples: 1 to 45 of 45.