Patents by Inventor Tanveer Syeda-Mahmood
Tanveer Syeda-Mahmood has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Publication number: 20090175544Abstract: A data processing system is provided that comprises a processor, a random access memory for storing data and programs for execution by the processor, and computer readable instructions stored in the random access memory for execution by the processor to perform a method for clustering data points in a multidimensional dataset in a multidimensional image space. The method comprises generating a multidimensional image from the multidimensional dataset; generating a pyramid of multidimensional images having varying resolution levels by successively performing a pyramidal sub-sampling of the multidimensional image; identifying data clusters at each resolution level of the pyramid by applying a set of perceptual grouping constraints; and determining levels of a clustering hierarchy by identifying each salient bend in a variation curve of a magnitude of identified data clusters as a function of pyramid resolution level.Type: ApplicationFiled: June 20, 2008Publication date: July 9, 2009Applicant: International Business Machines CorporationInventors: Tanveer Syeda-Mahmood, Peter J. Haas, John M. Lake, Guy Lohman
-
Patent number: 7558425Abstract: A data processing system is provided that comprises a processor, a random access memory for storing data and programs for execution by the processor, and computer readable instructions stored in the random access memory for execution by the processor to perform a method for clustering data points in a multidimensional dataset in a multidimensional image space. The method comprises generating a multidimensional image from the multidimensional dataset; generating a pyramid of multidimensional images having varying resolution levels by successively performing a pyramidal sub-sampling of the multidimensional image; identifying data clusters at each resolution level of the pyramid by applying a set of perceptual grouping constraints; and determining levels of a clustering hierarchy by identifying each salient bend in a variation curve of a magnitude of identified data clusters as a function of pyramid resolution level.Type: GrantFiled: June 20, 2008Date of Patent: July 7, 2009Assignee: International Business Machines CorporationInventors: Tanveer Syeda-Mahmood, Peter J. Haas, John M. Lake, Guy M. Lohman
-
Patent number: 7542954Abstract: A method for representing a dataset comprises clustering the dataset using an unsupervised, non-parametric clustering method to generate a set of clusters each comprising a set of data points in an image; clustering the data points of each cluster using a supervised, partitional clustering method to partition each cluster into a specified number of sub-clusters; generating a density estimate value of each grid point of a set of grid points sampled from the image at a specified resolution for each sub-cluster using a kernel density function; identifying a maximum density estimate value and a sub-cluster associated with the maximum density estimate value for the grid point; adding each grid point for which the maximum density estimate value exceeds a specified threshold to the sub-cluster associated with the maximum density estimate value; and, for each cluster, merging the sub-clusters of the cluster into a corresponding cluster region in the image.Type: GrantFiled: June 30, 2008Date of Patent: June 2, 2009Assignee: International Business Machines CorporationInventors: Tanveer Syeda-Mahmood, Peter J. Haas, John M. Lake, Guy M. Lohman
-
Patent number: 7542953Abstract: A data processing system is provided that comprises a processor, a random access memory for storing data and programs for execution by the processor, and computer readable instructions stored in the random access memory for execution by the processor to perform a method for obtaining a shape interpolated representation of shapes of clusters in an image of a clustered dataset. The method comprises generating a density estimate value of each grid point of a set of grid points sampled from the image at a specified resolution for each cluster using a kernel density function; evaluating the density estimate value of each grid point for each cluster to identify a maximum density estimate value of each grid point and a cluster associated with the maximum density estimate value; and adding each grid point for which the maximum density estimate value exceeds a specified threshold to the associated cluster to form a shape interpolated representation.Type: GrantFiled: June 20, 2008Date of Patent: June 2, 2009Assignee: International Business Machines CorporationInventors: Tanveer Syeda-Mahmood, Peter J. Haas, John M. Lake, Guy M. Lohman
-
Publication number: 20090132594Abstract: A data processing system is provided that comprises a processor, a random access memory for storing data and programs for execution by the processor, and computer readable instructions stored in the random access memory for execution by the processor to perform a method for obtaining a shape interpolated representation of shapes of clusters in an image of a clustered dataset. The method comprises generating a density estimate value of each grid point of a set of grid points sampled from the image at a specified resolution for each cluster using a kernel density function; evaluating the density estimate value of each grid point for each cluster to identify a maximum density estimate value of each grid point and a cluster associated with the maximum density estimate value; and adding each grid point for which the maximum density estimate value exceeds a specified threshold to the associated cluster to form a shape interpolated representation.Type: ApplicationFiled: June 20, 2008Publication date: May 21, 2009Applicant: International Business Machines CorporationInventors: Tanveer Syeda-Mahmood, Peter J. Haas, John M. Lake, Guy M. Lohman
-
Publication number: 20090132568Abstract: A method for representing a dataset comprises clustering the dataset using an unsupervised, non-parametric clustering method to generate a set of clusters each comprising a set of data points in an image; clustering the data points of each cluster using a supervised, partitional clustering method to partition each cluster into a specified number of sub-clusters; generating a density estimate value of each grid point of a set of grid points sampled from the image at a specified resolution for each sub-cluster using a kernel density function; identifying a maximum density estimate value and a sub-cluster associated with the maximum density estimate value for the grid point; adding each grid point for which the maximum density estimate value exceeds a specified threshold to the sub-cluster associated with the maximum density estimate value; and, for each cluster, merging the sub-clusters of the cluster into a corresponding cluster region in the image.Type: ApplicationFiled: June 30, 2008Publication date: May 21, 2009Applicant: International Business Machines CorporationInventors: Tanveer Syeda-Mahmood, Peter J. Haas, John M. Lake, Guy M. Lohman
-
Patent number: 7519227Abstract: A method executed on a computer for determining a hierarchical clustering of a multidimensional dataset in a multidimensional image space comprises receiving a pyramid of multidimensional images of the multidimensional dataset in which the images of the pyramid representing a first multidimensional image of the multidimensional dataset at successively lower resolution levels; identifying data clusters at each resolution level of the pyramid by applying a set of perceptual grouping constraints; plotting a variation curve of a magnitude of data clusters identified at each resolution level of the pyramid as a function of resolution level; and generating a clustering hierarchy for the multidimensional dataset by identifying the resolution level at each salient bend in the variation curve as a level of the clustering hierarchy.Type: GrantFiled: July 7, 2008Date of Patent: April 14, 2009Assignee: International Business Machines CorporationInventors: Tanveer Syeda-Mahmood, Peter J. Haas, John M. Lake, Guy M. Lohman
-
Patent number: 7412429Abstract: A method for obtaining a shape interpolated representation of shapes of one or more clusters in an image of a dataset that has been clustered comprises generating a density estimate value of each grid point of a set of grid points sampled from the image at a specified resolution for each cluster in the image using a kernel density function; evaluating the density estimate value of each grid point for each cluster to identify a maximum density estimate value of each grid point and a cluster associated with the maximum density estimate value of each grid point; and adding each grid point for which the maximum density estimate value exceeds a specified threshold to the cluster associated with the maximum density estimate value for the grid point to form a shape interpolated representation of the one or more clusters.Type: GrantFiled: November 15, 2007Date of Patent: August 12, 2008Assignee: International Business Machines CorporationInventors: Tanveer Syeda-Mahmood, Peter J. Haas, John M. Lake, Guy M. Lohman
-
Patent number: 7406200Abstract: A method is provided clustering data points in a multidimensional dataset in a multidimensional image space that comprises generating a multidimensional image from the multidimensional dataset; generating a pyramid of multidimensional images having varying resolution levels by successively performing a pyramidal sub-sampling of the multidimensional image; identifying data clusters at each resolution level of the pyramid by applying a set of perceptual grouping constraints; and determining levels of a clustering hierarchy by identifying each salient bend in a variation curve of a magnitude of identified data clusters as a function of pyramid resolution level.Type: GrantFiled: January 8, 2008Date of Patent: July 29, 2008Assignee: International Business Machines CorporationInventors: Tanveer Syeda-Mahmood, Peter J. Haas, John M. Lake, Guy M. Lohman
-
Publication number: 20070185868Abstract: Mechanisms for searching XML repositories for semantically related schemas from a variety of structured metadata sources, including web services, XSD documents and relational tables, in databases and Internet applications. A search is formulated as a problem of computing a maximum matching in pairwise bipartite graphs formed from query and repository schemas. The edges of such a bipartite graph capture the semantic similarity between corresponding attributes of the schema based on their name and type semantics. Tight upper and lower bounds are also derived on the maximum matching that can be used for fast ranking of matchings whilst still maintaining specified levels of precision and recall. Schema indexing is performed by ‘attribute hashing’, in which matching schemas of a database are found by indexing using query attributes, performing lower bound computations for maximum matching and recording peaks in the resulting histogram of hits.Type: ApplicationFiled: February 8, 2006Publication date: August 9, 2007Inventors: Mary Roth, Gauri Shah, Tanveer Syeda-Mahmood, Willi Urban, Lingling Yan
-
Publication number: 20070156622Abstract: A system and method for composing application services includes an indexing module configured to index words in a request and available application descriptions to create a semantic similarity map. A semantic matcher is configured to determine semantic similarity between concepts/terms in both domain-independent and domain-specific ontologies for the semantic similarity map. A prefiltering module is configured to determine candidate compositions for the request based on the semantic similarity map and the available descriptions. A metric guided composition method is configured to run algorithms to generate a set of alternative compositions by determining which applications can be composed with which others using the semantic similarity map.Type: ApplicationFiled: January 5, 2006Publication date: July 5, 2007Inventors: Rama Akkiraju, Richard Goodwin, Anca-Andreea Ivan, Biplav Srivastava, Tanveer Syeda-Mahmood
-
Publication number: 20060253476Abstract: Techniques are provided for semantic matching. A semantic index is created for one or more schemas, wherein each of the one or more schemas includes one or more word attributes, and wherein each of the one or more word attributes includes one or more tokens, wherein the semantic index identifies one or more keys and one or more values for each key, wherein each value specifies one of the one or more schemas, a word attribute from the specified schema, and a token of the specified word attribute, and wherein the specified token is a synonym of the key. For a source word attribute from one of the one or more schemas, the source word attribute is used as a key to index the semantic index to identify one or more matching word attributes.Type: ApplicationFiled: May 9, 2005Publication date: November 9, 2006Inventors: Mary Roth, Tanveer Syeda-Mahmood, Lingling Yan
-
Publication number: 20060155394Abstract: A method of clustering ordered data sets, wherein the method comprises forming n-dimensional curvilinear representations from an ordered data set; formulating a n+1-dimensional curvilinear representation from a pair of ordered data sets; computing a similarity of the pair of ordered data sets using a similarity between the n-dimensional curvilinear representations and the n+1-dimensional curvilinear representation; and clustering ordered data sets based on the similarity between the n-dimensional curvilinear representations and the n+1-dimensional curvilinear representation. In the n-dimensional curvilinear representations, a first dimension of space corresponds with a common ordering dimension and the remaining dimension of space corresponds with the ordered data set. The process of computing the similarity comprises comparing a shape of the n+1-dimensional curvilinear representation to a shape of each component n-dimensional curvilinear representation.Type: ApplicationFiled: December 16, 2004Publication date: July 13, 2006Applicant: International Business Machines CorporationInventor: Tanveer Syeda-Mahmood
-
Publication number: 20060136428Abstract: A method of automatically matching schemas begins by extracting schemas from sources and targets. Then, source and target attributes are extracted from the schemas. Each source schema will have multiple source attributes and each target schema will also have multiple target attributes. The source attributes and the target attributes are presented as nodes in a bipartite graph. This bipartite graph has edges between nodes that are related to each other. A plurality of similarity scores are defined between each set of related nodes. Each of the similarity scores is based on a different context-specific cue of the attributes that the nodes represent. These context-specific cues can comprise lexical name, semantic name, type, structure, functional mappings, etc. An overall weight is computed for each edge in the bipartite graph by combining the similarity scores of each set of nodes that form an edge.Type: ApplicationFiled: December 16, 2004Publication date: June 22, 2006Applicant: International Business Machines CorporationInventor: Tanveer Syeda-Mahmood
-
Publication number: 20050027460Abstract: Genes to be compared are listed by their gene expression profiles and processed with a similar sequences algorithm that is a time and intensity invariant correlation function to obtain a data set of gene expression pairs and a match fraction for each pair. A threshold match fraction is chosen and a null set is created to hold indices of genes accounted for. Genes are then assigned to clusters by match fraction value if they have a match fraction greater than the threshold. Genes are then removed from clusters if they are represented in more than one cluster by removing a first gene from a cluster when another cluster has another gene with a higher match fraction with the first gene.Type: ApplicationFiled: July 29, 2003Publication date: February 3, 2005Inventors: Bhooshan Kelkar, Tanveer Syeda-Mahmood, Gregor Meyer