Sciweavers

1839 search results - page 270 / 368
» Feature Selection in Clustering Problems
Sort
View
COMPGEOM
2009
ACM
14 years 2 months ago
k-means requires exponentially many iterations even in the plane
The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice....
Andrea Vattani
ICDM
2007
IEEE
159views Data Mining» more  ICDM 2007»
14 years 1 months ago
Spectral Regression: A Unified Approach for Sparse Subspace Learning
Recently the problem of dimensionality reduction (or, subspace learning) has received a lot of interests in many fields of information processing, including data mining, informati...
Deng Cai, Xiaofei He, Jiawei Han
DIAGRAMS
2004
Springer
14 years 3 months ago
Bayesian Boxes: A Colored Calculator for Picturing Posteriors
The need for Bayesian inference arises in military intelligence, medical diagnosis and many other practical applications. The problem is that human inferences are generally conserv...
Kevin Burns
CLEF
2008
Springer
13 years 12 months ago
Overview of VideoCLEF 2008: Automatic Generation of Topic-Based Feeds for Dual Language Audio-Visual Content
The VideoCLEF track, introduced in 2008, aims to develop and evaluate tasks related to analysis of and access to multilingual multimedia content. In its first year, VideoCLEF pilo...
Martha Larson, Eamonn Newman, Gareth J. F. Jones
ANLP
1994
109views more  ANLP 1994»
13 years 11 months ago
Symmetric Pattern Matching Analysis for English Coordinate Structures
The authors propose a model for analyzing English sentences including coordinate conjunctions such as "and","or","but" and the equivalent words. Synt...
Akitoshi Okumura, Kazunori Muraki