Patents
Literature
Hiro is an intelligent assistant for R&D personnel, combined with Patent DNA, to facilitate innovative research.
Hiro

124 results about "Affinity propagation" patented technology

In statistics and data mining, affinity propagation (AP) is a clustering algorithm based on the concept of "message passing" between data points. Unlike clustering algorithms such as k-means or k-medoids, affinity propagation does not require the number of clusters to be determined or estimated before running the algorithm. Similar to k-medoids, affinity propagation finds "exemplars", members of the input set that are representative of clusters.

Clustering analysis-based intelligent fault diagnosis method for antifriction bearing of mechanical system

The invention discloses a clustering analysis-based intelligent fault diagnosis method for an antifriction bearing of a mechanical system. A diagnosis model is trained firstly, comprising the following steps: collecting standard vibration signal samples of five fault and normal bearing states of an outer ring, an inner ring, a rolling body and a holding frame; decomposing signals, extracting original vibration signals as well as time domain and frequency domain characteristics of decomposed components to obtain an original characteristic set; removing redundancy by means of a self-weight algorithm and an AP (Affinity Propagation) clustering algorithm to obtain Z optimal characteristics; classifying sample statuses by means of the AP clustering algorithm to obtain a well-trained diagnosis model. A fault diagnosis is performed by the following steps: collecting real-time vibration information of a bearing, decomposing the signals, extracting the optimal characteristics determined by the model, importing the AP clustering algorithm to cluster parameters based on the diagnosis model, comparing with the Z characteristics known in the model to obtain a category of a current unknown signal, so as to complete the fault diagnosis. According to the clustering analysis-based intelligent fault diagnosis method disclosed by the invention, both EEMD (Ensemble Empirical Mode Decomposition) and WPT are utilized to decompose the vibration signals, more refined bearing status information can be acquired, the self-weight algorithm and the AP clustering algorithm increase intelligence of the diagnosis, and therefore accurate diagnosis is ensured.
Owner:GUILIN UNIV OF ELECTRONIC TECH

Holographic touch interactive exhibition system with multisource input and intelligent information optimizing functions

The invention discloses a holographic touch interactive exhibition system with multisource input and intelligent information optimizing functions. The system senses surrounding environment information by the aid of a plurality of sensors, a smoke sensor is started to monitor fire without audiences, faces in videos are recognized when the audiences are present, proper broadcasting information is recommended, and the identity sense of customers is enhanced. The exhibition system introduces an interactive mode, and the audiences can realize man-machine interaction by the aid of a holographic touch screen to acquire information that the audiences want to know. Besides, by the aid of an intelligent information mining algorithm and features extracted by a color co-occurrence matrix, finding of a facial expression recognition area of interest and feature extraction are combined into one step, the faces are clustered by the aid of an affinity propagation clustering algorithm, and the broadcasting information is changed according to emotion. By the aid of the exhibition system, the information can be effectively pushed according to ages and genders of the audiences in a complicated background environment, sufficient exhibition can be realized, the audiences can be guided to more comprehensively know the information, and the identity sense of the audiences is enhanced.
Owner:JIANGSU MINGWEI WANSHENG TECH CO LTD

Wi-Fi-based indoor positioning navigation method

InactiveCN105372628AFast and efficient convergenceFast positioning responsePosition fixationLocation information based servicePattern recognitionCluster algorithm
The invention discloses a Wi-Fi-based indoor positioning navigation method. The Wi-Fi-based indoor positioning navigation method includes an acquisition stage, an online positioning stage and a navigation stage. According to the acquisition stage, RSS fingerprint information which is acquired from reference points in the same direction is clustered through an affinity propagation clustering algorithm, so that different classes and class leaders can be formed, and a fingerprint database can be established and is stored in a server. According to the online positioning stage, a handheld terminal receives the RSS fingerprint information and sends the same to the server; the server performs class matching on the received RSS fingerprint information and fingerprint information of the server; a fingerprint graph matrix is formed according to a matched class leader set and is transmitted to the handheld terminal for precise positioning; norm minimization processing and corresponding weighing are performed on rough positioning information through using an improved compressed sensing model; and the positioning of coordinates can be completed. According to the navigation stage, a shortest path is searched through utilizing a quantum cellular ant algorithm; and a position is tracked and navigated in real time through using Kalman filtering system. The Wi-Fi-based indoor positioning navigation method of the invention has the advantages of simple algorithms, small workload of affine clustering and matching, short response time and small positioning error.
Owner:SHANGHAI YAFENG INFORMATION TECH CO LTD

Method, equipment and device for improving intelligent customer service response rate, and storage medium

The invention discloses a method, equipment and a device for improving an intelligent customer service response rate, and a storage medium. The method comprises the following steps that: obtaining thenon-response questions of intelligent customer service, and classifying the non-response questions to obtain knowledge type questions; calculating a first similarity among knowledge type questions; according to the first similarity, through an affinity propagation clustering algorithm, clustering each knowledge type question to obtain a plurality of clustering clusters; taking the clustering center of each clustering cluster as a target standard question, and obtaining a target standard answer corresponding to the target standard question; and adding the target standard question and the corresponding target standard answer into an intelligent customer service knowledge base. In the method, the knowledge type questions in the non-response questions are clustered through the affinity propagation clustering algorithm, the clustering center of each obtained clustering cluster is taken as the target standard question to be added into the intelligent customer service, and the clustering center is a question with the highest representativeness in each clustering cluster so as to improve the intelligent customer service response rate and improve user experience.
Owner:PING AN TECH (SHENZHEN) CO LTD

Facial expression recognition method based on facial motion unit combination features

The invention discloses a facial expression recognition method based on facial motion unit combination features. The facial expression recognition method based on the facial motion unit combination features is used for solving the technical problem of low recognition rate of a single facial motion unit with an existing facial expression recognition method based on facial motion units. The technical scheme includes that the facial expression recognition method based on the facial motion unit combination features comprises the steps of building a large-scale facial expression data base, carrying out clustering of each category of facial expressions and corresponding training samples by using the affinity propagation (AP) clustering algorithm, judging arbitrary unit (AU) combinations in each sub-category, determining the number of the sub-categories under the same facial expression by combining main AU combinations, generating the number of the categories of the training sample by combining the sub-categories of all facial expressions, and carrying out classification training by using the support vector machine (SVM) method. According to the facial expression recognition method based on the facial motion unit combination features, the recognition rate of the single facial motion unit is improved, namely that average recognition rate of a single AU unit is improved from 87.5% in prior are to 90.1% and by 2.6%.
Owner:NORTHWESTERN POLYTECHNICAL UNIV

Extensible partition method for associated flow graph data

The invention discloses an extensible partition method for associated flow graph data, comprising the following steps: (1) preprocessing graph data and converting a node as the node ID; (2) adding each preprocessed side which is existed in an ID form in FIFO and waiting to enter into a sliding window to process; 3) completing the sliding window and calculating the PageRank value of each node according to a mixing approximation PageRank method; (4), tracking the collection of the initial node corresponded by each node in a subgraph, which is composed of sides in the sliding window and obtaining associated value of each node; (5) obtaining a plurality of centroids and corresponding clusters by adopting an affinity propagation clustering algorithm to all nodes in the window; (6) obtaining a plurality of partitioning results which are not of uniform size via associating repeated iteration of a clustering method and storing the partitioning results whose scales are less than threshold value in the sliding window; (7) transmitting the partitioning results whose scales reach or exceed the threshold value to the appropriate storage node by using a data distribution method; and finishing the graph data partitioning. Compared with the prior art, the method provided by the invention has higher partitioning quality.
Owner:HUAZHONG UNIV OF SCI & TECH

Similarity propagation and popularity dimensionality reduction based mixed recommendation method

The invention relates to a similarity propagation and popularity dimensionality reduction based mixed recommendation method. According to the similarity propagation and popularity dimensionality reduction based mixed recommendation method, sparse data are processed in two phases; firstly, neighbors of the sparse data are expanded due to constant iteration of similar matrixes of users, resources and Tags through a similarity propagation method and accordingly elements for zero are filled; then a score algorithm in a search engine is introduced to calculate the Tag popularity in consideration of the problem that original data is provided with meaningless rubbish Tags, the tags with the popularity smaller than a certain threshold value are deleted to simplify data to perform dimensionality reduction on the matrix; recommendation results are diversified and the sparsity and cold starting problem can be relieved to some extent due to the fact that the recommendation based on contents and the collaborative filtering recommendation are combined. The similarity propagation and popularity dimensionality reduction based mixed recommendation method has the advantages of solving the problem of data sparsity in the individual recommendation process and being high in recommendation result accuracy, high in accuracy and high in reliability.
Owner:UNIV OF SHANGHAI FOR SCI & TECH

Polarized SAT (synthetic aperture radar) image classification method based on improved affinity propagation clustering

The invention discloses a polarized SAR (synthetic aperture radar) image classification method based on improved affinity propagation clustering. The problem of low classification accuracy in the existing unsupervised polarized SAR classification method is mainly solved. The method comprises the implementation steps of: carrying out four component decompositions on each pixel point, extracting four scattering powers of each pixel point; dividing an image according to the obtained scattering powers to obtain four classes; equally dividing each obtained class into 20 small classes; clustering the 20 small classes in each class by the improved affinity propagation clustering to obtain the pre-classification result of the image; and finally, carrying out iterative classification on a pre-classified image by a Wishart classifier to obtain the final classification result. Compared with the classical classification method, for the method disclosed by the invention, the division on a polarized SAR image is stricter; the classification effect is better; the computation complexity is small; and the polarized SAR image classification method can be used for carrying out terrain classification and target identification on the polarized SAR image.
Owner:XIDIAN UNIV

Online social network multisource point information tracing system and method thereof

The invention relates to an online social network multisource point information tracing system and a method thereof. The method comprises the following steps: arranging a part of observation nodes in a network so as to acquire the range that messages are transmitted in the network and the moments that the messages are received, namely, mapping the timeliness and the spatiality of observation nodes that messages are received for multiple times into a network structure firstly, primarily confirming a source point range, and confirming a source point alternative set and a time delay alternative set by using a restart random walk algorithm; converting a positioning problem into a clustering problem by virtue of similarity of source points and single observation nodes in the alternative set in terms of time and space, designing a clustering algorithm based on affinity propagation learning, finding the optimal representative point set, and confirming the number and the positions of the source points. By adopting the online social network multisource point information tracing system and the method thereof, the nodes are sufficiently utilized to receive time dimension information of the messages, under the condition that the state information of all user nodes in the network is not acquired, the number and the positions of propagation source points can be relatively accurately confirmed, harmful information propagation can be effectively controlled, and social harmony and stability can be maintained.
Owner:THE PLA INFORMATION ENG UNIV

Ensemble classification method based on randomized greedy feature selection

The invention discloses an ensemble classification method based on randomized greedy feature selection, and belongs to the field of bioinformatics and data mining. The method is used for classifying gene expression data related to plant stress response. The method includes the following steps that 1, randomness is introduced into a traditional greedy algorithm to conduct feature selection; 2, a weighting local modular function serving as a community discovery evaluation index in a complex network is used as heuristic information of the randomized greedy algorithm; 3, base classifiers are trained in each feature subset with a support vector machine algorithm; 4, clustering partition is conducted on the base classifiers with an affinity propagation clustering algorithm; 5, base classifiers serving as class representative points in the cluster are used for conducting integration, and an ensemble classification model is formed with a simple majority voting method. By means of the method, whether plant samples are stressed or not can be recognized according to gene expression data, and the microarray data classification precision is greatly improved; besides, the algorithm is high in generalization capability and has very high stability.
Owner:DALIAN UNIV OF TECH

Method for obtaining interval parameters of typical working conditions of harmonic users

The invention relates to a method for obtaining interval parameters of typical working conditions of harmonic users. The method comprises the following steps of obtaining maximum values and minimum values of a plurality of monitoring time segments of any phase in harmonic detection data of users to form an interval data sample set; performing interval principal component analysis on the interval data sample set by adopting CPCA, and selecting a sample characteristic quantity according to a variance contribution rate; calculating the similarity between data points for the sample characteristic quantity, and defining input parameters to perform affinity propagation clustering until an algorithm is subjected to iterative convergence; calculating deviation degree indexes of interval sample points of the sample characteristic quantity, and when the deviation degree indexes are smaller than a set threshold, defining the deviation degree indexes as transitional working conditions and removing the sample characteristic quantity and corresponding original data; outputting an original sample set according to a working condition division result which does not contain the transitional working conditions; and calculating typical parameters of harmonics of the working conditions. According to the method, the harmonic pollution level of an electric network after user access and running can be assessed more reasonably, thereby facilitating analysis and control on the harmonic users.
Owner:FUZHOU UNIV

Stock index tracking and prediction method and system based on social network clustering

The invention discloses a stock index tracking and prediction method based on social network clustering. The method comprises the following steps: acquiring indices of a previous month and a current month and component stock data from a third-party database, and carrying out data cleaning, so that in-sample data and out-of-sample data that can be used for researches are obtained; calculating metric distances through correlation coefficients among component stocks to construct a social network among the component stocks, carrying out the network clustering through the adaptive affinity propagation clustering algorithm, extracting a clustering center of each cluster to form a stock pool, utilizing an index tracking optimization model to achieve the optimized tracking of stocks in the stock pools on a benchmark index, and determining the optimized weight of index tracking; and applying the stock pools and the optimized weight obtained through in-sample training to the index tracking for the out-of-sample data, so that a predicted index is obtained. The invention further provides a stock index tracking and prediction system. The method and system provided by the invention has the advantages that correlation among the constructed stock pools is low, tracking errors are small, replication results are highly stable, and accurate index tracking is achieved.
Owner:NANJING UNIV

Road congestion discovery method based on higher-order Markov model

InactiveCN108765940ATroubleshoot runtime performance issuesPrevent overfittingDetection of traffic movementForecastingState predictionAlgorithm
The invention discloses a road congestion discovery method based on a higher-order Markov model. The method includes two steps: probability transfer matrix calculation and congestion state prediction;during probability transfer matrix calculation, obtaining appropriate road section state classification by employing affinity propagation clustering, and then calculating a transfer probability matrix of the road section state in different time intervals; and during congestion state prediction, predicting the congestion state with the combination of the transfer probability matrix according to the state of road section at which a moving object is located and adjacent road sections. According to the method, the transfer probability matrix is calculated through the affinity propagation clustering algorithm in advance and then stored in a database, when a model is required for prediction, the probability matrix is directly read from the database, the transfer probability matrix is calculatedin advance and stored, the matrix can be directly inquired during prediction, the speed of real-time prediction is greatly increased, and the classification accuracy can be improved by employing affinity propagation clustering so that the correctness of the probability transfer matrix is improved.
Owner:NANJING UNIV OF POSTS & TELECOMM

XML (extensible markup language) document spectrum clustering method based on affinity propagation

The invention discloses an XML (extensible markup language) document spectrum clustering method based on affinity propagation in the technical field of Web data management. The method disclosed by the invention comprises the following steps: representing an XML document by virtue of a characteristic vector formed by an XML path; then calculating the initial similarity between every two XML document vectors to obtain an initial similarity matrix W, and further determining an initial affinity relation matrix N; then correcting the similarity between every two implied similar XML document vectors by adopting an affinity propagation algorithm, so as to obtain a final similarity matrix A; and finally determining the clustering number and clustering result by applying a first specified method according to the final similarity matrix A. According to the method disclosed by the invention, the initial similarity matrix between XML documents obtained by adopting the traditional similarity calculation method is corrected by adopting the affinity propagation algorithm, and similarity between the implied similar XML documents can be reflected; and the method disclosed by the invention is independent of sequence of the XML documents and is applicable to the clustering of XML document retrieval results which are arranged in any sequence.
Owner:NORTH CHINA ELECTRIC POWER UNIV (BAODING)
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products