Rafael Alonso
ABSTRACT
One of the major hurdles in maintaining long-lived electronic systems is that electronic parts become obsolete, no longer available from the original suppliers. When this occurs, an engineer is tasked with resolving the problem by finding a replacement that is "as similar as possible" to the original part. The current approach involves a laborious manual search through several electronic portals and data books. The search is difficult because potential replacements may differ from the original and from each other by one or more parameters. Worse still, the cumbersome nature of this process may cause the engineers to miss appropriate solutions amid the many thousands of parts listed in industry catalogs.In this paper, we address this problem by introducing the notion of a parametric "distance" between electronic components. We use this distance to search a large parts data set and recommend likely replacements. Recommendations are based on an adaptive nearest-neighbor search through the parametric data set. For each user, we learn how to scale the axes of the feature space in which the nearest neighbors are sought. This allows the system to learn each user's judgment of the phrase "as similar as possible."
- Collaborative Opportunities in DMSMS: A Study Report, Industrial Base Information Center, AFRL/MLME, http://www.dtic.mil/natibo/docs/dmsms-report-2.pdf,2001.Google Scholar
- Alonso, R., Bloom, J., and Li, H. SmartSearch for Obsolete Parts Acquisition. Technical Report, Sarnoff Corporation, Princeton, NJ, 2002.Google Scholar
- Cost, S. and Salzberg, S. A Weighted Nearest Neighbor Algorithm for Learning with Symbolic Features. Machine Learning 10, 1993, 57--78. Google ScholarDigital Library
- Stanfill, C. and Waltz, D. Toward memory-based reasoning. Communications of the ACM, 29(12), 1213--1228. Google ScholarDigital Library
- Balabanovic, M., Shoham, Y., and Yun, Y. An Adaptive Agent for Automated Web Browsing. Journal of Visual Communication and Image Representation 6(4), 1995.Google Scholar
- Pazzani, M. J., and Billsus, D. Learning and Revising User Profiles: The Identification of Interesting Web Sites. Machine Learning 27, 313--331. Google ScholarDigital Library
- Resnick, P., Iacovou, N., Suchak, M., Bergstrom, P., and Riedl, J. GroupLens: An Open Architecture for Collaborative Filtering of Netnews. In Proceedings of CSCW'94, Chapel Hill, NC, 1994. Google ScholarDigital Library
- Shardanand, U. and Maes, P. Social Information Filtering for Automating "Word of Mouth". Proceedings of CHI-95, Denver, CO, May, 1995. Google ScholarDigital Library
- Joachims, T. Optimizing Search Engines using Clickthrough. Proceedings of the ACM Conference on Knowledge Discovery and Data Mining (KDD), ACM, 2002. Google ScholarDigital Library
Index Terms
- An adaptive nearest neighbor search for a parts acquisition ePortal
Recommendations
Confirmation Sampling for Exact Nearest Neighbor Search
Similarity Search and ApplicationsAbstractLocality-sensitive hashing (LSH), introduced by Indyk and Motwani in STOC ’98, has been an extremely influential framework for nearest neighbor search in high-dimensional data sets. While theoretical work has focused on the approximate nearest ...
Complementary hashing for approximate nearest neighbor search
ICCV '11: Proceedings of the 2011 International Conference on Computer VisionRecently, hashing based Approximate Nearest Neighbor (ANN) techniques have been attracting lots of attention in computer vision. The data-dependent hashing methods, e.g., Spectral Hashing, expects better performance than the data-blind counterparts, e.g.,...
Entropy based nearest neighbor search in high dimensions
SODA '06: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithmIn this paper we study the problem of finding the approximate nearest neighbor of a query point in the high dimensional space, focusing on the Euclidean space. The earlier approaches use locality-preserving hash functions (that tend to map nearby points ...
Comments