Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

CIKM
2001
Springer

favoriteEmaildiscussreport

114views Information Technology» more CIKM 2001»

Ordinal Association Rules for Error Identification in Data Sets

13 years 9 months ago

Ordinal Association Rules for Error Identification in Data Sets

Download www.cs.wayne.edu

A new extension of the Boolean association rules, ordinal association rules, that incorporates ordinal relationships among data items, is introduced. One use for ordinal rules is to identify possible errors in data. A method that finds these rules and identifies potential errors in data is proposed. Keywords Data Mining, Data Cleansing, Association Rules, Ordinal Rules.

Andrian Marcus, Jonathan I. Maletic, King-Ip Lin

Real-time Traffic

Association Rules | Boolean Association Rules | CIKM 2001 | Information Management | Ordinal Rules |

claim paper

Related Content

» An Algorithm for the Discovery of Arbitrary Length Ordinal Association Rules

» Learning associations of conjuncted fuzzy sets for data prediction

» Ontologydriven Rule Generalization and Categorization for Market Data

» Opportunity map a visualization framework for fast identification of actionable knowledge

» Determination of the differentially expressed genes in microarray experiments using local ...

» Video Semantic Concept Discovery using MultimodalBased Association Classification

» Simulations Of Error Propagation For Prioritizing Data Accuracy Improvement Efforts

» A statistical approach to finding overlooked genetic associations

» BioCreAtIvE Task1A entity identification with a stochastic tagger

Post Info
More Details (n/a)

Added	28 Jul 2010
Updated	28 Jul 2010
Type	Conference
Year	2001
Where	CIKM
Authors	Andrian Marcus, Jonathan I. Maletic, King-Ip Lin

Comments (0)