Sciweavers

4850 search results - page 135 / 970
» Approximate Data Structures with Applications
Sort
View
ILP
2005
Springer
15 years 3 months ago
Spatial Clustering of Structured Objects
Clustering is a fundamental task in Spatial Data Mining where data consists of observations for a site (e.g. areal units) descriptive of one or more (spatial) primary units, possib...
Donato Malerba, Annalisa Appice, Antonio Varlaro, ...
ADC
2003
Springer
173views Database» more  ADC 2003»
15 years 3 months ago
Cooperative Query Answering for Semistructured Data
Semistructured data, in particular XML, has emerged as one of the primary means for information exchange and content management. The power of XML allows authors to structure a doc...
Michael Barg, Raymond K. Wong
ALT
2009
Springer
15 years 7 months ago
Approximation Algorithms for Tensor Clustering
Abstract. We present the first (to our knowledge) approximation algorithm for tensor clustering—a powerful generalization to basic 1D clustering. Tensors are increasingly common...
Stefanie Jegelka, Suvrit Sra, Arindam Banerjee
CIKM
2003
Springer
15 years 3 months ago
Dimensionality reduction using magnitude and shape approximations
High dimensional data sets are encountered in many modern database applications. The usual approach is to construct a summary of the data set through a lossy compression technique...
Ümit Y. Ogras, Hakan Ferhatosmanoglu
ACCV
2009
Springer
15 years 4 months ago
Lorentzian Discriminant Projection and Its Applications
This paper develops a supervised dimensionality reduction method, Lorentzian Discriminant Projection (LDP), for discriminant analysis and classification. Our method represents the...
Risheng Liu, Zhixun Su, Zhouchen Lin, Xiaoyu Hou