Fast algorithms for approximating the singular value decomposition

ACM Transactions on Knowledge Discovery from Data

Volumn 5, Issue 2, 2011, Pages

  Menon, Aditya Krishna ^a   Elkan, Charles ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Experimental evaluation; Low rank approximation; Singular value decomposition

Indexed keywords

COMPUTATIONAL REQUIREMENTS; DATA SETS; EMPIRICAL STUDIES; EXPERIMENTAL EVALUATION; FAST ALGORITHMS; LOW RANK APPROXIMATION; LOW RANK APPROXIMATIONS; LOW-RANK MATRICES; MASSIVE DATA; MATRIX; RUNTIMES; SAMPLING METHOD; SINGULAR VALUES;

ALGORITHMS;

SINGULAR VALUE DECOMPOSITION;

EID: 79952555116     PISSN: 15564681     EISSN: 1556472X     Source Type: Journal    
DOI: 10.1145/1921632.1921639     Document Type: Article

References (28)

1. AIZAWA, A. AND OYAMA, K. 2005. A fast linkage detection scheme for multi-source information integration. In Proceedings of the International Workshop on Challenges in Web Information Retrieval and Integration (WIRI'05). 30-39. (Pubitemid 44883138)
2. BAWA, M., BAYARDO, JR., R. J., AND AGRAWAL, R. 2003. Privacy-preserving indexing of documents on the network. In Proceedings of the 29th International Conference on Very Large Data Bases (VLDB'03). VLDB Endowment, 922-933.
3. BAXTER, R., CHRISTEN, P., AND CHURCHES, T. 2003. A comparison of fast blocking methods for record linkage. In Proceedings of the Workshop on Data Cleaning, Record Linkage and Object Consolidation (ACM SIGKDD'03).
4. BLOOM, B. H. 1970. Space/time trade-offs in hash coding with allowable errors. Comm. ACM 13, 7, 422-426.
5. BRODER, A. AND MITZENMACHER, M. 2004. Network applications of bloom filters: A survey. In Internet Mathematics. Vol. 1. 485-509.
6. CHAZELLE, B., KILIAN, J., RUBINFELD, R., AND TAL, A. 2004. The bloomier filter: an efficient data structure for static support lookup tables. In Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA04). SIAM, Philadelphia, PA, 30-39.
7. CHRISTEN, P. 2006. A comparison of personal name matching: Techniques and practical issues. In Proceedings of the Workshop on Mining Complex Data (MCD).
8. CHRISTEN, P. 2007. Towards parameter-free blocking for scalable record linkage. Tech. rep. TR-CS-07-03, Department of Computer Science, Australian National University, Canberra.
9. CHRISTEN, P. 2008. Febrl - An open source data cleaning, deduplication and record linkage system with a graphical user interface (Demonstration Session). In Proceedings of the ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD'08). 1065-1068.
10. DE VRIES, T., KE, H., CHAWLA, S., AND CHRISTEN, P. 2009. Robust record linkage blocking using suffix arrays. In Proceedings of the 18th ACM Conference on Information and Knowledge Management (CIKM'09). ACM, New York, NY, 305-314.
11. DUNN, H. L. 1946. Record linkage. In Am. J. Pub. Health. 1412-1416.
12. ELFEKY, M., VERYKIOS, V., AND ELMAGARMID, A. 2002. Tailor: a record linkage toolbox. In Proceedings of the 18th International Conference on Data Engineering, 17-28. (Pubitemid 34278693)
13. ELMAGARMID, A., IPEIROTIS, P., AND VERYKIOS, V. 2007. Duplicate record detection: A survey. IEEE Trans. Knowl. Data Engin. 19, 1, 1-16. (Pubitemid 44955773)
14. FELLEGI, I.P. AND SUNTER, A. B. 1969. A theory for record linkage. J. Amer. Statist. Ass. 64, 328, 1183-1210.
15. GILL, L., GOLDACRE, M., SlMMONS, H., BETTLEY, G., AND GRIFFITH, M. 1993. Computerised linking of medical records: Methodological guidelines. J Epidemi. Commun. Health 47, 4, 316-319. (Pubitemid 23256209)
16. GU, L., BAXTER, R., VICKERS, D., AND RAINSFORD, C. 2003. Record linkage: Current practice and future directions. Tech. rep., CSIRO Mathematical and Information Sciences.
17. HERNANDEZ, M. A. AND STOLFO, S. J. 1998. Real-world data is dirty: Data cleansing and the merge/purge problem. Data Min. Knowl. Discov. 2, 1, 9-37. (Pubitemid 128696797)
18. JARO, M. A. 1989. Advances in record-linkage methodology as applied to matching the 1985 census of tampa. J. Amer. Statist. Ass. 84, 406, 414-420.
19. JIN, L., LI, C., AND MEHROTRA, S. 2003. Efficient record linkage in large datasets. In Proceedings of the 8th International Conference on Database Systems for Advanced Applications (DASFAA03). 137.
20. KIRSCH, A. AND MITZENMACHER, M. 2008. Less hashing, same performance: Building a better bloom filter. Random Struct. Algor. 33, 2, 187-218.
21. MARSHALL, J. T. 1947. Canada's national vital statistics index. In Population Stud. 204-211.
22. MCCALLUM, A., NIGAM, K., AND UNGAR, L. H. 2000. Efficient clustering of high-dimensional datasets with application to reference matching. In Proceedings of the ACM International Conference on Knowledge Discovery and Data Mining. 169-178.
23. MITZENMACHER, M. 2002. Compressed bloom filters. IEEE/ACM Trans. Netw. 10, 5, 604-612. (Pubitemid 35312139)
24. NEWCOMBE, H. B. AND KENNEDY, J. M. 1962. Record linkage: making maximum use of the discriminating power of identifying information. Comm. ACM 5, 11, 563-566.
25. SCHNELL, R., BACHTELER, T., AND REIHER, J. 2009. Privacy-preserving record linkage using bloom filters. BMC Med. Informatics Decis. Mak. 9, 1, 41.
26. WINKLER, W. E. 2006. Overview of record linkage and current research directions. Tech. rep. RR2006/02, US Bureau of the Census.
27. YAN, S., LEE, D., KAN, M.-Y., AND GILES, L. C. 2007. Adaptive sorted neighborhood methods for efficient record linkage. In Proceedings of the 7th ACM/IEEE-CS Joint Conference on Digital Libraries (JCDL07). ACM, New York, NY, 185-194. (Pubitemid 350157980)
28. ZOBEL, J. AND MOFFAT, A. 2006. Inverted files for text search engines. ACM Comput. Surv. 38, 2.