Towards Automatic Auditing of Records

Lee, R.C.T.; Slagie, J.R.; Mong, C. T.

doi:10.1109/tse.1978.225939

Cited by 15 publications

(8 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…All application-independent approaches use clustering analysis techniques. Lee et al (1978) first applied a clustering approach. They defined a distance function to measure the difference between two records.…”

Section: Application-independent Methodsmentioning

confidence: 99%

See 1 more Smart Citation

A Two-Staged Approach for Assessing for the Quality of Internet Survey Data

Cheng

Goh²,

Lee-Post

2007

Proceedings of the Third International Conference on Web Information Systems and Technologies

View full text Add to dashboard Cite

In this work, we propose to develop a procedure to detect errors in data collected through Internet surveys. Although several approaches have been developed, they suffer many limitations. For instance, many approaches require prior knowledge of data and hence they need different procedures for different applications. Others have to test a large number of parameter values and hence they are not very efficient. To develop a procedure to overcome the limitations of existing approaches, we try to understand the nature of this quality problem and establish its linkage to travelling salesman problem (TSP). Based on the TSP problem structure, we propose to develop a two-staged approach based on a genetic algorithm to help ensure the quality of Internet survey data.

show abstract

Section: Application-independent Methodsmentioning

confidence: 99%

“…Storer and Eastman (1990) proposed three related clustering approaches. They used the same distance function as defined by Lee et al (1978). The first approach is called the leader algorithm (Hartigan, 1975).…”

Section: Application-independent Methodsmentioning

confidence: 99%

A Two-Staged Approach for Assessing for the Quality of Internet Survey Data

Cheng

Goh²,

Lee-Post

2007

Proceedings of the Third International Conference on Web Information Systems and Technologies

View full text Add to dashboard Cite

show abstract

“…Hot-deck imputation [11] fills in a missing value using values from other rows of the database that are similar to the row with the missing value. Hot-deck imputation has been performed with k-nearest neighbors algorithms [5,2] and clustering algorithms [22].…”

Section: Related Workmentioning

confidence: 99%

Privacy-preserving imputation of missing data

Jagannathan

Wright

2008

Data & Knowledge Engineering

View full text Add to dashboard Cite

“…In 1978, Lee et al used this technique to process the automatic auditing of records [12]. Recently, this algorithm has been applied to some clustering problems.…”

Section: Shortest Spanning Pathmentioning

confidence: 99%

“…Because it is difficult to find a shortest spanning path [12], most applications adopt a "short" spanning path instead, although a short spanning path is not necessarily the shortest path. The most popular approach is to select an arbitrary starting point and connect other points to this path one by one by selecting the shortest distance to a point in the pool of unselected points.…”

Section: Definitionmentioning

confidence: 99%

A Novel High Capacity Reversible Information Hiding Scheme Based on Side-Match Prediction and Shortest Spanning Path

Chang

2008

Circuits Syst Signal Process

View full text Add to dashboard Cite

In recent years, information hiding techniques have attracted increased attention owing to the growing demand for the ability to exchange large amounts of information. In addition, hiding information in compressed messages is very practical in improving transmission efficiency and saving large amounts of storage space. However, the damage caused by hiding data in compressed messages reduces image quality more than the damage caused by hiding data in uncompressed messages. Hence, this paper proposes a data hiding scheme based on side-match prediction and declustering techniques for vector quantization (VQ) compressed images. The appropriate side-match prediction not only embeds secret information into the VQ index but also reverses the original compressed index. In addition, the capacity for secret information can be varied adaptively depending on the requirements of different applications. As experimental results indicate, the proposed scheme indeed outperforms previous work in hiding capacity and in the image quality of stego-images.

show abstract

Towards Automatic Auditing of Records

Cited by 15 publications

References 7 publications

A Two-Staged Approach for Assessing for the Quality of Internet Survey Data

A Two-Staged Approach for Assessing for the Quality of Internet Survey Data

Privacy-preserving imputation of missing data

A Novel High Capacity Reversible Information Hiding Scheme Based on Side-Match Prediction and Shortest Spanning Path

Contact Info

Product

Resources

About