CN109635849A - A kind of target clustering method and system based on three c-means decisions - Google Patents
A kind of target clustering method and system based on three c-means decisions Download PDFInfo
- Publication number
- CN109635849A CN109635849A CN201811401683.6A CN201811401683A CN109635849A CN 109635849 A CN109635849 A CN 109635849A CN 201811401683 A CN201811401683 A CN 201811401683A CN 109635849 A CN109635849 A CN 109635849A
- Authority
- CN
- China
- Prior art keywords
- cluster
- target
- domain
- indicate
- value
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 36
- 238000011156 evaluation Methods 0.000 claims description 9
- 241001269238 Data Species 0.000 claims description 8
- 238000004364 calculation method Methods 0.000 claims description 8
- 238000012512 characterization method Methods 0.000 claims description 6
- 230000008569 process Effects 0.000 claims description 5
- 239000000203 mixture Substances 0.000 claims description 4
- 238000010801 machine learning Methods 0.000 abstract description 2
- 230000006870 function Effects 0.000 description 5
- 238000004458 analytical method Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 241000208340 Araliaceae Species 0.000 description 1
- 235000005035 Panax pseudoginseng ssp. pseudoginseng Nutrition 0.000 description 1
- 235000003140 Panax quinquefolius Nutrition 0.000 description 1
- 238000013480 data collection Methods 0.000 description 1
- 238000007418 data mining Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 235000008434 ginseng Nutrition 0.000 description 1
- 238000003064 k means clustering Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F18/00—Pattern recognition
- G06F18/20—Analysing
- G06F18/23—Clustering techniques
- G06F18/232—Non-hierarchical techniques
- G06F18/2321—Non-hierarchical techniques using statistics or function optimisation, e.g. modelling of probability density functions
- G06F18/23213—Non-hierarchical techniques using statistics or function optimisation, e.g. modelling of probability density functions with fixed number of clusters, e.g. K-means clustering
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/10—Services
- G06Q50/20—Education
- G06Q50/205—Education administration or guidance
Landscapes
- Engineering & Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Bioinformatics & Cheminformatics (AREA)
- Artificial Intelligence (AREA)
- Life Sciences & Earth Sciences (AREA)
- Bioinformatics & Computational Biology (AREA)
- Computer Vision & Pattern Recognition (AREA)
- Evolutionary Biology (AREA)
- Evolutionary Computation (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Probability & Statistics with Applications (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The present invention provides a kind of target clustering method and system based on three c-means decisions, belongs to machine learning clustering technique field.One cluster is modeled as the domain positive, the domain boundary and the domain negtive by the present invention, target data is assigned to the not same area of cluster according to the relativeness between the central point and target data of cluster, it is any simply by the presence of the applicable this method of the indefinite problem of cluster boundary, widely applicable, Clustering Effect is good.Further, in the central point of cluster calculates, its weight is determined according to the quantity in the domain positive and the domain boundary belonging to target, rather than use experience weight, clustering more efficiently can be carried out to target.
Description
Technical field
The present invention relates to machine learning clustering technique field, more particularly, to a kind of based on three c-means decisions
Target clustering method and system are clustered especially suitable for educational resource.
Background technique
With the development of data mining technology, more and more target clustering techniques are applied in class prediction, common
Application scenarios such as image dividing processing, biomedical identification, educational resource classification etc..By taking educational resource is classified as an example, root
According to various features of educational resource: such as type (video, text, exercise) uses duration (the average time used of resource
Length), frequency of use (number that resource is used in certain term) etc. can cluster out several different types of educational resources,
Its result can provide suggestion from application angle for the exploitation of educational resource.Further, with student information data Cooperative Analysis,
The exploitation of educational resource can be made more targeted.
The main purpose of target cluster is similar Target Assignment into a cluster, so that the target phase in the same cluster
It is high as far as possible like spending, and the target similarity in different clusters is low as far as possible.In traditional clustering method, each target can only belong to
In a cluster, such methods belong to hard clustering method.However as going deep into for application, hard clustering method encounters some problem,
One of them is exactly the uncertain border issue between cluster and cluster, i.e. some targets may be between multiple clusters, this just exceeds
The solution range of hard clustering method, and such issues that soft cluster is specific to.
Most important one kind technical solution is in soft cluster, using rough set (Rough Sets) or it is similar theoretical to cluster into
Then row modeling models target using fuzzy set (Fuzzy Sets) or similar theory, modeling will be finally completed
Cluster and target substitute into the frame of traditional k-means clustering algorithm.
The problem of two aspects are still highlighted in this kind of soft clustering method.On the one hand, the modeling of cluster is used a variety of similar
Theory, in addition to rough set, there are also shade collection (shadowed sets) etc., these theories are that a cluster is regarded as three domains:
One domain being made of the target for absolutely belonging to the cluster, a domain being made of the target that may belong to the cluster, one is
The domain that target by being unlikely to belong to the cluster forms.And present invention applicant has found, these theories have internal uniformity,
It can be summarized with three decision theories, but current soft clustering method does not use three decision theories to build cluster
Mould；On the other hand, when calculating cluster center, different weights is applied to the target in not same area, and these weights are roots
It is determined according to experience, such consequence is that cluster center is very sensitive to weighted value.Currently, the two aspects are urgent need to resolve
The problem of.
Summary of the invention
In view of the drawbacks of the prior art, technical purpose of the invention is the provision of a kind of target clustering method, uses three
Branch decision theory models cluster, more efficiently can carry out clustering to target.
In order to realize the technology of the present invention purpose, present invention employs following technical solutions:
A kind of target clustering method based on three c-means decisions, by a cluster ciBe modeled as the domain positive,
The domain boundary and the domain negtive, are expressed as POS (ci)、BND(ci) and NEG (ci)；Wherein, the positive of a cluster
Domain is made of the target for absolutely belonging to the cluster, and the domain boundary of a cluster is made of the target that may belong to the cluster, a cluster
The domain negtive be made of the target for being unlikely to belong to the cluster；
This method comprises the following steps:
(1) by target data x to be clusteredjIt is initially allocated to the domain positive of k cluster at random, wherein xj∈ U, U are
The set of all target data compositions to be clustered；
(2) central point of k cluster is calculated；
(3) according to calculated each central point, redistribute all target datas to k cluster not same area；
(4) it checks whether stopping criterion for iteration meets, (2) step is returned to if being unsatisfactory for, otherwise, terminate；
The step (3) redistributes all target datas to the specific implementation process of each cluster are as follows:
Define relation function r (ci,xj)=μij, μijIndicate target xjWith cluster ciThe fuzzy member value of similarity degree；
Opening relationships vector [r (c1,xj),r(c2,xj),…,r(ck,xj)]T=[μ1j,μ2j,…,μkj]T, indicate target xj
With the similarity degree of each cluster；
Defined feature functionTable
Show the maximum value for extracting relation vector；
Define relativeness functionTarget x is describedjWith cluster ciRelatively
The relativeness value of other clusters, the value is bigger to illustrate target xjWith cluster ciRelationship it is closer, value range be (0,1]；
The opposite ownership set of definitionTarget x is describedjThe gathering that may belong to
It closes；Wherein tmj,tnjIt is [t respectivelyij], maximum value and Second Largest Value in 1≤i≤k；It should
Cluster in set is target xjThe cluster that may belong to, if only one cluster of the set, target xjThe cluster will be assigned to
The domain positive, if the set there are two or the above cluster, target xjThe domain boundary of these clusters will be assigned to；
Establish evaluation functionTarget x is describedjWith cluster ciRelativeness value；α=1 is set,Then have the Clustering Model based on evaluation as follows:
A kind of target clustering system based on three c-means decisions, by a cluster ciBe modeled as the domain positive,
The domain boundary and the domain negtive, are expressed as POS (ci)、BND(ci) and NEG (ci)；Wherein, the positive of a cluster
Domain is made of the target for absolutely belonging to the cluster, and the domain boundary of a cluster is made of the target that may belong to the cluster, a cluster
The domain negtive be made of the target for being unlikely to belong to the cluster；
The system includes the following modules:
Original allocation module, for by target data x to be clusteredjIt is initially allocated to the domain positive of k cluster at random,
Wherein, xj∈ U, U are the set of all target data compositions to be clustered；
Center point calculation module, for calculating the central point of k cluster；
Distribution module is updated, for according to calculated each central point, redistributing all target datas to k cluster
Not same area；
Iteration ends determination module returns to central point meter for checking whether stopping criterion for iteration meets if being unsatisfactory for
Module is calculated, otherwise, is terminated；
The update distribution module redistributes all target datas to the specific implementation process of each cluster are as follows:
Define relation function r (ci, xj)=μij, μijIndicate target xjWith cluster ciThe fuzzy member value of similarity degree；
Opening relationships vector [r (c1, xj), r (c2, xj) ..., r (ck, xj)]T=[μ1j, μ2j..., μkj]T, indicate target xj
With the similarity degree of each cluster；
Defined feature functionTable
Show the maximum value for extracting relation vector；
Define relativeness functionTarget x is describedjWith cluster ciRelatively
The relativeness value of other clusters, the value is bigger to illustrate target xjWith cluster ciRelationship it is closer, value range be (0,1]；
The opposite ownership set of definitionTarget x is describedjThe gathering that may belong to
It closes；Wherein tmj, tnjIt is [t respectivelyij], maximum value and Second Largest Value in 1≤i≤k；It should
Cluster in set is target xjThe cluster that may belong to, if only one cluster of the set, target xjThe cluster will be assigned to
The domain positive, if the set there are two or the above cluster, target xjThe domain boundary of these clusters will be assigned to；
Establish evaluation functionTarget x is describedjWith cluster ciRelativeness value；α=1 is set,Then have the Clustering Model based on evaluation as follows:
Further, the calculation formula of the central point of the cluster is as follows:
Wherein, meaniIndicate cluster ciCentral point；POS(ci) indicate cluster ciThe domain positive, | POS (ci) | indicating should
The number of target in the domain cluster positive；BND(ci) indicate cluster ciThe domain boundary, | BND (ci) | indicate cluster boundary
The number of target, w in domainijIndicate target xjFor cluster ciWeight.
Further, the target xjFor cluster ciWeightμij∈Mxj, wherein μijIndicate target xj
With cluster ciThe fuzzy member value of similarity degree, MxjIndicate characterization target xjWith the fuzzy member value collection of affiliated cluster similarity degree
It closes.
Further, the characterization target xjWith cluster ciThe calculation method of the fuzzy member value of similarity degree are as follows:
Wherein, μijIndicate characterization target xjWith cluster ciThe fuzzy member value of similarity degree, the number of k expression cluster, 1≤i≤
K, 1≤j≤n, n are the target numbers in data set；dij, dljRespectively indicate target xjTo cluster ciWith cluster clEuclidean distance, ginseng
Number m > 1.
Further, three domains of the same cluster meet following condition:
Three domains of different clusters meet following condition:
Compared with existing clustering method, the target clustering method of the present invention based on three c-means algorithms.This
One cluster is modeled as by invention towards each boundary cluster uncertain problem common in practical clustering problem
The domain positive and the domain boundary, it is any simply by the presence of the applicable this method of the indefinite problem of cluster boundary, applicable surface
Extensively, Clustering Effect is good.
Further, when calculating cluster center the Upper approxiamtion according to belonging to target (domain positive and
The domain boundary) quantity determine its weight, rather than use experience weight can more efficiently carry out cluster point to target
Analysis.
With the application of the invention, clustering effectively can be carried out to various educational data collection, it is poly- especially suitable for student performance
The fields such as class, education resource cluster.
Detailed description of the invention
Fig. 1 is target clustering method flow chart of the present invention.
Specific embodiment
In order to make the objectives, technical solutions, and advantages of the present invention clearer, with reference to the accompanying drawings and embodiments, right
The present invention is further elaborated.It should be appreciated that the specific embodiments described herein are merely illustrative of the present invention, and
It is not used in the restriction present invention.As long as in addition, technical characteristic involved in the various embodiments of the present invention described below
Not constituting a conflict with each other can be combined with each other.
Specific implementation step of the invention is described in further detail below with reference to Fig. 1.
Step 1. inputs a D to be clustered and ties up educational resource data set, clusters number k, cutoff threshold ξ.
Step 2. initialization generates a random number for each dataThat is r be 1 and k it
Between natural number.According to this random number r, achievement data is assigned to some cluster ciThe domain positive.
Step 3. calculates the central point of each educational resource cluster.
Calculate the fuzzy member value of each data.According to formula (1), each data can be calculated relative to each poly-
The fuzzy member value of class, as shown in the table.
Calculate the domain positive or boundary which cluster is each data belong to.To any data xjCalculate itFor example, xjIn c1, c3, c4In upper approxima-tion Deng three cluster, then gather
Data are found out with respect to the fuzzy member value that these are clustered.To any data xjCalculate itFor example,Then have
The value is normalized, w is calculatedij。
Using normalized value as the mean of each cluster of weight calculation.
Step 4. redistributes data to each cluster according to the mean of each cluster.
Define relation function r (ci, xj)=μij。
Defined feature function
Define relativeness function
Define an opposite ownership set
Establish evaluation functionAchievement data is distributed to different clusters.
POS(ci)={ xj∈U|v(ci, xj)≥1}；
Step 5. checks termination condition.The step (5) checks the specific implementation process of termination condition are as follows: record changes every time
The mean of each cluster in generation, decision algorithm is restrained if the difference of the mean of each cluster with previous iteration is less than pre- cutoff threshold ξ；Or
Algorithm iteration 100 times；Above-mentioned termination condition meets first, then algorithm enters step 6, otherwise return step 3.
Step 6. exports the domain positive and the domain boundary of each cluster.
As it will be easily appreciated by one skilled in the art that the foregoing is merely illustrative of the preferred embodiments of the present invention, not to
The limitation present invention, any modifications, equivalent substitutions and improvements made within the spirit and principles of the present invention should all include
Within protection scope of the present invention.
Claims (8)
1. a kind of target clustering method based on three c-means decisions, by a cluster ciBe modeled as the domain positive,
The domain boundary and the domain negtive, are expressed as POS (ci)、BND(ci) and NEG (ci)；Wherein, the positive of a cluster
Domain is made of the target for absolutely belonging to the cluster, and the domain boundary of a cluster is made of the target that may belong to the cluster, a cluster
The domain negtive be made of the target for being unlikely to belong to the cluster；
It is characterized in that, this method comprises the following steps:
(1) by target data x to be clusteredjIt is initially allocated to the domain positive of k cluster at random, wherein xj∈ U, U are all
The set of target data composition to be clustered；
(2) central point of k cluster is calculated；
(3) according to calculated each central point, redistribute all target datas to k cluster not same area；
(4) it checks whether stopping criterion for iteration meets, (2) step is returned to if being unsatisfactory for, otherwise, terminate；
The step (3) redistributes all target datas to the specific implementation process of each cluster are as follows:
Define relation function r (ci,xj)=μij, μijIndicate target xjWith cluster ciThe fuzzy member value of similarity degree；
Opening relationships vector [r (c1,xj),r(c2,xj) ..., r (ck,xj)]T=[μ1j,μ2j,…,μkj]T, indicate target xjWith it is each
The similarity degree of a cluster；
Defined feature functionExpression mentions
Take the maximum value of relation vector；
Define relativeness functionTarget x is describedjWith cluster ciOther opposite clusters
Relativeness value, the value is bigger to illustrate target xjWith cluster ciRelationship it is closer, value range be (0,1]；
The opposite ownership set of definitionTarget x is describedjThe gathering that may belong to is closed；Wherein tmj,tnjIt is [t respectivelyij], maximum value and Second Largest Value in 1≤i≤k；The set
In cluster be target xjThe cluster that may belong to, if only one cluster of the set, target xjThe positive of the cluster will be assigned to
Domain, if the set there are two or the above cluster, target xjThe domain boundary of these clusters will be assigned to；
Establish evaluation functionTarget x is describedjWith cluster ciRelativeness value；α=1 is set,Then have the Clustering Model based on evaluation as follows:
2. the target clustering method according to claim 1 based on three c-means decisions, which is characterized in that the cluster
Central point calculation formula it is as follows:
Wherein, meani indicates cluster ciCentral point；POS(ci) indicate cluster ciThe domain positive, | POS (ci) | indicate the cluster
The number of target in the domain positive；BND(ci) indicate cluster ciThe domain boundary, | BND (ci) | indicate the domain cluster boundary
The number of middle target, wijIndicate target xjFor cluster ciWeight.
3. the target clustering method according to claim 2 based on three c-means decisions, which is characterized in that the mesh
Mark xjFor cluster ciWeightWherein, μijIndicate target xjWith cluster ciThe fuzzy of similarity degree
Member value,Indicate characterization target xjWith fuzzy member's value set of affiliated cluster similarity degree.
4. the target clustering method according to claim 3 based on three c-means decisions, which is characterized in that the table
Levy target xjWith cluster ciThe calculation method of the fuzzy member value of similarity degree are as follows:
Wherein, μijIndicate characterization target xjWith cluster ciThe fuzzy member value of similarity degree, the number of k expression cluster, 1≤i≤k, 1≤
J≤n, n are the target numbers in data set；dij,dljRespectively indicate target xjTo cluster ciWith cluster clEuclidean distance, parameter m > 1.
5. the target clustering method according to claim 1 or 2 or 3 or 4 based on three c-means decisions, feature exist
In,
Three domains of the same cluster meet following condition:
Three domains of different clusters meet following condition:
6. a kind of target clustering system based on three c-means decisions, by a cluster ciBe modeled as the domain positive,
The domain boundary and the domain negtive, are expressed as POS (ci)、BND(ci) and NEG (ci)；Wherein, the positive of a cluster
Domain is made of the target for absolutely belonging to the cluster, and the domain boundary of a cluster is made of the target that may belong to the cluster, a cluster
The domain negtive be made of the target for being unlikely to belong to the cluster；
It is characterized in that, the system includes the following modules:
Original allocation module, for by target data x to be clusteredjIt is initially allocated to the domain positive of k cluster at random, wherein
xj∈ U, U are the set of all target data compositions to be clustered；
Center point calculation module, for calculating the central point of k cluster；
Distribution module is updated, the difference for according to calculated each central point, redistributing all target datas to K cluster
Domain；
Iteration ends determination module returns to central point if being unsatisfactory for and calculates mould for checking whether stopping criterion for iteration meets
Otherwise block terminates；
The update distribution module redistributes all target datas to the specific implementation process of each cluster are as follows:
Define relation function r (ci,xj)=μij, μijIndicate target xjWith cluster ciThe fuzzy member value of similarity degree；
Opening relationships vector [r (c1,xj),r(c2,xj),…,r(ck,xj)]T=[μ1j,μ2j,…,μkj]T, indicate target xjWith it is each
The similarity degree of a cluster；
Defined feature functionExpression mentions
Take the maximum value of relation vector；
Define relativeness functionTarget x is describedjWith cluster ciOther opposite clusters
Relativeness value, the value is bigger to illustrate target xjWith cluster ciRelationship it is closer, value range be (0,1]；
The opposite ownership set of definitionTarget x is describedjThe gathering that may belong to is closed；Wherein tmj,tnjIt is [t respectivelyij], maximum value and Second Largest Value in 1≤i≤k；The set
In cluster be target xjThe cluster that may belong to, if only one cluster of the set, target xjThe positive of the cluster will be assigned to
Domain, if the set there are two or the above cluster, target xjThe domain boundary of these clusters will be assigned to；
Establish evaluation functionTarget x is describedjWith cluster ciRelativeness value；α=1 is set,Then have the Clustering Model based on evaluation as follows:
7. the target clustering method according to claim 6 based on three c-means decisions, which is characterized in that the cluster
Central point calculation formula it is as follows:
Wherein, meaniIndicate cluster ciCentral point；POS(ci) indicate cluster ciThe domain positive, | POS (ci) | indicate the cluster
The number of target in the domain positive；BND(ci) indicate cluster ciThe domain boundary, | BND (ci) | indicate the domain cluster boundary
The number of middle target, wijIndicate target xjFor cluster ciWeight.
8. the target clustering method according to claim 7 based on three c-means decisions, which is characterized in that the mesh
Mark xjFor cluster ciWeightWherein, μijIndicate target xjWith cluster ciThe fuzzy of similarity degree
Member value,Indicate characterization target xjWith fuzzy member's value set of affiliated cluster similarity degree.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811401683.6A CN109635849A (en) | 2018-11-22 | 2018-11-22 | A kind of target clustering method and system based on three c-means decisions |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811401683.6A CN109635849A (en) | 2018-11-22 | 2018-11-22 | A kind of target clustering method and system based on three c-means decisions |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109635849A true CN109635849A (en) | 2019-04-16 |
Family
ID=66069067
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811401683.6A Pending CN109635849A (en) | 2018-11-22 | 2018-11-22 | A kind of target clustering method and system based on three c-means decisions |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109635849A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110517748A (en) * | 2019-08-29 | 2019-11-29 | 燕山大学 | A kind of artificial pancreas Model Predictive Control Algorithm of bidifly element based on three decisions |
| CN112418522A (en) * | 2020-11-23 | 2021-02-26 | 重庆邮电大学 | Industrial heating furnace steel temperature prediction method based on three-branch integrated prediction model |
-
2018
- 2018-11-22 CN CN201811401683.6A patent/CN109635849A/en active Pending
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110517748A (en) * | 2019-08-29 | 2019-11-29 | 燕山大学 | A kind of artificial pancreas Model Predictive Control Algorithm of bidifly element based on three decisions |
| CN112418522A (en) * | 2020-11-23 | 2021-02-26 | 重庆邮电大学 | Industrial heating furnace steel temperature prediction method based on three-branch integrated prediction model |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110458187B (en) | Malicious code family clustering method and system | |
| Song et al. | Active learning with confidence-based answers for crowdsourcing labeling tasks | |
| CN110264471A (en) | A kind of image partition method, device, storage medium and terminal device | |
| CN112132014B (en) | Target re-identification method and system based on non-supervised pyramid similarity learning | |
| CN104156945B (en) | Gray-scale image segmentation method based on multi-objective particle swarm algorithm | |
| CN106897727A (en) | A kind of user's gender identification method and device | |
| CN104954185B (en) | A kind of cloud computing load predicting method based on depth confidence net | |
| CN105760888A (en) | Neighborhood rough set ensemble learning method based on attribute clustering | |
| CN105184772A (en) | Adaptive color image segmentation method based on super pixels | |
| CN101196905A (en) | Intelligent pattern searching method | |
| JP6172317B2 (en) | Method and apparatus for mixed model selection | |
| CN111931814A (en) | Unsupervised anti-domain adaptation method based on intra-class structure compactness constraint | |
| CN109635849A (en) | A kind of target clustering method and system based on three c-means decisions | |
| CN115456043A (en) | Classification model processing method, intent recognition method, device and computer equipment | |
| CN105809200B (en) | Method and device for autonomously extracting image semantic information in bioauthentication mode | |
| CN116246349B (en) | Single-source domain generalization gait recognition method based on progressive subdomain mining | |
| CN109712146A (en) | A kind of EM multi-threshold image segmentation method and device based on histogram | |
| Rosier et al. | Predicting ocean-induced ice-shelf melt rates using deep learning | |
| CN103744958A (en) | Webpage classification algorithm based on distributed computation | |
| CN103700108B (en) | Image segmentation method adopting semi-supervised RFLICM (Robust Fuzzy Local Information C-Means) clustering on basis of seed set | |
| CN113822390B (en) | User portrait construction method and device, electronic equipment and storage medium | |
| Zabihi et al. | Generalized fuzzy C‐means clustering with improved fuzzy partitions and shadowed sets | |
| Yanto et al. | A performance of modified fuzzy C-means (FCM) and chicken swarm optimization (CSO) | |
| Aderhold et al. | Reconstructing ecological networks with hierarchical Bayesian regression and Mondrian processes | |
| Chen et al. | Operational scenario definition in traffic simulation-based decision support systems: Pattern recognition using a clustering algorithm |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20190416 |
|
| RJ01 | Rejection of invention patent application after publication |