Sciweavers

466 search results - page 18 / 94
» RAIN: data clustering using randomized interactions between ...
Sort
View
SIGMOD
1998
ACM
99views Database» more  SIGMOD 1998»
15 years 4 months ago
CURE: An Efficient Clustering Algorithm for Large Databases
Clustering, in data mining, is useful for discovering groups and identifying interesting distributions in the underlying data. Traditional clustering algorithms either favor clust...
Sudipto Guha, Rajeev Rastogi, Kyuseok Shim
SIGMOD
2005
ACM
128views Database» more  SIGMOD 2005»
15 years 12 months ago
Deriving Private Information from Randomized Data
Randomization has emerged as a useful technique for data disguising in privacy-preserving data mining. Its privacy properties have been studied in a number of papers. Kargupta et ...
Zhengli Huang, Wenliang Du, Biao Chen
TMC
2008
210views more  TMC 2008»
14 years 11 months ago
Adaptive Cluster-Based Data Collection in Sensor Networks with Direct Sink Access
Recently wireless sensor networks featuring direct sink access have been studied as an efficient architecture to gather and process data for numerous applications. In this paper, w...
Mahdi Lotfinezhad, Ben Liang, Elvino S. Sousa
BMCBI
2006
131views more  BMCBI 2006»
14 years 11 months ago
Hybridization interactions between probesets in short oligo microarrays lead to spurious correlations
Background: Microarrays measure the binding of nucleotide sequences to a set of sequence specific probes. This information is combined with annotation specifying the relationship ...
Michal J. Okoniewski, Crispin J. Miller
IWDC
2005
Springer
210views Communications» more  IWDC 2005»
15 years 5 months ago
Mobile Agent Based Message Communication in Large Ad Hoc Networks Through Co-operative Routing Using Inter-agent Negotiation at
:- The wide availability of mobile devices equipped with wireless communication capabilities together with the technical possibility to form ad hoc networks paves the way for build...
Parama Bhaumik, Somprakash Bandyopadhyay