169 results about "Pair wise" patented technology

The invention, referred to herein as PeaCoCk, uses a unique blend of technologies from statistics, information theory, and graph theory to quantify and discover patterns in relationships between entities, such as products and customers, as evidenced by purchase behavior. In contrast to traditional purchase-frequency based market basket analysis techniques, such as association rules which mostly generate obvious and spurious associations, PeaCoCk employs information-theoretic notions of consistency and similarity, which allows robust statistical analysis of the true, statistically significant, and logical associations between products. Therefore, PeaCoCk lends itself to reliable, robust predictive analytics based on purchase-behavior.

The invention, referred to herein as PeaCoCk, uses a unique blend of technologies from statistics, information theory, and graph theory to quantify and discover patterns in relationships between entities, such as products and customers, as evidenced by purchase behavior. In contrast to traditional purchase-frequency based market basket analysis techniques, such as association rules which mostly generate obvious and spurious associations, PeaCoCk employs information-theoretic notions of consistency and similarity, which allows robust statistical analysis of the true, statistically significant, and logical associations between products. Therefore, PeaCoCk lends itself to reliable, robust predictive analytics based on purchase-behavior.

A first embodiment of the invention provides a system that automatically classifies documents in a collection into clusters based on the similarities between documents, that automatically classifies new documents into the right clusters, and that may change the number or parameters of clusters under various circumstances. A second embodiment of the invention provides a technique for comparing two documents, in which a fingerprint or sketch of each document is computed. In particular, this embodiment of the invention uses a specific algorithm to compute the document's fingerprint, One embodiment uses a sentence in the document as a logical delimiter or window from which significant words are extracted and, thereafter, a hash is computed of all pair-wise permutations. Words are extracted based on their weight in the document, which can be computed using measures such as term frequency and the inverse document frequency.

Face verification is performed using video data. The two main modules are face image capturing and face verification. In face image capturing, good frontal face images are captured from input video data. A frontal face quality score discriminates between frontal and profile faces. In face verification, a local binary pattern histogram is selected as the facial feature descriptor for its high discriminative power and computational efficiency. Chi-Square (χ²) distance between LBP histograms from two face images are then calculated as a face dissimilarity measure. The decision whether or not two images belong to the same person is then made by comparing the corresponding distance with a pre-defined threshold. Given the fact that more than one face images can be captured per person from video data, several feature based and decision based aggregators are applied to combine pair-wise distances to further improve the verification performance.

The present invention is a system and method for estimating the age of people based on their facial images. It addresses the difficulty of annotating the age of a person from facial image by utilizing relative age (such as older than, or younger than) and face-based class similarity (gender, ethnicity or appearance-based cluster) of sampled pair-wise facial images. It involves a unique method for the pair-wise face training and a learning machine (or multiple learning machines) which output the relative age along with the face-based class similarity, of the pairwise facial images. At the testing stage, the given input face image is paired with some number of reference images to be fed to the trained machines. The age of the input face is determined by comparing the estimated relative ages of the pairwise facial images to the ages of reference face images. Because age comparison is more meaningful when the pair belongs to the same demographics category (such as gender and ethnicity) or when the pair has similar appearance, the estimated relative ages are weighted according to the face-based class similarity score between the reference face and the input face.

Determining semantically equivalent text or questions using hybrid representations based on neural network learning. Weighted bag-of-words and convolutional neural networks (CNN) based distributed vector representations of questions or text may be generated to compute the semantic similarity between questions or text. Weighted bag-of-words and CNN based distributed vector representations may be jointly used to compute the semantic similarity. A pair-wise ranking loss function trains neural network. In one embodiment, the parameters of the system are trained by minimizing a pair-wise ranking loss function over a training set using stochastic gradient descent (SGD).

The invention uses pair-wise relations such as dissimilarity, similarity or correlation to identify related items by translating the relations into a set of points in a geometric space, where each point in the set of points represents an item, and where the distance between any two points directly corresponds to the dissimilarity value of the two items represented by the two points. A family of graphs is computed from the Voronoï diagram for the set of points. This family of graphs may be used for a variety of applications, including recommendation systems. For some applications, clustering may be used to assist in visualizing and identifying relations among items. In the case of recommendation systems, graphs reflecting customer preferences are clustered to identify customers with similar tastes.

A system and methods rank results of database queries. An automated approach for ranking database query results is disclosed that leverages data and workload statistics and associations. Ranking functions are based upon the principles of probabilistic models from Information Retrieval that are adapted for structured data. The ranking functions are encoded into an intermediate knowledge representation layer. The system is generic, as the ranking functions can be further customized for different applications. Benefits of the disclosed system and methods include the use of adapted probabilistic information retrieval (PIR) techniques that leverage relational/structured data, such as columns, to provide natural groupings of data values. This permits the inference and use of pair-wise associations between data values across columns, which are usually not possible with text data.

A device for detecting the angle of incidence of radiation on a radiation incidence surface (14) comprises at last two first pairs (36) of photodiodes comprising first photodiodes (30) arranged along a first axis (12) and connected in series in a pair-wise manner. Each of the first photodiodes (30) comprises a space-charge zone (32) having a space-charge zone face (34) oriented towards the radiation incidence face (14). Further, the device is provided with a a shading mask (46) arranged at a distance (44) above the space-charge zone faces (34) of the first photodiodes (30) and comprising radiation-transmitting areas (48). Each radiation-transmitting area (48) is assigned to the space-charge zone faces (34) of the two first photodiodes (30) of a first pair (36) of photodiodes. When viewed in the direction of the normal of the radiation incidence face (14), the degree of overlapping between a radiation-transmitting area (48) and its assigned space-charge zone faces (34) in the direction of the first axis (12) is different for at least two of the first pairs (36) of photodiodes. The device also comprises an evaluation unit (56) for monitoring the photocurrent and/or the photovoltage of each first photodiode (30) of each first pair (36) of photodiodes and for detecting, on the basis of a comparison of the photocurrents and/or the photovoltages, the angle of incidence under which the component of the radiation which in the projection is directed parallel to the first axis (12) impinges on the radiation incidence face (14).

A three-dimensional (3-D) machine-vision involving a method and apparatus for performing segmentation of 3-D objects. Multiple stereo-related sets (left/right, top/left, top/right) of two-dimensional video pixel data are separately processed into sets of edges. Each stereo-related set is then pair-wise processed to convert pairs of sets of edge data into 3-D point data. Multiple sets of pair-wise 3-D data are then merged and used for obtaining 3-D features which are then clustered into discrete 3-D objects that can lie on any arbitrary plane.

Provided is a process of modifying semantic similarity graphs representative of pair-wise similarity between documents in a corpus, the method comprising obtaining a semantic similarity graph that comprises more than 500 nodes and more than 1000 weighted edges, each node representing a document of a corpus, and each edge weight indicating an amount of similarity between a pair of documents corresponding to the respective nodes connected by the respective edge; obtaining an n-gram indicating that edge weights affected by the n-gram are to be increased or decreased; expanding the n-gram to produce a set of expansion n-grams; adjusting edge weights of edges between pairs of documents in which members of the expanded n-gram set co-occur.

One embodiment of the present invention provides a system that builds an association tensor (such as a matrix) to facilitate document and word-level processing operations. During operation, the system uses terms from a collection of documents to build an association tensor, which contains values representing pair-wise similarities between terms in the collection of documents. During this process, if a given value in the association tensor is calculated based on an insufficient number of samples, the system determines a corresponding value from a reference document collection, and then substitutes the corresponding value for the given value in the association tensor. After the association tensor is obtained, a dimensionality reduction method is applied to compute a low-dimensional vector space representation for the vocabulary terms. Document vectors are computed as linear combinations of term vectors.

Systems and methods for operating digital computer system and a quantum processor to optimize an investment portfolio are described. A set of candidate investments is mapped to the qubits of the quantum processor, where each qubit is programmed with a respective programmable qubit parameter that is representative of the recent performance of the particular candidate investment to which the qubit corresponds. Pair-wise correlations between the candidate investments are mapped to coupling devices of the quantum processor, where each coupling device is programmed with a respective programmable coupling parameter that is representative of the particular correlation to which the coupling device corresponds. The quantum processor is evolved to determine the minimum energy configuration of the qubit states with respect to the programmable qubit and coupling device parameters. The digital computer system interacts with the quantum processor via an investment portfolio optimization module.

A system and method for rights protection of a dataset that includes multiple trajectory objects includes determining an intensity power for embedding a watermarking key in a data trajectory. The data trajectory is modified to embed a watermarking key at the intensity power such that the intensity power guarantees an original pair-wise relationship between distance-based neighboring objects before and after embedding of the key such that a modified trajectory provides a watermarked version of the data trajectory.

A computational method and system for the comparison and analysis of different objects of information within a database or collection. All objects are compared in a pair-wise fashion so the relative similarity between each object to every other object in the collection is known. A generalized alignment-free method is described for comparing whole genome (coding and non-coding) DNA sequences is used to investigate the relationship among placental mammalian genomes. Differences in word feature frequency profiles (FFP) are used to derive distance and infer evolutionary relationships.

A vehicle collision avoidance radar multi-target frequency matching method based on a combined waveform of an LFM triangular wave and a constant frequency wave belongs to the field of vehicle collision avoidance radar multi-target frequency matching, solves the technical problem of multi-target frequency matching, and eliminates constant false alarms. According to the technical scheme, over-threshold detection is carried out on upper and lower frequency sweep segments of the triangular wave and the constant frequency wave separately; beat frequencies of the upper and lower frequency sweep segments of the triangular wave are combined pair-wise and two matrices (A1 and B1) are generated; a difference matrix C1 of the matrix A1 and a first Doppler frequency value detected from the constant frequency wave is calculated, and the minimal value of the matrix C1 is found; and corresponding Doppler frequency values and beat frequencies and values in the matrix A1 and the matrix B1 are output. The beneficial effects are that the technical problem of multi-target frequency matching is solved and false alarms are removed.

A method includes determining for each access point and each associated client that has traffic to exchange with the access point in either directions of a link a pattern of slots of times that causes minimum interference to clients of other access points in a wireless local area network; deriving a conflict graph of pair wise patterns of different access points representing which patterns conflict on a particular client, the conflict graph representing which patterns of the slots cannot be scheduled simultaneously in a slot so as to avoid interference; and generating a schedule for each access points in the slots such that no two conflicting patterns for two different access points are scheduled in the same slot.