CN104504127B - Degree of membership defining method and system for classification of power customers - Google Patents
Degree of membership defining method and system for classification of power customers Download PDFInfo
- Publication number
- CN104504127B CN104504127B CN201410853595.5A CN201410853595A CN104504127B CN 104504127 B CN104504127 B CN 104504127B CN 201410853595 A CN201410853595 A CN 201410853595A CN 104504127 B CN104504127 B CN 104504127B
- Authority
- CN
- China
- Prior art keywords
- particle
- population
- lateral cross
- data
- matrix
- 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.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 74
- 239000002245 particle Substances 0.000 claims abstract description 175
- 239000011159 matrix material Substances 0.000 claims abstract description 89
- 230000003044 adaptive effect Effects 0.000 claims description 60
- 238000010606 normalization Methods 0.000 claims description 6
- 239000008186 active pharmaceutical agent Substances 0.000 description 4
- 238000004458 analytical method Methods 0.000 description 2
- 238000012804 iterative process Methods 0.000 description 2
- 238000004364 calculation method Methods 0.000 description 1
- 230000002860 competitive effect Effects 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000005065 mining Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/28—Databases characterised by their database models, e.g. relational or object models
- G06F16/284—Relational databases
- G06F16/285—Clustering or classification
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2458—Special types of queries, e.g. statistical queries, fuzzy queries or distributed queries
- G06F16/2468—Fuzzy queries
-
- 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/06—Energy or water supply
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Databases & Information Systems (AREA)
- Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Mathematical Physics (AREA)
- Fuzzy Systems (AREA)
- Health & Medical Sciences (AREA)
- Data Mining & Analysis (AREA)
- Economics (AREA)
- Automation & Control Theory (AREA)
- General Business, Economics & Management (AREA)
- Public Health (AREA)
- General Health & Medical Sciences (AREA)
- Tourism & Hospitality (AREA)
- Strategic Management (AREA)
- Water Supply & Treatment (AREA)
- Primary Health Care (AREA)
- Probability & Statistics with Applications (AREA)
- Human Resources & Organizations (AREA)
- Marketing (AREA)
- Computational Linguistics (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
A kind of degree of membership defining method for classification of power customers and system, its method includes: obtains number of users and electric power achievement data corresponding to each user, and sets up raw data matrix; Data in described raw data matrix are normalized, it is thus achieved that normalized matrix; Initial cluster center is carried out particle coding by the coded system based on cluster centre, generates initial population; Initial population is set to the parent population of lateral cross, adopts lateral cross method and crossed longitudinally method to calculate the second population; Judge that whether iterations is more than setting iterations, if it is not, the second population is then set to the parent population of lateral cross, continues iteration; If so, particle corresponding for fitness minimum in second population being split as c cluster centre, and calculates the electric power achievement data of each user and the degree of membership of cluster centre, wherein, c represents default clusters number. This programme improves the accuracy rate and stability of determining degree of membership.
Description
Technical field
The present invention relates to technical field of data processing, particularly relate to a kind of degree of membership defining method for classification of power customers and system.
Background technology
When carrying out classification of power customers, often electric power achievement data is processed. Electric power achievement data is a kind of achievement data in electric power data, such as, during using power consumption as classification of power customers index, then electric power achievement data can include power consumption, during using electric pressure as classification of power customers index, then electric power achievement data can include electric pressure. The analysis method of fuzzy clustering being introduced in classification of power customers is the new research direction of present stage a kind of comparison. It is determined by the electric power achievement data of user and the degree of membership of cluster centre, such that it is able to realize the classification to power consumer. Wherein, FCM cluster is a kind of conventional fuzzy clustering method, although FCM cluster has simple and quick advantage, but traditional FCM clustering procedure excessively relies on initial cluster center; FCM cluster process is based on gradient and declines, it is easy to be absorbed in local optimum; Traditional FCM clustering procedure classification time complexity is higher. Thus causing that the electric power achievement data of user is low with the accuracy rate of the degree of membership of cluster centre.
Summary of the invention
Based on this, it is necessary to for the problem that the electric power achievement data of user is low with the accuracy rate of the degree of membership of cluster centre, it is provided that a kind of degree of membership defining method for classification of power customers and system.
A kind of degree of membership defining method for classification of power customers, including:
From Electric Power Marketing System, obtain number of users and electric power achievement data corresponding to each user, and set up raw data matrix according to described number of users and electric power achievement data;
Data in described raw data matrix are normalized, it is thus achieved that normalized matrix;
Initial cluster center is carried out particle coding by the coded system based on cluster centre, generates initial population;
Initial population is set to the parent population of lateral cross, calculates the adaptive value of each particle in the parent population of described lateral cross according to described normalized matrix;
The adaptive value of the parent population according to lateral cross and its particle adopts lateral cross method to calculate the first population, first population is set to crossed longitudinally parent population, calculate the adaptive value of each particle in described crossed longitudinally parent population according to described normalized matrix, adopt crossed longitudinally method to calculate the second population according to the adaptive value of crossed longitudinally parent population and its particle;
Judge that whether iterations is more than setting iterations, if not, then the second population is set to the parent population of lateral cross, calculate the adaptive value of each particle in the parent population of this lateral cross according to described normalized matrix, adopt lateral cross method and crossed longitudinally method to be iterated calculating the second population; If so, particle corresponding for fitness minimum in second population being split as c cluster centre, and calculates the electric power achievement data of each user and the degree of membership of cluster centre, wherein, c represents default clusters number.
A kind of degree of membership for classification of power customers determines system, including:
Raw data matrix sets up module, for the electric power achievement data that acquisition number of users from Electric Power Marketing System and each user are corresponding, and sets up raw data matrix according to described number of users and electric power achievement data;
Normalized module, for being normalized the data in described raw data matrix, it is thus achieved that normalized matrix;
Initial population generation module, for initial cluster center being carried out particle coding based on the coded system of cluster centre, generates initial population;
Degree of membership determines module, for initial population is set to the parent population of lateral cross, calculates the adaptive value of each particle in the parent population of described lateral cross according to described normalized matrix; The adaptive value of the parent population according to lateral cross and its particle adopts lateral cross method to calculate the first population, first population is set to crossed longitudinally parent population, calculate the adaptive value of each particle in described crossed longitudinally parent population according to described normalized matrix, adopt crossed longitudinally method to calculate the second population according to the adaptive value of crossed longitudinally parent population and its particle; Judge that whether iterations is more than setting iterations, if not, then the second population is set to the parent population of lateral cross, calculate the adaptive value of each particle in the parent population of this lateral cross according to described normalized matrix, adopt lateral cross method and crossed longitudinally method to be iterated calculating the second population; If so, particle corresponding for fitness minimum in second population being split as c cluster centre, and calculates the electric power achievement data of each user and the degree of membership of cluster centre, wherein, c represents default clusters number.
The above-mentioned degree of membership defining method for classification of power customers and system, by setting up raw data matrix, and be normalized, and follow-up is processed by normalized matrix, it is possible to improves treatment effeciency. initial cluster center is carried out particle coding by the coded system based on cluster centre, generates initial population. when first time iteration, initial population is set to the parent population of lateral cross, the adaptive value of each particle in the parent population of described lateral cross is calculated according to described normalized matrix, and adopt lateral cross method and crossed longitudinally method to calculate the second population, when being not reaching to set iterations, second population is set to the parent population of lateral cross, the adaptive value of each particle in the parent population of this lateral cross is calculated according to described normalized matrix, lateral cross method and crossed longitudinally method is adopted to be iterated calculating the second population, until reaching to set iterations, now can obtain the second population of optimum, particle corresponding for fitness minimum in second population is split as c cluster centre, thus obtaining the cluster centre of optimum, and calculate the electric power achievement data of each user and the degree of membership of cluster centre, improve the accuracy rate and stability of determining degree of membership.
Accompanying drawing explanation
Fig. 1 is the present invention schematic flow sheet for the degree of membership defining method embodiment of classification of power customers;
Fig. 2 is the present invention for the degree of membership of classification of power customers determines the structural representation of system embodiment.
Detailed description of the invention
Below in conjunction with embodiment and accompanying drawing, the present invention is described in further detail, but embodiments of the present invention are not limited to this.
As it is shown in figure 1, be used for the schematic flow sheet of the degree of membership defining method embodiment of classification of power customers for the present invention, including:
Step S101: obtain number of users and electric power achievement data corresponding to each user from Electric Power Marketing System, and set up raw data matrix according to described number of users and electric power achievement data;
Electric power achievement data is a kind of achievement data in electric power data. Original matrix X=(x can be set upab)n��d. (1, n), n represents power consumer quantity altogether to a ��, and (1, d), d represents the quantity of electric power achievement data corresponding to each user, x to b ��abRepresent the electric power achievement data of a user, b row.
Step S102: the data in described raw data matrix are normalized, it is thus achieved that normalized matrix;
This step in order that simplify subsequent calculations, improve computational efficiency.
Further, step S102 may include that
Below equation is adopted to calculate normalization data:
Wherein, (1, n), n represents number of users to a ��, and (1, d), d represents the quantity of electric power achievement data corresponding to each user, minx to b ��*bRepresent in raw data matrix minimum power achievement data, maxx in b row*bRepresent in raw data matrix maximum power achievement data, x' in b rowabRepresent the normalization data corresponding to electric power achievement data of a user, b row;
Normalized matrix is obtained according to each normalization data. Such as, it is possible to X'=(x'ij)n��dRepresent normalized matrix.
Step S103: initial cluster center is carried out particle coding by the coded system based on cluster centre, generates initial population;
This step forms initial population based on the coded system of cluster centre, and namely each particle is formed (the classification number that c is data set) by c cluster centre. Data sample (normalized matrix) vector dimension is d, then the dimension of particle is c �� d, and the coding structure of particle v is:
Step S104: initial population is set to the parent population of lateral cross, calculates the adaptive value of each particle in the parent population of described lateral cross according to described normalized matrix;
In first time iterative process, it is possible to initial population is set to the parent population of lateral cross.
Further, the adaptive value step of each particle in the described parent population calculating described lateral cross according to described normalized matrix, including:
Step S1041: particle each in the parent population of lateral cross is split as c cluster centre respectively, it is thus achieved that the cluster centre that each particle is corresponding;
Step S1042: adopt below equation to calculate the degree of membership between electric power achievement data and the cluster centre that in described normalized matrix, each user is corresponding:
Wherein, 1��x��c, 1��y��n, n represents that number of users, m represent fuzzy coefficient, dxyRepresent the Euclidean distance between the electric power achievement data and x-th cluster centre that in described normalized matrix, y-th user is corresponding, dkyRepresent the Euclidean distance between the electric power achievement data and kth cluster centre that in described normalized matrix, y-th user is corresponding, uxyRepresent the degree of membership between each electric power achievement data corresponding for user y and cluster centre x in described normalized matrix;
Step S1043: adopt below equation to calculate the adaptive value of each particle in the parent population of lateral cross;
Wherein, fit represents the adaptive value of the particle that cluster centre is corresponding.
Owing to each particle can be split as c cluster centre, by calculating the degree of membership of electric power achievement data and these cluster centres, and adopt the formula in step S1043 can calculate the adaptive value of this particle.
Step S105: adopt lateral cross method to calculate the first population according to the adaptive value of the parent population of lateral cross and its particle, first population is set to crossed longitudinally parent population, calculate the adaptive value of each particle in described crossed longitudinally parent population according to described normalized matrix, adopt crossed longitudinally method to calculate the second population according to the adaptive value of crossed longitudinally parent population and its particle;
Calculating the adaptive value of each particle in crossed longitudinally parent population can adopt the method for S1041 to S1043 to be determined.
Step S106: judge that whether iterations is more than setting iterations, if it is not, enter step S107, if so, enters step S108;
Step S107: the second population is set to the parent population of lateral cross, calculates the adaptive value of each particle in the parent population of this lateral cross, and returns step S105 according to described normalized matrix;
When first time iteration, the parent population of lateral cross is initial population; During pth time iteration, the second population obtained when the parent population of lateral cross is-1 iteration of pth. Wherein, p >=2. The first population obtained when crossed longitudinally parent population is current iteration.
Step S108: particle corresponding for fitness minimum in the second population being split as c cluster centre, and calculates the electric power achievement data of each user and the degree of membership of cluster centre, wherein, c represents default clusters number.
Particle minimum for fitness in second population is split the cluster centre obtained is Optimal cluster centers. By the degree of membership between electric power achievement data and cluster centre that user each in normalized matrix is corresponding, the degree of membership between electric power achievement data and the cluster centre that each user in raw data matrix is corresponding can be obtained, degree of membership can be divided into a class more than setting electric power achievement data corresponding to degree of membership, and then realize the classification to user.
The present embodiment is by setting up raw data matrix, and is normalized, and follow-up is processed by normalized matrix, it is possible to improve treatment effeciency. initial cluster center is carried out particle coding by the coded system based on cluster centre, generates initial population. when first time iteration, initial population is set to the parent population of lateral cross, the adaptive value of each particle in the parent population of described lateral cross is calculated according to described normalized matrix, and adopt lateral cross method and crossed longitudinally method to calculate the second population, when being not reaching to set iterations, second population is set to the parent population of lateral cross, the adaptive value of each particle in the parent population of this lateral cross is calculated according to described normalized matrix, lateral cross method and crossed longitudinally method is adopted to be iterated calculating the second population, until reaching to set iterations, now can obtain the second population of optimum, particle corresponding for fitness minimum in second population is split as c cluster centre, thus obtaining the cluster centre of optimum, and calculate the electric power achievement data of each user and the degree of membership of cluster centre, improve the accuracy rate and stability of determining degree of membership.
Wherein in an embodiment, a kind of lateral cross method of concrete introduction.Concrete, the adaptive value of the described parent population according to lateral cross and its particle adopts lateral cross method to calculate the first population step, including:
A1: the particle in the parent population of lateral cross is carried out two neither repeated combinations, it is thus achieved that particle pair, and be numbered;
This step is particle individualities all in population to carry out two neither repeat pairing, total N/2 pair, and is numbered, it is therefore an objective to follow-up can take out successively.
When first time iteration, the parent population of lateral cross is initial population; During pth time iteration, the second population obtained when the parent population of lateral cross is-1 iteration of pth. Second population is properly termed as again the crossed longitudinally solution that is dominant, it is possible to use DSvcRepresent.
A2: order takes out particle pair successively by number, and adopts the below equation d to particle pair under the lateral cross probability set0Dimension performs horizontal line and intersects:
MShc(i,d0)=r1��X(i,d0)+(1-r1)��X(j,d0)+c1��(X(i,d0)-X(j,d0))
MShc(j,d0)=r1��X(j,d0)+(1-r2)��X(i,d0)+c1��(X(j,d0)-X(i,d0))
Wherein, d0�� (1, D), D=c �� d, d represent the quantity of electric power achievement data corresponding to each user; I �� (1, N); J �� (1, N), N represents initial population particle number; r1,r2For the uniform random number on [0,1]; c1,c2For the uniform random number between [-1,1]; X (i, d0) represent i-th particle d0Dimension data; X (j, d0) represent jth particle d0Dimension data; MShc(i,d0) and MShc(j,d0) represent the golden mean of the Confucian school solution after i-th particle and jth particle lateral cross respectively;
Repeat the above steps, it is possible to golden mean of the Confucian school solution corresponding after obtaining this particle centering lateral cross. Again other particles are carried out same treatment, obtain the golden mean of the Confucian school solution that each particle is corresponding.
A3: golden mean of the Confucian school solution corresponding for each particle is saved in the first matrix, calculate the adaptive value of each golden mean of the Confucian school solution in described first matrix, and the adaptive value corresponding with each particle in the parent population of lateral cross compares, particle little for fitness is stored in the first population.
This step in order that perform competition operator, it is thus achieved that after lateral cross being dominant solution DShc(i.e. the first population).
Further, a kind of crossed longitudinally method is also disclosed, concrete, described adopt crossed longitudinally method to calculate the second population step according to crossed longitudinally parent population, including:
B1: often one-dimensional by the particle of crossed longitudinally parent population is normalized;
The solution DS that is dominant of lateral cross in crossed longitudinally parent population and current iteration processhc��
Further, below equation is adopted to be normalized by the often one-dimensional of particle of crossed longitudinally parent population:
In formula, d1�� (1, D), Pd1maxIt is d1The upper limit of dimension control variable, Pd1minIt is d1The lower limit of dimension control variable, k is current iteration number of times, Xk(i,d1) represent the d of i-th particle when iterations is k1Dimension data, Xk-1(i,d1) represent the d of i-th particle when iterations is k-11Dimension data.
B2: each dimension is carried out two neither repeated combinations, and is numbered;
Dimensions all in population are carried out two and neither repeat pairing (total N/2 to) by this step.
B3: order takes out every a pair successively by number;
Take out each to data. Such as, it is possible to be d1Peacekeeping d2The data that dimension is corresponding.
B4: adopt below equation to perform crossed longitudinally to each to data according to setting crossed longitudinally rate:
MSvc(i,d1)=r X (i, d1)+(1-r)��X(i,d2)
In formula, X (i, d1) represent i-th particle d1Dimension data, X (i, d2) represent i-th particle d2Dimension data, d1,d2�� (1, D), d1��d2, D=c �� d, d represents the quantity of electric power achievement data corresponding to each user;I �� (1, N); R is the uniform random number on [0,1]; MSvc(i,d1) represent i-th particle d1Dimension offspring data, according to each offspring data of i-th particle obtain i-th particle crossed longitudinally after initial golden mean of the Confucian school solution;
Wherein, i-th particle each in data, MSvc(i,d1) represent i-th particle d1Dimension offspring data, by X (i, d1) it is updated to MSvc(i,d1); The d of i-th particle2Dimension offspring data is d2Dimension data X (i, d2), namely do not update.
Repeat step B4 can obtain each particle crossed longitudinally after initial golden mean of the Confucian school solution.
B5: the initial golden mean of the Confucian school solution after crossed longitudinally for each particle is carried out renormalization, obtain the golden mean of the Confucian school solution of correspondence, and save it in the second matrix, calculate the adaptive value of each golden mean of the Confucian school solution in described second matrix, and compare with the adaptive value of each particle in crossed longitudinally parent population, being stored in the second population by particle little for fitness, wherein, crossed longitudinally parent population is the first population that lateral cross method obtains.
This step performs Competitive Algorithms, it is thus achieved that the solution DS that is dominant after crossed longitudinallyvc��
Further, adopt below equation that the initial golden mean of the Confucian school solution after crossed longitudinally for each particle is carried out renormalization:
MSvc'(i,d1)=MSvc(i,d1)��(Pd1max-Pd1min)+Pd1min
Wherein, MSvc(i,d1) represent i-th particle d1Dimension offspring data, MSvc'(i,d1) represent i-th particle d1Data after dimension offspring data renormalization.
Each iterative process all can update the first population and the second population, makes the second population finally given optimum. Before whole scheme, it is also possible to set clusters number c, fuzzy coefficient m, Population Size N, control variable number D (i.e. dimension c �� d), maximum iteration time, crossed longitudinally rate pvc, lateral cross rate phc;
Various technical characteristics in embodiment of above can arbitrarily be combined, as long as the combination between feature is absent from conflict or contradiction, but as space is limited, describe one by one, therefore the various technical characteristics in above-mentioned embodiment be arbitrarily combined falling within the scope of this disclosure.
The present invention is directed to the deficiency of traditional fuzzy C mean algorithm, utilize crossover algorithm in length and breadth to find correct cluster centre, effectively accelerate the convergence rate of clustering algorithm, and avoid being absorbed in local optimum. The present invention program may be used for large power customers data carry out mining analysis objective, science, it is achieved that the become more meticulous classification more comprehensive and accurate to large power customers. The present invention controls that parameter is few and easily operated enforcement, and same kind of classification problem is had important using value.
Based on the above-mentioned degree of membership defining method for classification of power customers, the present invention also provides for a kind of degree of membership for classification of power customers and determines system, as in figure 2 it is shown, determine the structural representation of system embodiment for the degree of membership of classification of power customers for the present invention, including:
Raw data matrix sets up module 210, for the electric power achievement data that acquisition number of users from Electric Power Marketing System and each user are corresponding, and sets up raw data matrix according to described number of users and electric power achievement data;
Normalized module 220, for being normalized the data in described raw data matrix, it is thus achieved that normalized matrix;
Initial population generation module 230, for initial cluster center being carried out particle coding based on the coded system of cluster centre, generates initial population;
Degree of membership determines module 240, for initial population is set to the parent population of lateral cross, calculates the adaptive value of each particle in the parent population of described lateral cross according to described normalized matrix;The adaptive value of the parent population according to lateral cross and its particle adopts lateral cross method to calculate the first population, first population is set to crossed longitudinally parent population, calculate the adaptive value of each particle in described crossed longitudinally parent population according to described normalized matrix, adopt crossed longitudinally method to calculate the second population according to the adaptive value of crossed longitudinally parent population and its particle; Judge that whether iterations is more than setting iterations, if not, then the second population is set to the parent population of lateral cross, calculate the adaptive value of each particle in the parent population of this lateral cross according to described normalized matrix, adopt lateral cross method and crossed longitudinally method to be iterated calculating the second population; If so, particle corresponding for fitness minimum in second population being split as c cluster centre, and calculates the electric power achievement data of each user and the degree of membership of cluster centre, wherein, c represents default clusters number.
Wherein in an embodiment, described degree of membership determines module, is used for:
Particle in the parent population of lateral cross is carried out two neither repeated combinations, it is thus achieved that particle pair, and be numbered;
Order takes out particle pair successively by number, and adopts the below equation d to particle pair under the lateral cross probability set0Dimension performs horizontal line and intersects:
MShc(i,d0)=r1��X(i,d0)+(1-r1)��X(j,d0)+c1��(X(i,d0)-X(j,d0))
MShc(j,d0)=r1��X(j,d0)+(1-r2)��X(i,d0)+c1��(X(j,d0)-X(i,d0))
Wherein, d0�� (1, D), D=c �� d, d represent the quantity of electric power achievement data corresponding to each user; I �� (1, N); J �� (1, N), N represents initial population particle number; r1,r2For the uniform random number on [0,1]; c1,c2For the uniform random number between [-1,1]; X (i, d0) represent i-th particle d0Dimension data; X (j, d0) represent jth particle d0Dimension data; MShc(i,d0) and MShc(j,d0) represent the golden mean of the Confucian school solution after i-th particle and jth particle lateral cross respectively;
Golden mean of the Confucian school solution corresponding for each particle is saved in the first matrix, calculate the adaptive value of each golden mean of the Confucian school solution in described first matrix, and the adaptive value corresponding with each particle in the parent population of lateral cross compares, particle little for fitness is stored in the first population.
Wherein in an embodiment, described degree of membership determines module, is used for:
Often one-dimensional by the particle of crossed longitudinally parent population is normalized, and each dimension carries out two neither repeated combinations, and is numbered;
Order takes out every a pair successively by number;
Below equation is adopted to perform crossed longitudinally to each to data according to setting crossed longitudinally rate:
MSvc(i,d1)=r X (i, d1)+(1-r)��X(i,d2)
In formula, X (i, d1) represent i-th particle d1Dimension data, X (i, d2) represent i-th particle d2Dimension data, d1,d2�� (1, D), d1��d2, D=c �� d, d represents the quantity of electric power achievement data corresponding to each user; I �� (1, N); R is the uniform random number on [0,1]; MSvc(i,d1) represent i-th particle d1Dimension offspring data, according to each offspring data of i-th particle obtain i-th particle crossed longitudinally after initial golden mean of the Confucian school solution;
Initial golden mean of the Confucian school solution after crossed longitudinally for each particle is carried out renormalization, obtain the golden mean of the Confucian school solution of correspondence, and save it in the second matrix, calculate the adaptive value of each golden mean of the Confucian school solution in described second matrix, and compare with the adaptive value of each particle in crossed longitudinally parent population, being stored in the second population by particle little for fitness, wherein, crossed longitudinally parent population is the first population that lateral cross method obtains.
The degree of membership for classification of power customers of the present invention determines that the degree of membership defining method for classification of power customers of system and the present invention is one to one, above-mentioned all determine system embodiment suitable in the degree of membership for classification of power customers for the correlation technique feature in the degree of membership defining method embodiment of classification of power customers and technique effect thereof, do not repeat them here.
Embodiment described above only have expressed the several embodiments of the present invention, and it describes comparatively concrete and detailed, but therefore can not be interpreted as the restriction to the scope of the claims of the present invention. It should be pointed out that, for the person of ordinary skill of the art, without departing from the inventive concept of the premise, it is also possible to making some deformation and improvement, these broadly fall into protection scope of the present invention. Therefore, the protection domain of patent of the present invention should be as the criterion with claims.
Claims (10)
1. the degree of membership defining method for classification of power customers, it is characterised in that including:
From Electric Power Marketing System, obtain number of users and electric power achievement data corresponding to each user, and set up raw data matrix according to described number of users and electric power achievement data;
Data in described raw data matrix are normalized, it is thus achieved that normalized matrix;
Initial cluster center is carried out particle coding by the coded system based on cluster centre, generates initial population;
Initial population is set to the parent population of lateral cross, calculates the adaptive value of each particle in the parent population of described lateral cross according to described normalized matrix;
The adaptive value of the parent population according to lateral cross and its particle adopts lateral cross method to calculate the first population, first population is set to crossed longitudinally parent population, calculate the adaptive value of each particle in described crossed longitudinally parent population according to described normalized matrix, adopt crossed longitudinally method to calculate the second population according to the adaptive value of crossed longitudinally parent population and its particle;
Judge to adopt lateral cross method and crossed longitudinally method whether to be iterated calculating the iterations of the second population more than setting iterations, if not, then the second population is set to the parent population of lateral cross, calculate the adaptive value of each particle in the parent population of this lateral cross according to described normalized matrix, adopt lateral cross method and crossed longitudinally method to be iterated calculating the second population; If so, particle corresponding for fitness minimum in second population being split as c cluster centre, and calculates the electric power achievement data of each user and the degree of membership of cluster centre, wherein, c represents default clusters number.
2. the degree of membership defining method for classification of power customers according to claim 1, it is characterised in that the adaptive value of the described parent population according to lateral cross and its particle adopts lateral cross method to calculate the first population step, including:
Particle in the parent population of lateral cross is carried out two neither repeated combinations, it is thus achieved that particle pair, and be numbered;
Order takes out particle pair successively by number, and adopts the below equation d to particle pair under the lateral cross probability set0Dimension performs horizontal line and intersects:
MShc(i,d0)=r1��X(i,d0)+(1-r1)��X(j,d0)+c1��(X(i,d0)-X(j,d0))
MShc(j,d0)=r1��X(j,d0)+(1-r2)��X(i,d0)+c1��(X(j,d0)-X(i,d0))
Wherein, d0�� (1, D), D=c �� d, d represent the quantity of electric power achievement data corresponding to each user; I �� (1, N); J �� (1, N), N represents initial population particle number; r1,r2For the uniform random number on [0,1]; c1,c2For the uniform random number between [-1,1]; X (i, d0) represent i-th particle d0Dimension data; X (j, d0) represent jth particle d0Dimension data; MShc(i,d0) and MShc(j,d0) represent the golden mean of the Confucian school solution after i-th particle and jth particle lateral cross respectively;
Golden mean of the Confucian school solution corresponding for each particle is saved in the first matrix, calculate the adaptive value of each golden mean of the Confucian school solution in described first matrix, and the adaptive value corresponding with each particle in the parent population of lateral cross compares, particle little for fitness is stored in the first population.
3. the degree of membership defining method for classification of power customers according to claim 1, it is characterised in that described adopt crossed longitudinally method to calculate the second population step according to crossed longitudinally parent population, including:
Often one-dimensional by the particle of crossed longitudinally parent population is normalized, and each dimension carries out two neither repeated combinations, and is numbered;
Order takes out every a pair successively by number;
Below equation is adopted to perform crossed longitudinally to each to data according to setting crossed longitudinally rate:
MSvc(i,d1)=r X (i, d1)+(1-r)��X(i,d2)
In formula, X (i, d1) represent i-th particle d1Dimension data, X (i, d2) represent i-th particle d2Dimension data, d1,d2�� (1, D), d1��d2, D=c �� d, d represents the quantity of electric power achievement data corresponding to each user; I �� (1, N); R is the uniform random number on [0,1]; MSvc(i,d1) represent i-th particle d1Dimension offspring data, according to each offspring data of i-th particle obtain i-th particle crossed longitudinally after initial golden mean of the Confucian school solution;
Initial golden mean of the Confucian school solution after crossed longitudinally for each particle is carried out renormalization, obtain the golden mean of the Confucian school solution of correspondence, and save it in the second matrix, calculate the adaptive value of each golden mean of the Confucian school solution in described second matrix, and compare with the adaptive value of each particle in crossed longitudinally parent population, being stored in the second population by particle little for fitness, wherein, crossed longitudinally parent population is the first population that lateral cross method obtains.
4. according to claims 1 to 3 any one for the degree of membership defining method of classification of power customers, it is characterised in that described data in described raw data matrix are normalized, it is thus achieved that normalized matrix step includes:
Below equation is adopted to calculate normalization data:
Wherein, (1, n), n represents number of users to a ��, and (1, d), d represents the quantity of electric power achievement data corresponding to each user, minx to b ��*bRepresent in raw data matrix minimum power achievement data, maxx in b row*bRepresent in raw data matrix maximum power achievement data, x' in b rowabRepresent the normalization data corresponding to electric power achievement data of a user, b row;
Normalized matrix is obtained according to each normalization data.
5. the degree of membership defining method for classification of power customers according to claims 1 to 3 any one, it is characterised in that the adaptive value step of each particle in the described parent population calculating described lateral cross according to described normalized matrix, including:
Particle each in the parent population of lateral cross is split as c cluster centre respectively, it is thus achieved that the cluster centre that each particle is corresponding;
Below equation is adopted to calculate the degree of membership between electric power achievement data and the cluster centre that in described normalized matrix, each user is corresponding:
Wherein, 1��x��c, 1��y��n, n represents that number of users, m represent fuzzy coefficient, dxyRepresent the Euclidean distance between the electric power achievement data and x-th cluster centre that in described normalized matrix, y-th user is corresponding, dkyRepresent the Euclidean distance between the electric power achievement data and kth cluster centre that in described normalized matrix, y-th user is corresponding, uxyRepresent the degree of membership between each electric power achievement data corresponding for user y and cluster centre x in described normalized matrix;
Below equation is adopted to calculate the adaptive value of each particle in the parent population of lateral cross;
Wherein, fit represents the adaptive value of the particle that cluster centre is corresponding.
6. the degree of membership defining method for classification of power customers according to claim 3, it is characterised in that adopt below equation to be normalized by the often one-dimensional of particle of crossed longitudinally parent population:
In formula, d1�� (1, D), Pd1maxIt is d1The upper limit of dimension control variable, Pd1minIt is d1The lower limit of dimension control variable, k is current iteration number of times, Xk(i,d1) represent the d of i-th particle when iterations is k1Dimension data, Xk-1(i,d1) represent the d of i-th particle when iterations is k-11Dimension data.
7. the degree of membership defining method for classification of power customers according to claim 6, it is characterised in that adopt below equation that the initial golden mean of the Confucian school solution after crossed longitudinally for each particle is carried out renormalization:
MSvc'(i,d1)=MSvc(i,d1)��(Pd1max-Pd1min)+Pd1min
Wherein, MSvc(i,d1) represent i-th particle d1Dimension offspring data, MSvc'(i,d1) represent i-th particle d1Data after dimension offspring data renormalization.
8. determine system for the degree of membership of classification of power customers for one kind, it is characterised in that including:
Raw data matrix sets up module, for the electric power achievement data that acquisition number of users from Electric Power Marketing System and each user are corresponding, and sets up raw data matrix according to described number of users and electric power achievement data;
Normalized module, for being normalized the data in described raw data matrix, it is thus achieved that normalized matrix;
Initial population generation module, for initial cluster center being carried out particle coding based on the coded system of cluster centre, generates initial population;
Degree of membership determines module, for initial population is set to the parent population of lateral cross, calculates the adaptive value of each particle in the parent population of described lateral cross according to described normalized matrix; The adaptive value of the parent population according to lateral cross and its particle adopts lateral cross method to calculate the first population, first population is set to crossed longitudinally parent population, calculate the adaptive value of each particle in described crossed longitudinally parent population according to described normalized matrix, adopt crossed longitudinally method to calculate the second population according to the adaptive value of crossed longitudinally parent population and its particle; Judge to adopt lateral cross method and crossed longitudinally method whether to be iterated calculating the iterations of the second population more than setting iterations, if not, then the second population is set to the parent population of lateral cross, calculate the adaptive value of each particle in the parent population of this lateral cross according to described normalized matrix, adopt lateral cross method and crossed longitudinally method to be iterated calculating the second population; If so, particle corresponding for fitness minimum in second population being split as c cluster centre, and calculates the electric power achievement data of each user and the degree of membership of cluster centre, wherein, c represents default clusters number.
9. the degree of membership for classification of power customers according to claim 8 determines system, it is characterised in that described degree of membership determines module, is used for:
Particle in the parent population of lateral cross is carried out two neither repeated combinations, it is thus achieved that particle pair, and be numbered;
Order takes out particle pair successively by number, and adopts the below equation d to particle pair under the lateral cross probability set0Dimension performs horizontal line and intersects:
MShc(i,d0)=r1��X(i,d0)+(1-r1)��X(j,d0)+c1��(X(i,d0)-X(j,d0))
MShc(j,d0)=r1��X(j,d0)+(1-r2)��X(i,d0)+c1��(X(j,d0)-X(i,d0))
Wherein, d0�� (1, D), D=c �� d, d represent the quantity of electric power achievement data corresponding to each user; I �� (1, N); J �� (1, N), N represents initial population particle number; r1,r2For the uniform random number on [0,1];C1,c2For the uniform random number between [-1,1]; X (i, d0) represent i-th particle d0Dimension data; X (j, d0) represent jth particle d0Dimension data; MShc(i,d0) and MShc(j,d0) represent the golden mean of the Confucian school solution after i-th particle and jth particle lateral cross respectively;
Golden mean of the Confucian school solution corresponding for each particle is saved in the first matrix, calculate the adaptive value of each golden mean of the Confucian school solution in described first matrix, and the adaptive value corresponding with each particle in the parent population of lateral cross compares, particle little for fitness is stored in the first population.
10. the degree of membership for classification of power customers according to claim 8 determines system, it is characterised in that described degree of membership determines module, is used for:
Often one-dimensional by the particle of crossed longitudinally parent population is normalized, and each dimension carries out two neither repeated combinations, and is numbered;
Order takes out every a pair successively by number;
Below equation is adopted to perform crossed longitudinally to each to data according to setting crossed longitudinally rate:
MSvc(i,d1)=r X (i, d1)+(1-r)��X(i,d2)
In formula, X (i, d1) represent i-th particle d1Dimension data, X (i, d2) represent i-th particle d2Dimension data, d1,d2�� (1, D), d1��d2, D=c �� d, d represents the quantity of electric power achievement data corresponding to each user; I �� (1, N); R is the uniform random number on [0,1]; MSvc(i,d1) represent i-th particle d1Dimension offspring data, according to each offspring data of i-th particle obtain i-th particle crossed longitudinally after initial golden mean of the Confucian school solution;
Initial golden mean of the Confucian school solution after crossed longitudinally for each particle is carried out renormalization, obtain the golden mean of the Confucian school solution of correspondence, and save it in the second matrix, calculate the adaptive value of each golden mean of the Confucian school solution in described second matrix, and compare with the adaptive value of each particle in crossed longitudinally parent population, being stored in the second population by particle little for fitness, wherein, crossed longitudinally parent population is the first population that lateral cross method obtains.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201410853595.5A CN104504127B (en) | 2014-12-29 | 2014-12-29 | Degree of membership defining method and system for classification of power customers |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201410853595.5A CN104504127B (en) | 2014-12-29 | 2014-12-29 | Degree of membership defining method and system for classification of power customers |
Publications (2)
Publication Number | Publication Date |
---|---|
CN104504127A CN104504127A (en) | 2015-04-08 |
CN104504127B true CN104504127B (en) | 2016-06-08 |
Family
ID=52945524
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201410853595.5A Active CN104504127B (en) | 2014-12-29 | 2014-12-29 | Degree of membership defining method and system for classification of power customers |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN104504127B (en) |
Families Citing this family (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN104992182A (en) * | 2015-06-29 | 2015-10-21 | 北京京东尚科信息技术有限公司 | Method and device for determining user level |
CN108538372A (en) * | 2018-03-07 | 2018-09-14 | 深圳市南山区人民医院 | Medical service price adjustment method, apparatus, server and storage medium |
CN109522934A (en) * | 2018-10-22 | 2019-03-26 | 云南电网有限责任公司 | A kind of power consumer clustering method based on clustering algorithm |
CN109829473A (en) * | 2018-12-26 | 2019-05-31 | 巨轮智能装备股份有限公司 | The degree of membership for equipping services platform user classification for intelligence determines method and system |
CN110659930A (en) * | 2019-08-27 | 2020-01-07 | 深圳大学 | Consumption upgrading method and device based on user behaviors, storage medium and equipment |
Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP1431880A1 (en) * | 2002-12-19 | 2004-06-23 | France Telecom Sa | Discretisation of a source attribute or of a group of source attributes of a database |
CN102663100A (en) * | 2012-04-13 | 2012-09-12 | 西安电子科技大学 | Two-stage hybrid particle swarm optimization clustering method |
CN102789542A (en) * | 2012-06-27 | 2012-11-21 | 西安电子科技大学 | Load distribution method for hydrothermal power system based on multi-target distribution estimation |
CN104112237A (en) * | 2014-06-30 | 2014-10-22 | 国家电网公司 | WAMS-based genetic algorithm-improved power grid reactive capacity optimization configuration method |
-
2014
- 2014-12-29 CN CN201410853595.5A patent/CN104504127B/en active Active
Patent Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP1431880A1 (en) * | 2002-12-19 | 2004-06-23 | France Telecom Sa | Discretisation of a source attribute or of a group of source attributes of a database |
CN102663100A (en) * | 2012-04-13 | 2012-09-12 | 西安电子科技大学 | Two-stage hybrid particle swarm optimization clustering method |
CN102789542A (en) * | 2012-06-27 | 2012-11-21 | 西安电子科技大学 | Load distribution method for hydrothermal power system based on multi-target distribution estimation |
CN104112237A (en) * | 2014-06-30 | 2014-10-22 | 国家电网公司 | WAMS-based genetic algorithm-improved power grid reactive capacity optimization configuration method |
Also Published As
Publication number | Publication date |
---|---|
CN104504127A (en) | 2015-04-08 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN104504127B (en) | Degree of membership defining method and system for classification of power customers | |
CN108416695B (en) | Power load probability density prediction method, system and medium based on deep learning | |
CN109995075B (en) | Dynamic reconstruction method for active power distribution network containing distributed power supply | |
CN105388402B (en) | Crosslinked cable Partial Discharge Pattern Recognition Method based on parameter optimization SVM algorithm | |
CN107578288B (en) | Non-invasive load decomposition method considering user power consumption mode difference | |
CN102413029A (en) | Method for partitioning communities in complex dynamic network by virtue of multi-objective local search based on decomposition | |
CN109272058A (en) | Integrated power load curve clustering method | |
CN111768761B (en) | Training method and device for speech recognition model | |
CN108205703A (en) | Multi-input multi-output matrix average value pooling vectorization implementation method | |
CN104268077A (en) | Chaos genetic algorithm based test case intensive simple algorithm | |
CN107358253A (en) | A kind of adaptive integrated learning approach and system based on differential evolution | |
CN109617049A (en) | UPFC configuration method for wind power collection area | |
CN113987913A (en) | Improved non-invasive load decomposition model | |
CN110837929A (en) | Least square support vector machine electricity utilization prediction method based on adaptive genetic algorithm | |
CN105529714A (en) | Normal distribution combination characteristic-based rapid probabilistic power flow calculation method | |
CN104503381B (en) | A kind of Optimization Scheduling of the production assembling process of mobile phone | |
Roeva et al. | Intercriteria analysis of parameters relations in fermentation processes models | |
CN106130661A (en) | Broadband wireless transmitter recognition methods based on Hammerstein Wiener model | |
CN117910826A (en) | Carbon emission prediction method and system based on weighted combination optimization | |
CN106340896B (en) | A kind of analysis method of multi-inverter cutting-in control interchannel reciprocal effect | |
Dongmei et al. | Reactive power optimization by genetic algorithm integrated with reduced gradient method | |
CN111697607A (en) | Multi-terminal flexible direct-current transmission receiving-end power grid access method and system | |
CN106327079B (en) | Evaluation method for reactive power optimization control of power distribution network | |
CN105334730A (en) | Heating furnace oxygen content IGA optimization T-S fuzzy ARX modeling method | |
CN116010893A (en) | User voltage data-based user-to-user relationship anomaly analysis method and system |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
C06 | Publication | ||
PB01 | Publication | ||
C10 | Entry into substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
C14 | Grant of patent or utility model | ||
GR01 | Patent grant |