NDLI: Nearest Neighbor-Based Classification of Uncertain Data

Please wait, while we are loading the content...

ACM Transactions on Knowledge Discovery from Data (TKDD) : Volume 11

ACM Transactions on Knowledge Discovery from Data (TKDD) : Volume 10

ACM Transactions on Knowledge Discovery from Data (TKDD) : Volume 9

ACM Transactions on Knowledge Discovery from Data (TKDD) : Volume 8

ACM Transactions on Knowledge Discovery from Data (TKDD) : Volume 7

Issue 4, November 2013

Issue 3(Special Issue on ACM SIGKDD 2012), September 2013

Issue 2, July 2013

Issue 1, March 2013

Nearest Neighbor-Based Classification of Uncertain Data

Comparative Document Summarization via Discriminative Sentence Selection

Message-Passing Algorithms for Sparse Network Alignment

Confidence Weighted Mean Reversion Strategy for Online Portfolio Selection

ACM Transactions on Knowledge Discovery from Data (TKDD) : Volume 6

ACM Transactions on Knowledge Discovery from Data (TKDD) : Volume 5

ACM Transactions on Knowledge Discovery from Data (TKDD) : Volume 4

ACM Transactions on Knowledge Discovery from Data (TKDD) : Volume 3

ACM Transactions on Knowledge Discovery from Data (TKDD) : Volume 2

ACM Transactions on Knowledge Discovery from Data (TKDD) : Volume 1

Nearest Neighbor-Based Classification of Uncertain Data

Content Provider	ACM Digital Library
Author	Angiulli, Fabrizio Fassetti, Fabio
Copyright Year	2013
Abstract	This work deals with the problem of classifying uncertain data. With this aim we introduce the Uncertain Nearest Neighbor (UNN) rule, which represents the generalization of the deterministic nearest neighbor rule to the case in which uncertain objects are available. The UNN rule relies on the concept of nearest neighbor class, rather than on that of nearest neighbor object. The nearest neighbor class of a test object is the class that maximizes the probability of providing its nearest neighbor. The evidence is that the former concept is much more powerful than the latter in the presence of uncertainty, in that it correctly models the right semantics of the nearest neighbor decision rule when applied to the uncertain scenario. An effective and efficient algorithm to perform uncertain nearest neighbor classification of a generic (un)certain test object is designed, based on properties that greatly reduce the temporal cost associated with nearest neighbor class probability computation. Experimental results are presented, showing that the UNN rule is effective and efficient in classifying uncertain data.
Starting Page	1
Ending Page	35
Page Count	35
File Format	PDF
ISSN	15564681
e-ISSN	1556472X
DOI	10.1145/2435209.2435210
Volume Number	7
Issue Number	1
Journal	ACM Transactions on Knowledge Discovery from Data (TKDD)
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2013-03-01
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Classification Nearest neighbor Nearest neighbor rule Probability density functions Uncertain data
Content Type	Text
Resource Type	Article
Subject	Computer Science

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Superseding Nearest Neighbor Search on Uncertain Spatial Databases

Probabilistic Reverse Nearest Neighbor Queries on Uncertain Data

Classification of uncertain data in the framework of belief functions : nearest-neighbor-based and rule-based approaches

Nearest-Neighbor Searching Under Uncertainty II

A probabilistic nearest neighbor filter algorithm for m validated measurements

Editing training data for multi-label classification with the k-nearest neighbor rule

Condensed Nearest Neighbor Data Domain Description

Probabilistic verifiers: evaluating constrained nearest-neighbor queries over uncertain data.

Adaptive Kernel Metric Nearest Neighbor Classification (2002)

Nearest Neighbor-Based Classification of Uncertain Data

Similar Documents

Superseding Nearest Neighbor Search on Uncertain Spatial Databases

Probabilistic Reverse Nearest Neighbor Queries on Uncertain Data

Classification of uncertain data in the framework of belief functions : nearest-neighbor-based and rule-based approaches

Nearest-Neighbor Searching Under Uncertainty II

A probabilistic nearest neighbor filter algorithm for m validated measurements

Editing training data for multi-label classification with the k-nearest neighbor rule

Condensed Nearest Neighbor Data Domain Description

Probabilistic verifiers: evaluating constrained nearest-neighbor queries over uncertain data.

Adaptive Kernel Metric Nearest Neighbor Classification (2002)

Nearest Neighbor-Based Classification of Uncertain Data