5046 search results - page 785 / 1010 » Non-redundant data clustering |
190
click to vote
CVPR
2003
IEEE
16 years 9 months ago
2003
IEEE
This paper presents an algebro-geometric solution to the problem of segmenting an unknown number of subspaces of unknown and varying dimensions from sample data points. We represen...
231
click to vote
KDD
2009
ACM
16 years 7 months ago
2009
ACM
The increasing availability of electronic communication data, such as that arising from e-mail exchange, presents social and information scientists with new possibilities for char...
206
click to vote
ICDM
2009
IEEE
16 years 1 months ago
2009
IEEE
This paper offers a local distributed algorithm for expectation maximization in large peer-to-peer environments. The algorithm can be used for a variety of well-known data mining...
231
click to vote
SIGMOD
2005
ACM
16 years 25 days ago
2005
ACM
In this paper, we propose new graph-based data structure and indexing to organize and retrieve video data. Several researches have shown that a graph can be a better candidate for...
214
click to vote
ALT
2010
Springer
15 years 8 months ago
2010
Springer
: The ability to distinguish, differentiate and contrast between different data sets is a key objective in data mining. Such ability can assist domain experts to understand their d...