WO2015135276A1 - 聚类方法及相关装置 - Google Patents
聚类方法及相关装置 Download PDFInfo
- Publication number
- WO2015135276A1 WO2015135276A1 PCT/CN2014/082876 CN2014082876W WO2015135276A1 WO 2015135276 A1 WO2015135276 A1 WO 2015135276A1 CN 2014082876 W CN2014082876 W CN 2014082876W WO 2015135276 A1 WO2015135276 A1 WO 2015135276A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- class
- classes
- distance
- objects
- rank
- Prior art date
Links
- 238000000034 method Methods 0.000 title claims abstract description 52
- 230000002776 aggregation Effects 0.000 claims description 68
- 238000004220 aggregation Methods 0.000 claims description 68
- 238000010606 normalization Methods 0.000 claims description 17
- 238000004364 calculation method Methods 0.000 claims description 3
- 230000008569 process Effects 0.000 abstract description 8
- 239000011159 matrix material Substances 0.000 description 12
- 238000004891 communication Methods 0.000 description 10
- 238000006116 polymerization reaction Methods 0.000 description 10
- 238000010586 diagram Methods 0.000 description 8
- 238000005516 engineering process Methods 0.000 description 6
- 239000013598 vector Substances 0.000 description 6
- 230000003287 optical effect Effects 0.000 description 5
- 230000005236 sound signal Effects 0.000 description 4
- 108010001267 Protein Subunits Proteins 0.000 description 3
- 239000006185 dispersion Substances 0.000 description 3
- 230000001133 acceleration Effects 0.000 description 2
- 238000013500 data storage Methods 0.000 description 2
- 230000003993 interaction Effects 0.000 description 2
- 238000007726 management method Methods 0.000 description 2
- 230000009471 action Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 238000003384 imaging method Methods 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 230000002093 peripheral effect Effects 0.000 description 1
- 230000002085 persistent effect Effects 0.000 description 1
- 238000000638 solvent extraction Methods 0.000 description 1
- 230000003068 static effect Effects 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
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06V—IMAGE OR VIDEO RECOGNITION OR UNDERSTANDING
- G06V10/00—Arrangements for image or video recognition or understanding
- G06V10/70—Arrangements for image or video recognition or understanding using pattern recognition or machine learning
- G06V10/762—Arrangements for image or video recognition or understanding using pattern recognition or machine learning using clustering, e.g. of similar faces in social networks
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F18/00—Pattern recognition
- G06F18/20—Analysing
- G06F18/24—Classification techniques
- G06F18/243—Classification techniques relating to the number of classes
- G06F18/2433—Single-class perspective, e.g. one-against-all classification; Novelty detection; Outlier detection
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/50—Information retrieval; Database structures therefor; File system structures therefor of still image data
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06V—IMAGE OR VIDEO RECOGNITION OR UNDERSTANDING
- G06V40/00—Recognition of biometric, human-related or animal-related patterns in image or video data
- G06V40/10—Human or animal bodies, e.g. vehicle occupants or pedestrians; Body parts, e.g. hands
- G06V40/16—Human faces, e.g. facial parts, sketches or expressions
- G06V40/172—Classification, e.g. identification
Definitions
- the present disclosure relates to the field of computer technologies, and in particular, to a clustering method and related apparatus. Background technique
- Clustering is the process of dividing a collection of physical or abstract objects into multiple classes consisting of similar objects, that is, the process of classifying objects into different classes (clusters).
- the objects in the same class have great similarities and differences. Objects between classes have great dissimilarity.
- the concept of "class” is used below. It should be noted that "class” and “cluster” have the same meaning in this article.
- the clustering method is used to classify face images, the pictures belonging to the same person are classified into one class, and the related clustering method uses the Rank-Order distance to measure the similarity between two faces, and the same person can be The pictures are gathered together.
- the clustering result accuracy of such a clustering method is very low. Summary of the invention
- a clustering method including: performing iterative merging of classes according to a Rank-Order distance between classes; The intra-class aggregation degree corresponding to the iteratively merged class is obtained by using the distance between the objects in the class; for each class obtained by the iterative combination, the object with the distance between the objects within the class being less than the degree of aggregation within the class is divided into a new one.
- Class and update the number of classes; when the number of updated classes is less than the number of classes before the update, return the step of performing iterative merge of classes based on the Rank-Order distance between classes, until the number of classes before and after the update
- a clustering result is obtained, the clustering result including a class containing a plurality of objects and a class containing a single object.
- the utilizing the distance between each object in the class to obtain the intra-class aggregation degree corresponding to the iteratively merged class is as follows: The distance between the objects; calculating the distance average of the distances between the objects in the class according to the distance between the objects in the class, and obtaining the intra-class aggregation degree of the class.
- the utilizing the distance between each object in the class to obtain the intra-class aggregation degree corresponding to the iteratively merged class is as follows: The distance between the objects; calculating the distance average of the distances between the objects in the class according to the distance between the objects in the class; normalizing the distance average to obtain the intra-class polymerization degree of the class .
- the each class obtained by the iterative combination is between the intra-class objects
- the object whose distance is less than the degree of aggregation in the class is divided into a new class, and the number of the classes is updated in the following manner: the distance between the objects in the class is smaller than the intra-class aggregation object, and the connectivity is marked;
- the tag determines a connected component within the class; splits the class into new classes based on the connected component, and updates the number of classes.
- the performing the iterative merging of the classes according to the Rank-Order distance between the classes is as follows: obtaining an Inter-class Rank-Order distance, and obtaining Rank-Order normalization distance between classes; when the Rank-Order distance between classes is less than the distance threshold, and the Rank-Order normalization distance between the classes is less than 1, the class is merged; When the number is less than the number of classes before the merge, the steps of obtaining the merged Rank-Order distance between the classes and the Rank-Order normalization distance between the classes are performed.
- a clustering apparatus including: an iterative merging unit, configured to perform iterative merging of classes according to a Rank-Order distance between classes; and an acquiring unit, configured to utilize each object in the class
- the distance between the classes obtains the intra-class aggregation degree corresponding to the iteratively merged class; the partitioning unit is used to divide each object obtained by the iterative merging into an object with a distance less than the degree of aggregation within the class.
- the acquiring unit includes: a first obtaining subunit, configured to obtain a distance between each object in the class; a first calculating subunit, configured to calculate an average value of distances between the objects of the class, to obtain the intra-class aggregation degree.
- the acquiring unit includes: a second acquiring subunit, configured to acquire a distance between each object in the class; and a second calculating subunit, configured to: Calculating a distance average value of distances between the objects in the class according to the distance between the objects in the class; normalizing the subunit, normalizing the distance average to obtain an in-class aggregation of the class degree.
- the dividing unit includes: a first determining subunit For determining whether the distance between the objects in the class is less than the intra-class aggregation degree; marking a sub-unit, configured to: when the distance between the objects in the class is less than the intra-class aggregation degree, The object corresponding to the distance between the objects performs a connectivity flag; the determining subunit is configured to determine a connected component in the class according to the connectivity flag; and the splitting unit is configured to split the class into new according to the connected component Class, and update the number of classes.
- the iterative merging unit includes: a third acquiring subunit, configured to obtain an inter-class Rank-Order distance, and obtain an inter-class Rank-Order homing a merging sub-unit, configured to merge the classes when the Rank-Order distance between the classes is less than a distance threshold, and the normal-to-class Rank-Order normalization distance is less than 1, the second determining sub-unit, When the number of merged classes is less than the number of pre-merged classes, the third obtaining sub-unit is controlled to perform the step of obtaining the updated inter-class Rank-Order distance and the Rank-Order normalized distance between the classes.
- a terminal device including: a processor; a memory for storing processor-executable instructions; wherein the processor is configured to: according to a Rank-Order distance between classes , iteratively merging the classes; using the distance between the objects in the class to obtain the intra-class aggregation degree of the iteratively merged class; for each class obtained by iterative merging, the distance between the objects within the class is smaller than the intra-class aggregation
- the inner object of degree is divided into a new class, and the number of classes is updated; when the number of updated classes is less than the number of classes before updating, the steps of performing iterative merging of classes according to the Rank-Order distance between classes are returned.
- the clustering result is obtained until the number of classes before and after the update is unchanged, and the clustering result includes a class including a plurality of objects and a class containing a single object.
- the technical solution provided by the embodiments of the present disclosure may include the following beneficial effects: the clustering method is utilizing inter-class The Rank-Order distance combines the qualified classes to reduce the number of classes. Then, the intra-class aggregation degree is calculated by using the distance between the objects in the class, and the distance between the objects in the class is smaller than the intra-class aggregation degree. The object is split into new classes until all the classes are split.
- the split class is iteratively merged and split, until each class can no longer be split, and the cluster containing multiple objects and the class containing a single object are determined, so as to compare the dissimilarity in the clustering process. Large objects are eliminated, improving the accuracy of clustering results. In particular, when there are many objects in the data set, but there are fewer objects belonging to the same class, the accuracy of the clustering results is relatively high.
- FIG. 1 is a sequence sequence diagram of a plurality of objects
- FIG. 2 is a flowchart of a clustering method according to an exemplary embodiment
- FIG. 3 is a flowchart of an exemplary embodiment of step S110 of FIG.
- Figure 4 is a flow chart of another exemplary embodiment of step S110 of Figure 2
- Figure 5 is a flow chart of an exemplary embodiment of step S120 of Figure 2
- Figure 6 is a diagram of step S130 of Figure 2.
- FIG. 7 is a block diagram of a clustering apparatus according to an exemplary embodiment
- FIG. 8 is a block diagram of a terminal device according to an exemplary embodiment
- n objects namely ⁇ , i 2 , i 3 , i 4 , i 5 , i 6 ... i n
- calculate the distance between each other object and the object ⁇ and press magnitude of distance sort ⁇ ⁇ obtain sequence shown in Figure 1;
- i 2 to the object as a reference object 12 calculates a distance between each of the other objects and the reference objects, to obtain sequence shown in FIG. 02.
- the D ⁇ H represents the Rank-Order distance between the normalized objects
- the Rank-Order distance between the classes is the same as the Rank-Order distance algorithm between the objects
- one class is the reference class and then each is based on the distance between the classes.
- C ⁇ PCj represents a class.
- the formula for calculating the Rank-Order distance between classes is as shown in equation (4):
- D(Ci, Cj) represents the asymmetric Rank-Order distance between the class and the class Cj
- D(Cj, Ci) represents the asymmetric Rank-Order distance between the class Cj and the class
- Oc ⁇ Cj indicates the sequence number of the class Cj in the sequence with ⁇ as the reference class
- O e indicates the sequence number of the class ⁇ in the sequence with the class ⁇ as the reference class.
- the normalized Rank-Order distance D N (Ci, Cj) is calculated according to the inter-class distance D R (Ci, Cj), where the formula for calculating the normalization distance between classes is as shown in formula (5): 1 ⁇
- + C laeQUCj K k l
- c Ci, Cj) represents the distance between the class and the class Cj
- and Cj represent the number of objects in the class
- K is a constant
- f a (k ) represents the kth neighbor object of object a
- ⁇ Ci, Cj) represents the average distance between the nearest K objects in the two classes.
- the object is a face image
- the clustering method provided by the present disclosure is capable of grouping images belonging to the same person to form a cluster. The features in the face image are converted into a set of vectors, so the distance between the objects is the distance between the vectors.
- the clustering method provided by the present disclosure can also be applied to other data.
- step S110 according to the Rank- between classes Order distance, the iterative merge of classes. Calculate the Rank-Order distance between the two classes and combine the classes whose Rank-Order distance is less than the first distance threshold.
- the first distance threshold may be determined according to a data type, and may also be determined according to a test result.
- step S110 may include the following steps: In step S111, an inter-class Rank-Order distance is obtained, and an inter-class Rank-Order normalized distance is obtained.
- the number of initial face images is N
- the number of initial classes is N
- the distance threshold t and the constant K are set.
- the inter-class Rank-Order distance D R (Ci, Cj) and the inter-class normalized Rank-Order distance D N (Ci, are calculated. Cj;).
- the number of initial classes is N, and finally a D R (Ci, Cj;) matrix of NXN and a D N (Ci, Cj) matrix of NXN are obtained, where each vector representation in the D R (Ci, Cj) matrix
- the Rank-Order distance between the corresponding classes for example, Cg in the matrix represents the Rank-Order distance between the classes C ⁇ PCj, and the vector C ⁇ in the D N (Ci, Cj) matrix represents the Rank between the class and Cj.
- Order normalized distance In step S112, when the Rank-Order distance between classes is less than the distance threshold, and the Rank-Order normalization distance between the classes is less than 1, the classes are merged.
- step S120 the intra-class aggregation degree corresponding to the iteratively merged class is calculated by using the distance between the objects in the class.
- step S120 may include the following steps:
- step S121 the distance between each object in the class is obtained.
- the distance between the objects may be a cosine similarity, an Euclidean distance, or a Jachard distance. It should be noted that, when the cosine similarity degree is used in the present disclosure to calculate the distance between objects, the distance between the objects is defined as ic 0S e, that is, the smaller the distance between the objects, the greater the similarity of the objects.
- step S122 the distance average of the distances between the objects in the class is calculated to obtain the intra-class aggregation degree of the class. Assuming that there are n objects in the class, according to the distance between any two objects in the calculated class, the distance matrix d of nXn is obtained. Each point in the matrix indicates the distance between the corresponding two objects, for example, matrix d Vector ⁇ table Shows the distance between the i-th object and the j-th object in the class. This step calculates the average of the vectors in matrix d.
- step S120 may include the following steps: In step S123, the distance between each object in the class is obtained. In step S124, the average distance of the distances between the objects in the class is calculated according to the distance between the objects in the class. In step S125, the distance average is normalized to obtain an intra-class polymerization degree of the class. Normalize d_aver from the distance average, that is, d_aver is summarized into a range [dlef t, dright], dleft and dri ght are thresholds, for example, dl eft can be 0. 6, dright can be 0. 75. For example, the normalization formula is shown in equation (6): dleft, d_aver ⁇ dleft
- D_aver dright, d_aver> dright (6) d_aver, dleft ⁇ d aver ⁇ dright
- the degree of intra-class polymerization obtained after normalization is 0.6;
- the in-class degree of polymerization obtained after normalization is 0.75, and the degree of aggregation in the class after normalization is 0.75.
- (1-cosine similarity) is used to measure the degree of intra-class polymerization, so the smaller the intra-class polymerization degree, the more aggregated the objects in the class and the greater the similarity. Therefore, the intra-class aggregation degree is normalized. Into an interval, for example,
- the objects within the class are divided according to the intra-class aggregation degree, when the intra-class aggregation degree is not within the normalized interval Dividing the objects in the class according to the threshold of the interval, thereby realizing that the class having a large degree of aggregation within the class (that is, a class having a large intra-class dispersion) can be appropriately divided into a plurality of classes, thereby enabling Avoid classifying too many classes with less aggregation within the class.
- step S130 for each class obtained by iterative merging, the object whose distance between the objects in the class is smaller than the degree of aggregation within the class is divided into a new class, and the number of classes is updated. For each class that is iteratively merged according to the Rank-Order distance, each class is divided according to the distance between the objects in the class and the degree of aggregation within the class, and a new class is obtained, and an iteration is completed, and then step S140 is performed.
- step S130 may include the following steps: In step S131, an object whose distance between objects within the class is smaller than the degree of aggregation within the class is connected.
- the degree of aggregation indicates that the similarity between objects is large and can be divided into the same class.
- the two objects corresponding to the distance may be connected, for example, when the distance between the two face images is less than the intra-class aggregation degree, the i-th object and the j-th object are connected.
- the distance between the objects in the class is greater than the degree of aggregation within the class, it indicates that the similarity between the objects is small, and it is not suitable to be divided into the same class without any markup.
- a connected component within the class is determined according to the connectivity flag.
- the connectable object is regarded as a connected component, so that all objects in the class can be divided into several connected components.
- the class is split into new classes according to the connected component, and the number of classes is updated.
- the object corresponding to each connected component is divided into a new class, that is, a class contains several connected components, and the large class is divided into several new classes, and the number of classes is correspondingly increased.
- step S140 it is judged whether the number of updated classes is smaller than the number of classes before the update.
- step S150 If yes, go back to step S1 10; otherwise, go to step S150.
- the process returns to step S1 10, and the iterative merging of the classes is performed according to the Rank-Order distance between the classes until the number of classes before and after the update is unchanged.
- the class is merged based on the Rank-Order distance, and then the new class is divided as an iteration. It is assumed that the number of pre-merging classes is 6, based on the Rank-Order distance, the merged into 4 classes, and then the merged 4 classes. After splitting to get 5 classes, the number of updated classes is 5.
- the number of classes before the update is 6.
- the updated number is less than the number before the update, and the return continues to perform iteration. If the number of updated classes is less than the number of pre-update classes, indicating that the intra-class dispersion is large, that is, the objects in the class are not gathered enough, there may be outliers, and it is necessary to continue the iterative merging of the split classes. And classify the class until the number of updated classes is not greater than the number of classes before the update. When the number of classes before and after the update is equal, in step S150, a clustering result is obtained, the clustering result including a class including a plurality of objects and a class containing a single object.
- the resulting clustering result is a class that contains multiple objects, and a class that contains a single object.
- a plurality of objects within a class containing multiple objects are face images of the same person.
- a class that contains only a single object is an out-of-group object that is removed from the iteratively merged class using the Rank-Order distance.
- the clustering method provided in this embodiment uses the distance between objects within the class (for example, 1-cosine similarity, Euclidean distance, etc.) to measure the similarity of the two objects, and compares the similarities.
- P represents the accuracy of the clustering result
- R represents the recall rate in the clustering result
- CR represents the number of face images that each class has on average in the clustering result. It can be seen from the results in Table 1 that the total number of faces included in all the images in Scenario 1 is 2291, and all images contain 562 different people, and the average person corresponds to 4.07 face images, ie The average accuracy of the clustering results of the clustering results is 86.1%.
- the clustering accuracy obtained by the clustering method of the present disclosure is 99.1%, which is much higher than the accuracy of clustering only by Rank-Order distance.
- FIG. 7 is a schematic diagram of a clustering device according to an exemplary embodiment.
- the apparatus includes an iterative merging unit 100, an obtaining unit 200, a dividing unit 300, and a judging unit 400.
- the iterative merging unit 100 is configured to perform iterative merging of classes according to the Rank-Order distance between classes.
- the iterative merging unit 100 may include a third obtaining subunit and a merging subunit; the third obtaining subunit is configured to acquire an inter-class Rank-Order distance, and obtain an inter-class Rank-Order Normalized distance.
- the merging subunit is configured to merge the eligible classes respectively when the Rank-Order distance between the classes is less than the distance threshold and the normal-to-class Rank-Order normalization distance is less than one.
- the obtaining unit 200 is configured to obtain the intra-class aggregation degree corresponding to the iteratively merged class by using the distance between the respective objects in the class.
- the obtaining unit 200 may include a first acquiring subunit and a first calculating subunit; the first acquiring subunit is configured to acquire a distance between each object in the class.
- the first computing subunit is configured to calculate an average of distances between respective objects of the class to obtain the intra-class aggregation degree.
- the obtaining unit 200 may include a second acquiring subunit, a second calculating subunit, and a normalizing subunit; the second acquiring subunit is configured to acquire each object in the class The distance between them.
- the functions and implementation manners of the second obtaining subunit and the first obtaining subunit are the same.
- the second computing subunit is configured to calculate a distance average of distances between objects within the class based on distances between the objects within the class.
- the normalized subunit is configured to normalize the distance average to obtain an in-class degree of aggregation of the class.
- the dividing unit 300 is configured to divide, for each class obtained by iterative merging, an object whose distance between objects within the class is smaller than the degree of aggregation within the class into a new class, and update the number of classes.
- the dividing unit may include a first determining subunit, a marking subunit, a determining subunit, and a disassembling unit.
- the first determining subunit is configured to determine whether a distance between objects within the class is less than the intra-class aggregation degree.
- the marking subunit is configured to perform an object of connectivity between objects within the class that are less than the degree of aggregation within the class.
- the determining subunit is configured to determine a connected component within the class based on the connectivity flag.
- the split unit is configured to split the class into new classes based on the connected component and update the number of classes.
- the determining unit 400 is configured to determine whether the number of updated classes is less than the number of classes before updating; when the number of updated classes is less than the number of classes before updating, the iterative merging unit performs a Rank based on the class
- the -Order distance is iteratively merged with the class, until the number of classes before and after the update is unchanged, the clustering result is obtained, the clustering result includes a class containing multiple objects and a class containing a single object.
- the iterative merging unit combines the eligible classes according to the Rank-Order distance between the classes, thereby reducing the number of classes; and the obtaining unit calculates the class according to the distance between the objects in the class.
- the split unit splits the objects whose distances between objects within the class smaller than the degree of aggregation within the class into new classes until all the classes are split. Then, the judgment unit re-integrates and splits the split class, until each class can no longer be split to obtain a cluster containing multiple objects and a class containing a single object, thereby realizing the comparison of dissimilarity in the clustering process. Large objects are eliminated, improving the accuracy of clustering results. In particular, when there are many objects in the data set, but there are fewer objects belonging to the same class, the accuracy of the clustering results is relatively high.
- FIG. 8 is a block diagram of a terminal device 800 for clustering, according to an exemplary embodiment.
- the terminal device 800 can be a mobile phone, a computer, a digital broadcast terminal, a messaging device, a game console, a tablet device, a medical device, a fitness device, a personal digital assistant, and the like.
- terminal device 800 can include one or more of the following components: processing component 802, memory 804, power component 806, multimedia component 808, audio component 810, input/output (I/O) interface 812, and sensor component 814.
- Processing component 802 typically controls the overall operation of terminal device 800, such as operations associated with display, telephone calls, data communications, camera operations, and recording operations.
- Processing component 802 can include one or more processors 820 to execute instructions to perform all or part of the steps of the above described methods.
- processing component 802 can include one or more modules to facilitate interaction between component 802 and other components.
- processing component 802 can include a multimedia module to facilitate interaction between multimedia component 808 and processing component 802.
- Memory 804 is configured to store various types of data to support operation at device 800. Examples of such data include instructions for any application or method operating on terminal device 800, contact data, phone book Data, messages, pictures, videos, etc.
- the memory 804 can be implemented by any type of volatile or non-volatile storage device or a combination thereof, such as static random access memory (SRAM), electrically erasable programmable read only memory (EEPROM), erasable Programmable Read Only Memory (EPR0M), Programmable Read Only Memory (PR0M), Read Only Memory (ROM), Magnetic Memory, Flash Memory, Disk or Optical Disk.
- Power component 806 provides power to various components of terminal device 800.
- Power component 806 can include a power management system, one or more power sources, and other components associated with generating, managing, and distributing power for terminal device 800.
- the multimedia component 808 includes a screen that provides an output interface between the terminal device 800 and a user.
- the screen can include a liquid crystal display (LCD) and a touch panel (TP). If the screen includes a touch panel, the screen can be implemented as a touch screen to receive input signals from the user.
- the touch panel includes one or more touch sensors to sense touches, slides, and gestures on the touch panel. The touch sensor can sense not only the boundary of the touch or sliding action, but also the duration and pressure associated with the touch or slide operation.
- the multimedia component 808 includes a front camera and/or a rear camera. When the device 800 is in an operation mode, such as a shooting mode or a video mode, the front camera and/or the rear camera can receive external multimedia data. Each front and rear camera can be a fixed optical lens system or have focal length and optical zoom capabilities.
- the audio component 810 is configured to output and/or input an audio signal.
- the audio component 810 includes a microphone (MIC) that is configured to receive an external audio signal when the terminal device 800 is in an operational mode, such as a call mode, a recording mode, and a voice recognition mode.
- the received audio signal may be further stored in memory 804 or transmitted via communication component 816.
- the audio component 810 also includes a speaker for outputting an audio signal.
- the I/O interface 812 provides an interface between the processing component 802 and the peripheral interface module, which may be a keyboard, a click wheel, a button, or the like. These buttons can include, but are not limited to: Home button, Volume button, Start button, and Lock button.
- Sensor component 814 includes one or more sensors for providing terminal device 800 with a status assessment of various aspects. For example, sensor component 814 can detect an open/closed state of device 800, a relative positioning of components, such as the display and keypad of terminal device 800, and sensor component 814 can also detect terminal device 800 or terminal device 800 The position of the component changes, the presence or absence of contact of the user with the terminal device 800, the orientation or acceleration/deceleration of the terminal device 800, and the temperature change of the terminal device 800.
- Sensor assembly 814 can include a proximity sensor configured to detect the presence of nearby objects without any physical contact.
- Sensor assembly 814 may also include a light sensor, such as a CMOS or CCD image sensor, for use in imaging applications.
- the sensor component 814 can also include an acceleration sensor, a gyro sensor, a magnetic sensor, a pressure sensor, or a temperature sensor.
- Communication component 816 is configured to facilitate wired or wireless communication between terminal device 800 and other devices.
- the terminal device 800 can access a wireless network based on a communication standard such as WiFi, 2G, 3G or 4G, or a combination thereof.
- the communication component 816 receives broadcast signals or broadcast associated information from an external broadcast management system via a broadcast channel.
- the communication component 816 also includes a near field communication (NFC) module to facilitate short range communication.
- NFC near field communication
- the NFC module can be implemented based on radio frequency identification (RFID) technology, infrared data association (IrDA) technology, ultra-wideband (UWB) technology, Bluetooth (BT) technology, and other technologies.
- terminal device 800 may be implemented by one or more application specific integrated circuits (ASICs), digital signal processors (DSPs), digital signal processing devices (DSPDs), programmable logic devices (PLDs), A gated array (FPGA), controller, microcontroller, microprocessor, or other electronic component implementation is used to perform the above methods.
- ASICs application specific integrated circuits
- DSPs digital signal processors
- DSPDs digital signal processing devices
- PLDs programmable logic devices
- FPGA gated array
- controller microcontroller, microprocessor, or other electronic component implementation is used to perform the above methods.
- non-transitory computer readable storage medium comprising instructions, such as a memory 804 comprising instructions executable by the processor 820 of the terminal device 800 to perform the above method.
- the non-transitory computer readable storage medium may be a ROM, a random access memory (RAM), a CD-ROM, a magnetic tape, a floppy disk, and an optical data storage device.
- a non-transitory computer readable storage medium when instructions in the storage medium are executed by a processor of a mobile terminal, enabling the mobile terminal to perform a clustering method, the method comprising: according to Rank- between classes Order distance, iterative merging of classes; using the distance between objects in the class to obtain the intra-class aggregation degree of the iteratively merged class; for each class obtained by iterative merging, the distance between objects within the class is smaller than the class
- the inner degree of aggregation object is divided into a new class, and the number of classes is updated; when the number of updated classes is less than the number of classes before the update, the execution of the class is iteratively merged according to the Rank-Order distance between the classes.
- Steps until the number of classes before and after the update is unchanged, a clustering result is obtained, the clustering result including a class containing a plurality of objects and a class containing a single object.
- the intra-class aggregation degree corresponding to the iteratively merged class is obtained by using the distance between the objects in the class, and the method is as follows: acquiring a distance between each object in the class; calculating according to the distance between the objects in the class The average distance of the distances between the objects in the class gives the degree of intra-class polymerization of the class.
- the using the distance between each object in the class to obtain the intra-class aggregation degree corresponding to the iteratively merged class is as follows: Obtaining a distance between each object in the class; calculating an average distance of distances between the objects in the class according to the distance between the objects in the class; normalizing the distance average to obtain a class of the class Degree of internal polymerization.
- the object whose distance between the objects in the class is smaller than the degree of aggregation in the class is divided into a new class, and the number of the classes is updated, as follows: An object having a distance less than the intra-class aggregation degree performs a connectivity flag; determining a connected component in the class according to the connectivity flag; splitting the class into a new class according to the connected component, and updating the number of classes .
- FIG. 9 is a schematic structural diagram of a server in an embodiment of the present invention.
- the server 1900 can vary considerably depending on configuration or performance, and can include one or more central processing units (CPUs) 1922 (eg, one or more processors) and memory 1932, one Or more than one storage medium 1930 storing data 1942 or data 1944 (eg, one or one storage device in Shanghai).
- CPUs central processing units
- memory 1932 one or more than one storage medium 1930 storing data 1942 or data 1944 (eg, one or one storage device in Shanghai).
- the memory 1932 and the storage medium 1930 may be short-term storage or persistent storage.
- the program stored on the storage medium 1930 may include one or more modules (not shown), each of which may include a series of instruction operations in the terminal device.
- central processor 1922 can be configured to communicate with storage medium 1930, executing a series of instruction operations in storage medium 1930 on server 1900.
- Server 1900 may also include one or more power supplies 1926, one or more wired or wireless network interfaces 1950, one or more input and output interfaces 1958, one or more keyboards 1956, and/or one or more operating systems 1941.
- Windows ServerTM Mac OS XTM, UnixTM, LinuxTM, FreeBSDTM, and more.
- non-transitory computer readable storage medium comprising instructions, such as a memory 1932 or a storage medium 1930, which may be executed by the processor 1922 of the terminal device to perform the above method.
- the non-transitory computer readable storage medium may be a ROM, a random access memory (RAM), a CD-ROM, a magnetic tape, a floppy disk, and an optical data storage device.
- a non-transitory computer readable storage medium when instructions in the storage medium are executed by a processor of a terminal device, enabling the terminal device to perform a clustering method, the method comprising: according to Rank- between classes Order distance, iterative merging of classes; using the distance between objects within the class Iteratively classifies the intra-class aggregation degree corresponding to the merged class; for each class obtained by iterative merging, divides the object between the objects within the class less than the degree of aggregation within the class into a new class, and updates the number of classes When the number of updated classes is less than the number of classes before the update, the step of performing iterative merging of the classes according to the Rank-Order distance between the classes is returned, until the number of classes before and after the update is unchanged, the clustering result is obtained.
- the clustering result includes a class containing a plurality of objects and a class containing a single object.
- the intra-class aggregation degree corresponding to the iteratively merged class is obtained by using the distance between the objects in the class, and the method is as follows: acquiring a distance between each object in the class; calculating according to the distance between the objects in the class The average distance of the distances between the objects in the class gives the degree of intra-class polymerization of the class.
- the intra-class aggregation degree corresponding to the iteratively merged class is obtained by using the distance between the objects in the class, and the method is as follows: acquiring a distance between each object in the class; calculating according to the distance between the objects in the class The average distance of the distances between the objects in the class; normalizing the distance average to obtain the intra-class polymerization degree of the class.
- the object whose distance between the objects in the class is smaller than the degree of aggregation in the class is divided into a new class, and the number of the classes is updated, as follows: An object having a distance less than the intra-class aggregation degree performs a connectivity flag; determining a connected component in the class according to the connectivity flag; splitting the class into a new class according to the connected component, and updating the number of classes .
- the iterative merging of the classes according to the Rank-Order distance between the classes is as follows: obtaining the Rank-Order distance between the classes, and obtaining the Rank-Order normalization distance between the classes; The -Order distance is less than the distance threshold, and when the Rank-Order normalization distance between the classes is less than 1, the classes are merged.
Abstract
Description
Claims
Priority Applications (5)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
MX2014010879A MX358804B (es) | 2014-03-14 | 2014-07-24 | Metodo y dispositivo de agrupamiento. |
RU2015129676A RU2628167C2 (ru) | 2014-03-14 | 2014-07-24 | Способ и устройство для кластеризации |
JP2016506778A JP6101399B2 (ja) | 2014-03-14 | 2014-07-24 | クラスタリング方法、クラスタリング装置、端末装置、プログラム及び記録媒体 |
KR1020147026527A KR20150117202A (ko) | 2014-03-14 | 2014-07-24 | 클러스터링 방법, 관련 장치, 프로그램 및 기록매체 |
US14/532,271 US10037345B2 (en) | 2014-03-14 | 2014-11-04 | Clustering method and device |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201410097422.5A CN103914518B (zh) | 2014-03-14 | 2014-03-14 | 聚类方法及相关装置 |
CN201410097422.5 | 2014-03-14 |
Related Child Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US14/532,271 Continuation US10037345B2 (en) | 2014-03-14 | 2014-11-04 | Clustering method and device |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2015135276A1 true WO2015135276A1 (zh) | 2015-09-17 |
Family
ID=51040198
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/CN2014/082876 WO2015135276A1 (zh) | 2014-03-14 | 2014-07-24 | 聚类方法及相关装置 |
Country Status (7)
Country | Link |
---|---|
EP (1) | EP2919165B1 (zh) |
JP (1) | JP6101399B2 (zh) |
KR (1) | KR20150117202A (zh) |
CN (1) | CN103914518B (zh) |
MX (1) | MX358804B (zh) |
RU (1) | RU2628167C2 (zh) |
WO (1) | WO2015135276A1 (zh) |
Families Citing this family (14)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US10037345B2 (en) | 2014-03-14 | 2018-07-31 | Xiaomi Inc. | Clustering method and device |
CN103914518B (zh) * | 2014-03-14 | 2017-05-17 | 小米科技有限责任公司 | 聚类方法及相关装置 |
CN104268149A (zh) * | 2014-08-28 | 2015-01-07 | 小米科技有限责任公司 | 聚类方法及装置 |
CN104408130B (zh) * | 2014-11-26 | 2018-04-27 | 小米科技有限责任公司 | 图片整理的方法及装置 |
CN104598544A (zh) * | 2014-12-31 | 2015-05-06 | 小米科技有限责任公司 | 聚类分析方法、装置及设备 |
KR101811962B1 (ko) * | 2016-12-07 | 2017-12-22 | 울산대학교 산학협력단 | 비선형 데이터의 클래스 변별성 평가 방법 및 장치 |
CN109063737A (zh) * | 2018-07-03 | 2018-12-21 | Oppo广东移动通信有限公司 | 图像处理方法、装置、存储介质及移动终端 |
CN110363382A (zh) * | 2019-06-03 | 2019-10-22 | 华东电力试验研究院有限公司 | 全能型乡镇供电所一体化业务融合技术 |
CN110730270B (zh) * | 2019-09-09 | 2021-09-14 | 上海斑马来拉物流科技有限公司 | 一种短信分组方法、装置及计算机存储介质、电子设备 |
CN110826338B (zh) * | 2019-10-28 | 2022-06-17 | 桂林电子科技大学 | 一种单选择门与类间度量的细粒度语义相似识别的方法 |
CN110826616B (zh) * | 2019-10-31 | 2023-06-30 | Oppo广东移动通信有限公司 | 信息处理方法及装置、电子设备、存储介质 |
TWI756597B (zh) * | 2019-12-10 | 2022-03-01 | 晶睿通訊股份有限公司 | 隊列分析方法與影像監控設備 |
CN111860700B (zh) * | 2020-09-22 | 2020-12-15 | 深圳须弥云图空间科技有限公司 | 一种能耗分类方法、装置、存储介质及设备 |
CN113255841B (zh) * | 2021-07-02 | 2021-11-16 | 浙江大华技术股份有限公司 | 一种聚类方法、聚类装置和计算机可读存储介质 |
Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20120294540A1 (en) * | 2011-05-17 | 2012-11-22 | Microsoft Corporation | Rank order-based image clustering |
CN103473255A (zh) * | 2013-06-06 | 2013-12-25 | 中国科学院深圳先进技术研究院 | 一种数据聚类方法、系统及数据处理设备 |
TW201407390A (zh) * | 2012-08-15 | 2014-02-16 | Acer Inc | 資料分群裝置和方法 |
CN103914518A (zh) * | 2014-03-14 | 2014-07-09 | 小米科技有限责任公司 | 聚类方法及相关装置 |
Family Cites Families (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JPH10171823A (ja) * | 1996-12-09 | 1998-06-26 | Mitsubishi Electric Corp | 文書の自動分類方法およびその装置 |
RU2345414C1 (ru) * | 2007-08-10 | 2009-01-27 | Общество с ограниченной ответственностью "Рекогмишн" | Способ построения системы индексирования для поиска объектов на цифровых изображениях |
US9171071B2 (en) * | 2010-03-26 | 2015-10-27 | Nec Corporation | Meaning extraction system, meaning extraction method, and recording medium |
-
2014
- 2014-03-14 CN CN201410097422.5A patent/CN103914518B/zh active Active
- 2014-07-24 JP JP2016506778A patent/JP6101399B2/ja active Active
- 2014-07-24 MX MX2014010879A patent/MX358804B/es active IP Right Grant
- 2014-07-24 KR KR1020147026527A patent/KR20150117202A/ko active Search and Examination
- 2014-07-24 WO PCT/CN2014/082876 patent/WO2015135276A1/zh active Application Filing
- 2014-07-24 RU RU2015129676A patent/RU2628167C2/ru active
- 2014-12-19 EP EP14199432.7A patent/EP2919165B1/en active Active
Patent Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20120294540A1 (en) * | 2011-05-17 | 2012-11-22 | Microsoft Corporation | Rank order-based image clustering |
TW201407390A (zh) * | 2012-08-15 | 2014-02-16 | Acer Inc | 資料分群裝置和方法 |
CN103473255A (zh) * | 2013-06-06 | 2013-12-25 | 中国科学院深圳先进技术研究院 | 一种数据聚类方法、系统及数据处理设备 |
CN103914518A (zh) * | 2014-03-14 | 2014-07-09 | 小米科技有限责任公司 | 聚类方法及相关装置 |
Also Published As
Publication number | Publication date |
---|---|
EP2919165A3 (en) | 2015-12-23 |
RU2628167C2 (ru) | 2017-08-15 |
JP6101399B2 (ja) | 2017-03-29 |
MX358804B (es) | 2018-08-29 |
EP2919165B1 (en) | 2018-02-07 |
JP2016516251A (ja) | 2016-06-02 |
CN103914518A (zh) | 2014-07-09 |
KR20150117202A (ko) | 2015-10-19 |
CN103914518B (zh) | 2017-05-17 |
EP2919165A2 (en) | 2015-09-16 |
RU2015129676A (ru) | 2017-04-24 |
MX2014010879A (es) | 2016-08-30 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
WO2015135276A1 (zh) | 聚类方法及相关装置 | |
US11663468B2 (en) | Method and apparatus for training neural network, and storage medium | |
WO2020029966A1 (zh) | 视频处理方法及装置、电子设备和存储介质 | |
US9953212B2 (en) | Method and apparatus for album display, and storage medium | |
WO2020048308A1 (zh) | 多媒体资源分类方法、装置、计算机设备及存储介质 | |
US11244228B2 (en) | Method and device for recommending video, and computer readable storage medium | |
WO2021036382A1 (zh) | 图像处理方法及装置、电子设备和存储介质 | |
WO2017107419A1 (zh) | 屏幕解锁方法、装置及终端 | |
WO2017020476A1 (zh) | 关联用户的确定方法及装置 | |
KR101639502B1 (ko) | 클러스터링 방법, 관련장치, 프로그램 및 기록매체 | |
RU2639682C2 (ru) | Способ и устройство для сворачивания изображений | |
WO2017219484A1 (zh) | 设置身份图像的方法及装置 | |
WO2022160849A1 (zh) | 视频处理方法及装置、电子设备和存储介质 | |
WO2016206295A1 (zh) | 字符确定方法及装置 | |
CN111259967A (zh) | 图像分类及神经网络训练方法、装置、设备及存储介质 | |
TW202036476A (zh) | 圖像處理方法及裝置、電子設備和儲存介質 | |
JP2016517110A5 (zh) | ||
US10037345B2 (en) | Clustering method and device | |
US20150262033A1 (en) | Method and terminal device for clustering | |
CN109325141B (zh) | 图像检索方法及装置、电子设备和存储介质 | |
CN107992893B (zh) | 压缩图像特征空间的方法及装置 | |
WO2019214234A1 (zh) | 一种输入预测方法及装置 | |
CN113312475B (zh) | 一种文本相似度确定方法及装置 | |
WO2022116524A1 (zh) | 图片识别方法、装置、电子设备及介质 | |
CN109063001B (zh) | 页面展示方法及装置 |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
WWE | Wipo information: entry into national phase |
Ref document number: MX/A/2014/010879 Country of ref document: MX |
|
ENP | Entry into the national phase |
Ref document number: 2016506778 Country of ref document: JP Kind code of ref document: A |
|
WWE | Wipo information: entry into national phase |
Ref document number: 1020147026527 Country of ref document: KR |
|
ENP | Entry into the national phase |
Ref document number: 2015129676 Country of ref document: RU Kind code of ref document: A |
|
121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 14885147 Country of ref document: EP Kind code of ref document: A1 |
|
REG | Reference to national code |
Ref country code: BR Ref legal event code: B01A Ref document number: 112014024397 Country of ref document: BR |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
122 | Ep: pct application non-entry in european phase |
Ref document number: 14885147 Country of ref document: EP Kind code of ref document: A1 |
|
ENP | Entry into the national phase |
Ref document number: 112014024397 Country of ref document: BR Kind code of ref document: A2 Effective date: 20140930 |