Sciweavers

82 search results - page 10 / 17
» Intersecting data to closed sets with constraints
Sort
View
CCCG
1993
13 years 9 months ago
Widest-corridor Problems
A k-dense corridor through a finite set, S, of n points in the plane is the open region of the plane that is bounded by two parallel lines that intersect the convex hull of S and ...
Ravi Janardan, Franco P. Preparata
IJKDB
2010
170views more  IJKDB 2010»
13 years 4 months ago
Clustering Genes Using Heterogeneous Data Sources
Clustering of gene expression data is a standard exploratory technique used to identify closely related genes. Many other sources of data are also likely to be of great assistance...
Erliang Zeng, Chengyong Yang, Tao Li, Giri Narasim...
ICDM
2010
IEEE
135views Data Mining» more  ICDM 2010»
13 years 5 months ago
Learning a Bi-Stochastic Data Similarity Matrix
An idealized clustering algorithm seeks to learn a cluster-adjacency matrix such that, if two data points belong to the same cluster, the corresponding entry would be 1; otherwise ...
Fei Wang, Ping Li, Arnd Christian König
JIIS
2006
119views more  JIIS 2006»
13 years 7 months ago
Answering constraint-based mining queries on itemsets using previous materialized results
Abstract In recent years, researchers have begun to study inductive databases, a new generation of databases for leveraging decision support applications. In this context, the user...
Roberto Esposito, Rosa Meo, Marco Botta
ACTA
2002
111views more  ACTA 2002»
13 years 7 months ago
Adding a path connectedness operator to FO+poly (linear)
In the constraint database community, FO+poly and FO+linear have been proposed as foundations for spatial database query languages. One of the strengths of this approach is that t...
Chris Giannella, Dirk Van Gucht