1442 results about "Similarity matrix" patented technology

Systems and methods to generate modified/refined user inputs based on the original user input, such as a search query, are disclosed. The method may be implemented for Roman-based and/or non-Roman based language such as Chinese. The method may generally include receiving an original user input and identifying core terms therein, determining potential alternative inputs by replacing core term(s) in the original input with another term according to a similarity matrix and/or substituting a word sequence in the original input with another word sequence according to an expansion/contraction table where one word sequence is a substring of the other, computing likelihood of each potential alternative input, and selecting most likely alternative inputs according to a predetermined criteria, e.g., likelihood of the alternative input being at least that of the original input. A cache containing pre-computed original user inputs and corresponding alternative inputs may be provided.

Object clustering techniques are disclosed. A nonnegative sparse similarity matrix is constructed for a set of objects. Nonnegative factorization of the nonnegative sparse similarity matrix is performed. Objects of the set of objects are allocated to clusters based on factor matrices generated by the nonnegative factorization of the nonnegative sparse similarity matrix.

A device, computer program product and a method for searching, navigating or retrieving documents in a set of electronic documents, including performing a link analysis of the set of electronic documents. The link analysis includes one of analyzing at least two of the set of documents with at least a portion of a similarity graph constructed among the set of documents and analyzing the at least two of the set of documents with the at least a portion of the similarity graph and at least a portion of a hyperlink graph constructed from hyperlinks between the set of documents. Also described is a method for building a similarity matrix.

The invention discloses a gesture recognition method based on an acceleration sensor. The gesture recognition method based on an acceleration sensor comprises the following steps: automatically collecting gesture acceleration data, preprocessing, calculating the similarity of all gesture sample data so as to obtain a similarity matrix, extracting a gesture template, constructing a gesture dictionary by utilizing the gesture template, and carrying out sparse reconstruction and gesture classification on the gesture sample data to be recognized by adopting an MSAMP (modified sparsity algorithm adaptive matching pursuit) algorithm. According to the invention, the compressed sensing technique and a traditional DTW (dynamic time warping) algorithm are combined, and the adaptability of the gesture recognition to different gesture habits is improved, and by adopting multiple preprocessing methods, the practicability of the gesture recognition method is improved. Additionally, the invention also discloses an automatic collecting algorithm of the gesture acceleration data; the additional operation of traditional gesture collection is eliminated; the user experience is improved; according to the invention, a special sensor is not required, the gesture recognition method based on the acceleration sensor can be used for terminals carried with the acceleration sensor; the hardware adaptability is favorable, and the practicability of the recognition method is enhanced. The coordinate system is uniform, and can be adaptive to different multiple gesture habits.

The invention discloses a detection method for an abnormal behavior of a vehicle based on spectrum clustering. The detection method comprises the following steps: obtaining a space-time track of a moving target through video tracking; removing abnormality and preprocessing, thereby obtaining a normal track; constructing an image for the track, thereby obtaining an undirected image corresponding to a track sequence; calculating similarity among tracks, thereby obtaining a similarity matrix; performing Laplace transformation on the similarity matrix, thereby obtaining a Laplace matrix; clustering the feature vector matrix of the front k maximal feature values; after performing mode learning on a motion track, obtaining motion modes of the target under a normal state; if a new track meets one of the motion modes, i.e. a normal motion mode, confirming that the traffic is normal; and if not, confirming that the vehicle abnormally runs, namely, the traffic abnormality occurs. According to the detection method, through the clustering learning for the vehicle track, the monitoring for the abnormal behavior of the vehicle is realized, the abnormal lane change is detected and the basis for automation of traffic management is supplied.

In accordance with the teachings described herein, systems and methods are provided for analyzing transactional data. A similarity analysis program may be used that receives time-series data relating to transactions of an organization and performs a similarity analysis of the time-series data to generate a similarity matrix. A data reduction program may be used that receives the time-series data and performs one or more dimension reduction operations on the time-series data to generate reduced time-series data. A distance analysis program may be used that performs a distance analysis using the similarity matrix and the reduced time-series data to generate a distance matrix. A data analysis program may be used that performs a data analysis operation, such as a data mining operation, using the distance matrix to generate a data mining analysis of the transactional data.

The invention relates to a two-stage hybrid particle swarm optimization clustering method, which is mainly used for solving the problems of greater time consumption and low accuracy of the conventional particle swarm optimization K-mean clustering method when the number of dimensions of samples is higher. The technical scheme disclosed by the invention comprises the following steps: (1) reading a data set and the number K of clusters; (2) taking statistics on information of dimensionality; (3) standardizing the dimensionality; (4) calculating a similarity matrix; (5) generating a candidate initial clustering center; (6) performing particle swarm K-mean partitional clustering; and (7) outputting a particle swarm optimal fitness value and a corresponding data set class cluster partition result. According to the two-stage hybrid particle swarm optimization clustering method disclosed by the invention, the first-stage clustering is firstly performed by adopting agglomerative hierarchical clustering, a simplified particle encoding way is provided, the second-stage clustering is performed on data by particle swarm optimization K-mean clustering, the advantages of hierarchical agglomeration, K-mean and particle swarm optimization methods are integrated, the clustering speed is accelerated, and the global convergence ability and the accuracy of the clustering result of the method are improved.

Embodiments are described for a method for processing graph data by executing a Markov Clustering algorithm (MCL) to find clusters of vertices of the graph data, organizing the graph data by column by calculating a probability percentage for each column of a similarity matrix of the graph data to produce column data, generating a probability matrix of states of the column data, performing an expansion of the probability matrix by computing a power of the matrix using a Map-Reduce model executed in a processor-based computing device; and organizing the probability matrix into a set of sub-matrices to find the least amount of data needed for the Map-Reduce model given that two lines of data in the matrix are required to compute a single value for the power of the matrix. One of at least two strategies may be used to computing the power of the matrix (matrix square, M²) based on simplicity of execution or improved memory usage.

A stream of ordered information, such as, for example, audio, video and/or text data, can be windowed and parameterized. A similarity between the parameterized and windowed stream of ordered information can be determined, and a probabilistic decomposition or probabilistic matrix factorization, such as non-negative matrix factorization, can be applied to the similarity matrix. The component matrices resulting from the decomposition indicate major components or segments of the ordered information. Excerpts can then be extracted from the stream of ordered information based on the component matrices to generate a summary of the stream of ordered information.

The invention discloses a multi-source heterogeneous multi-attribute POI (point of interest) integration method. The multi-source heterogeneous multi-attribute POI integration method includes firstly acquiring data sets to be integrated from POI data sources A and B, and deweighting two heterogeneous-attribute data sets respectively; browsing each POI in the two data sets respectively and calculating similarity of each attribute of the POI to obtain an attribute similarity matrix on the premise that the attribute similarity calculation rule is obeyed; solving a weighted multi-attribute POI similarity vector; calculating the maximum value Max of various components in the POI similarity vector and comparing the Max with a threshold value T; adding different attribute items of the POI standing for the same geographic entity and integrating the same attribute items of the same value. According to overall importance and different influence degrees of the attributes, various types of attributes of the POI are considered differently, so that the method better lives up to actual operation of POI integration, and accuracy and efficiency of automatic POI integration can be remarkably improved.

The embodiment of the invention discloses an information processing method and device. The method comprises the steps that an HTML document set which is obtained in advance is analyzed, and text data sets contained in the HTML document set are extracted; word segmentation is conducted on the text data sets, and a text segmentation table is obtained; word frequency analysis is conducted on all words in the text segmentation table, and a text vector space matrix is constructed; discrete point text vectors in the text vector space matrix are eliminated, and a text similarity matrix of all text vectors in the text vector space matrix without the discrete point text vectors is obtained; according to the text similarity matrix, topic cluster is conducted on the text data set. By means of the method, a word list can be accurately constructed, topic cluster is conducted after the discrete point text vectors are eliminated, the topic cluster speed is increased, and the topic cluster accuracy is improved.

Method for identifying geologic features from geophysical or attribute data using windowed principal component (22), or independent component, or diffusion mapping (61) analysis. Subtle features are made identifiable in partial or residual data volumes. The residual data volumes (24) are created by (36) eliminating data not captured by the most prominent principal components (14). The partial data volumes are created by (35) projecting the data (21) on to selected principal components (22, 61). Geologic features may also be identified from pattern analysis (77) or anomaly volumes (62, 79) generated with a variable-scale data similarity matrix (73). The method is suitable for identifying physical features indicative of hydrocarbon potential.

The invention discloses a recommendation algorithm based on multi-index grading. The recommendation algorithm comprises the following steps of firstly, recognizing index keywords, secondly, extracting suggestion grading, thirdly, constructing a user and commodity similarity matrix, fourthly, using a two-way clustering algorithm for obtaining a clustering matrix, fifthly, conducting single in-cluster recommendation and sixthly using a comprehensive function algorithm for obtaining a final recommendation result. According to the recommendation algorithm, the problem that a user may need individual recommendations for different index preferences for different commodities can be solved, the high accuracy is achieved, and the recommendation result with the higher quality can be obtained.

The invention discloses a load curve clustering method based on improved spectral and multi-manifold clustering. The load curve clustering method comprises three steps of typical daily load curve extraction, load curve clustering and clustering effect evaluation. Firstly, load characteristic indexes of a user are extracted, and typical daily load curves of the user are calculated and extracted bycombining a non-parameter kernel density estimation method; canonical warping distance metering curve similarity is introduced into an improved spectral and multi-manifold clustering algorithm, localsimilarity is calculated by adopting a Gaussian kernel function, and a similarity matrix is calculated based on the local similarity; and various clustering effectiveness indexes are adopted for evaluating a clustering result and algorithm performance after clustering. The local similarity adopts load data of a plurality of users in Baoding area as calculating example samples for performing clustering analysis, and verifies the rationality and superiority of a typical daily load curve extraction method and the improved spectral and multi-manifold clustering algorithm disclosed in the invention.

The invention discloses an unsupervised pedestrian re-identification method based on transfer learning, and the method comprises the following steps: 1), pre-training a CNN model on a source data setwith a label, and employing cross entropy loss and ternary metric loss as a target optimization function; 2) extracting pedestrian characteristics of the label-free target data set; 3) calculating a feature similarity matrix by combining the candidate column distance and the absolute distance; 4) performing density clustering on the similarity matrix, setting a label for each feature set with thedistance smaller than a preset threshold value, and recombining the feature sets into a target data set with the label; 5) training the CNN model on the recombination data set until convergence; 6) repeating the steps 2)-5) according to a preset number of iterations, and 7) inputting the test pictures into the model to extract features, and sorting the test pictures according to feature similarityto obtain a result. The source domain labeled data and the target domain unlabeled data are reasonably applied, the accuracy of pedestrian re-identification is improved in the target domain, and thestrong dependence on the labeled data is reduced.

The invention discloses an image segmentation method based on super pixel clustering. More specifically the image segmentation method includes the steps of: 1, segmenting images by using a Simple Linear Iterative Clustering (SLIC) algorithm, and generating super pixels; 2, improving a construction mode of a similarity matrix about the super pixels, and fusing a color characteristic and a texture characteristic through non-symmetry of the similarity matrix; 3, clustering the super pixels through an Affinity Propagation (AP) clustering algorithm based on the similarity matrix; and 4, reaching the purpose of image segmentation by adding spatial information of the super pixels and dividing a disconnected region into different types of super pixel groups by means of breadth-first traversal. The image segmentation method based on the super pixel clustering has good segmentation effect and a fast convergence speed. Target objects can be effectively segmented without arrangement of target quantity.

The invention provides an information search method and system based on interactive document clustering. The method comprises the following steps that a document set is horizontally partitioned and preprocessed; word frequency statistics is conducted, and high-frequency words constitute a characteristic word set; vector space representation of documents is generated, the distances between the documents are calculated, and a similarity matrix is generated; a Laplacian matrix is generated, the number of clusters and a representation matrix are determined according to intervals between proper values of the Laplacian matrix, secondary clustering is conducted, and initial distance results are obtained; users conduct interactive operation on the initial distance results, new characteristic words are mined through chi-square statistics, a vector space is reconstructed, and the clustering process is repeated; finally, clustering results are shown to the users, and therefore the users obtain different categories of search results. According to the information search method and system, a semi-supervised learning approach in which the users intervene is adopted, the documents are clustered and analyzed, and the users obtain the different categories of search results.