Random Hyperplane Projection using derived dimensions

MobiDE 2010 - Proceedings of the 9th ACM International Workshop on Data Engineering for Wireless and Mobile Access, in Conjunction with ACM SIGMOD / PODS 2010

Volumn , Issue , 2010, Pages 25-32

  Georgoulas, Konstantinos ^a   Kotidis, Yannis ^a  

^a ATHENS UNIVERSITY OF ECONOMICS AND BUSINESS   (Greece)

Author keywords

Locality Sensitive Hashing; Sensor Networks; Similarity

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; GEOMETRY; PEER TO PEER NETWORKS;

DATA DISTRIBUTION; DATA OBJECTS; DATA SET; EMBEDDINGS; FUNDAMENTAL OPERATIONS; HYPERPLANE PROJECTION; LOCALITY SENSITIVE HASHING; PEER-TO-PEER NETWORKS; SENSORS NETWORK; SIMILARITY;

SENSOR NETWORKS;

EID: 77958077420     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1850822.1850827     Document Type: Conference Paper

References (16)

1. M. Charikar. Similarity estimation techniques from rounding algorithms. In STOC, 2002.
2. J. Chen, S. Kher, and A. Somani. Distributed Fault Detection of Wireless Sensor Networks. In DIWANS, 2006.
3. A. Deligiannakis, Y. Kotidis, and N. Roussopoulos. Compressing Historical Information in Sensor Networks. In ACM SIGMOD, 2004.
4. A. Deligiannakis, Y. Kotidis, and N. Roussopoulos. Hierarchical In-Network Data Aggregation with Quality Guarantees. In Proceedings of EDBT, 2004.
5. A. Deligiannakis, Y. Kotidis, V. Vassalos, V. Stoumpos, and A. Delis. Another Outlier Bites the Dust: Computing Meaningful Aggregates in Sensor Networks. In ICDE, 2009.
6. N. Giatrakos, Y. Kotidis, A. Deligiannakis, V. Vassalos, and Y. Theodoridis. TACO: Tunable Approximate Computation of Outliers in wireless sensor networks. In SIGMOD, 2010.
7. A. Gilbert, Y. Kotidis, S. Muthukrishnan, and M. Strauss. QuickSAND: Quick Summary and Analysis of Network Data. Technical report, DIMACS 2001-43, Dec 2001.
8. A. Gionis, D. Gunopulos, and N. Koudas. Efficient and tunable similar set retrieval. In SIGMOD, 2001.
9. M. Goemans and D. Williamson. Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming. J. ACM, 42(6), 1995.
10. P. Indyk and R. Motwani. Approximate nearest neighbors: towards removing the curse of dimensionality. In STOC, 1998.
11. S. Jeffery, G. Alonso, M. J. Franklin, W. Hong, and J. Widom. Declarative Support for Sensor Data Cleaning. In Pervasive, 2006.
12. N. Koudas, A. Marathe, and D. Srivastava. Propagating Updates in SPIDER. In ICDE, pages 1146-1153, 2007.
13. D. Ravichandran, P. Pantel, and E. Hovy. Randomized algorithms and NLP: using locality sensitive hash function for high speed noun clustering. In ACL, 2005.
14. A. Vlachou, C. Doulkeridis, Y. Kotidis, and M. Vazirgiannis. SKYPEER: Efficient Subspace Skyline Computation over Distributed Data. In Proceedings of ICDE, 2007.
15. X. Xiao, W. Peng, C. Hung, and W. Lee. Using SensorRanks for In-Network Detection of Faulty Readings in Wireless Sensor Networks. In MobiDE, 2007.
16. G. Xue, Y. Jiang, Y. You, and M. Li. A topology-aware hierarchical structured overlay network based on locality sensitive hashing scheme. In UPGRADE, 2007.