26 search results - page 1 / 6 » Probabilistic clustering by random swap algorithm |
ICPR
2008
IEEE
13 years 11 months ago
2008
IEEE
:H IRUPXODWH SUREDELOLVWLF FOXVWHULQJ PHWKRG EDVHG RQ D VHTXHQFH RI UDQGRP VZDSV RI FOXVWHU FHQWURLGV :H VKRZ WKDW WKH DOJRULWKP KDV OLQHDU GHSHQGHQF\ RQ WKH QXPEHU RI GDWD YHFWRU...
IAT
2009
IEEE
13 years 11 months ago
2009
IEEE
In building practical sensor networks, it is often beneficial to use only a subset of sensors to take measurements because of computational, communication, and power limitations....
KDD
2006
ACM
14 years 5 months ago
2006
ACM
The problem of assessing the significance of data mining results on high-dimensional 0?1 data sets has been studied extensively in the literature. For problems such as mining freq...
APPROX
2007
Springer
13 years 8 months ago
2007
Springer
We prove a lower bound for swapping the order of Arthur and Merlin in two-round MerlinArthur games using black-box techniques. Namely, we show that any AM-game requires time (t2 )...
KDD
2007
ACM
14 years 5 months ago
2007
ACM
Relational clustering has attracted more and more attention due to its phenomenal impact in various important applications which involve multi-type interrelated data objects, such...