Article

Finding Intensional Knowledge of Distance-Based Outliers

Authors:

Edwin M. Knorr,

Raymond T. NgAuthors Info & Claims

VLDB '99: Proceedings of the 25th International Conference on Very Large Data Bases

Pages 211 - 222

Published: 07 September 1999 Publication History

Abstract

No abstract available.

References

[1]

{AGGR98} Rakesh Agrawal, Johannes Gehrke, Dimitrios Gunopulos, Prabhakar Raghavan: Automatic Subspace Clustering of High Dimensional Data for Data Mining Applications. SIGMOD Conference 1998: 94-105.

Digital Library

Google Scholar

[2]

{AGI+92} Rakesh Agrawal, Sakti P. Ghosh, Tomasz Imielinski, Balakrishna R. Iyer, Arun N. Swami: An Interval Classifier for Database Mining Applications. VLDB 1992: 560-573.

Digital Library

Google Scholar

[3]

{AIS93} Rakesh Agrawal, Tomasz Imielinski, Arun N. Swami: Mining Association Rules between Sets of Items in Large Databases. SIGMOD Conference 1993: 207-216.

Digital Library

Google Scholar

[4]

{BL94} V. Barnett and T. Lewis. Outliers in Statistical Data. John Wiley & Sons, 1994.

Google Scholar

[5]

{BFOS84} L. Breiman, J. Friedman, R. Olshen, and C. Stone. Classification and Regression Trees. Wadsworth International Group, 1984.

Google Scholar

[6]

{BMS97} Sergey Brin, Rajeev Motwani, Craig Silverstein: Beyond Market Baskets: Generalizing Association Rules to Correlations. SIGMOD Conference 1997: 265-276.

Digital Library

Google Scholar

[7]

{HKPT98} Ykä Huhtala, Juha Kärkkäinen, Pasi Porkka, Hannu Toivonen: Efficient Discovery of Functional and Approximate Dependencies Using Partitions. ICDE 1998: 392-401.

Digital Library

Google Scholar

[8]

{JKN98} Theodore Johnson, Ivy Kwok, Raymond T. Ng: Fast Computation of 2-Dimensional Depth Contours. KDD 1998: 224-228.

Google Scholar

[9]

{KR90} L. Kaufman and P. Rousseeuw. Finding Groups in Data. John Wiley & Sons, 1990.

Crossref

Google Scholar

[10]

{KR98} Edwin M. Knorr, Raymond T. Ng: Algorithms for Mining Distance-Based Outliers in Large Datasets. VLDB 1998: 392-403.

Digital Library

Google Scholar

[11]

{KN99} E. Knorr and R. Ng. "Finding Intensional Knowledge of Distance-Based Outliers," Technical Report, Dept. of Computer Science, University of British Columbia.

Google Scholar

[12]

{NLHP98} Raymond T. Ng, Laks V. S. Lakshmanan, Jiawei Han, Alex Pang: Exploratory Mining and Pruning Optimizations of Constrained Association Rules. SIGMOD Conference 1998: 13-24.

Digital Library

Google Scholar

[13]

{RR96} I. Ruts and P. Rousseeuw. "Computing Depth Contours of Bivariate Point Clouds", Computational Statistics and Data Analysis, 23, pp. 153-168, 1996.

Digital Library

Google Scholar

[14]

{SBMU98} Craig Silverstein, Sergey Brin, Rajeev Motwani, Jeffrey D. Ullman: Scalable Techniques for Mining Causal Structures. VLDB 1998: 594-605.

Digital Library

Google Scholar

[15]

{TN98} V. Tucakov and R. Ng. "Identifying Unusual People Behavior: A Case Study of Mining Outliers in Spatio-Temporal Trajectory Databases", Proc. SIGMOD Workshop on Research Issues on Knowledge Discovery and Data Mining, 1998.

Google Scholar

[16]

{Tuk77} J. Tukey. Exploratory Data Analysis. Addison-Wesley, 1977.

Google Scholar

Cited By

View all

Song SGao FHuang RWang YLi GLi ZIdreos SSrivastava D(2021)On Saving Outliers for Better Clustering over Noisy DataProceedings of the 2021 International Conference on Management of Data10.1145/3448016.3457271(1692-1704)Online publication date: 9-Jun-2021
https://dl.acm.org/doi/10.1145/3448016.3457271
Shi JPan ZFang JChao P(2021)RUTOD: real-time urban traffic outlier detection on streaming trajectoryNeural Computing and Applications10.1007/s00521-021-06294-y35:5(3625-3637)Online publication date: 7-Aug-2021
https://dl.acm.org/doi/10.1007/s00521-021-06294-y
Park C(2019)Outlier and anomaly pattern detection on data streamsThe Journal of Supercomputing10.1007/s11227-018-2674-175:9(6118-6128)Online publication date: 1-Sep-2019
https://dl.acm.org/doi/10.1007/s11227-018-2674-1
Show More Cited By

Finding Intensional Knowledge of Distance-Based Outliers
1. Theory of computation

Recommendations

Intensional logic programming
The decidability of the intensional fragment of classical linear logic

Intensional classical linear logic (MELL) is proved decidable.Intensional interlinear logic (RLL) is proved decidable.We adapt Kripke's method used to prove decidability for some relevance logics.The semi-relevant RLL emerges as a logic superior to MELL ...
The intractability of computing the Hamming distance

Given a string x and a language L, the Hamming distance of x to L is the minimum Hamming distance of x to any string in L. The edit distance of a string to a language is analogously defined.First, we prove that there is a language in AC⁰ such that both ...

Comments

Information & Contributors

Information

Published In

VLDB '99: Proceedings of the 25th International Conference on Very Large Data Bases

September 1999

761 pages

ISBN:1558606157

Publisher

Morgan Kaufmann Publishers Inc.

San Francisco, CA, United States

Publication History

Published: 07 September 1999

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

78
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 01 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Song SGao FHuang RWang YLi GLi ZIdreos SSrivastava D(2021)On Saving Outliers for Better Clustering over Noisy DataProceedings of the 2021 International Conference on Management of Data10.1145/3448016.3457271(1692-1704)Online publication date: 9-Jun-2021
https://dl.acm.org/doi/10.1145/3448016.3457271
Shi JPan ZFang JChao P(2021)RUTOD: real-time urban traffic outlier detection on streaming trajectoryNeural Computing and Applications10.1007/s00521-021-06294-y35:5(3625-3637)Online publication date: 7-Aug-2021
https://dl.acm.org/doi/10.1007/s00521-021-06294-y
Park C(2019)Outlier and anomaly pattern detection on data streamsThe Journal of Supercomputing10.1007/s11227-018-2674-175:9(6118-6128)Online publication date: 1-Sep-2019
https://dl.acm.org/doi/10.1007/s11227-018-2674-1
Liu NShin DHu X(2018)Contextual outlier interpretationProceedings of the 27th International Joint Conference on Artificial Intelligence10.5555/3304889.3305002(2461-2467)Online publication date: 13-Jul-2018
https://dl.acm.org/doi/10.5555/3304889.3305002
Liu FSu WZhao JChen H(2018)Outlier Detection for Control Process Data Based on Improved ARHMMWireless Personal Communications: An International Journal10.5555/3288994.3289027103:1(11-24)Online publication date: 1-Nov-2018
https://dl.acm.org/doi/10.5555/3288994.3289027
Rouba BNait-Bahloul S(2018)Towards Identifying Multicriteria OutliersInternational Journal of Decision Support System Technology10.4018/IJDSST.201807010210:3(27-38)Online publication date: 1-Jul-2018
https://dl.acm.org/doi/10.4018/IJDSST.2018070102
Gupta SKumar RLu KMoseley BVassilvitskii S(2017)Local search methods for k-means with outliersProceedings of the VLDB Endowment10.14778/3067421.306742510:7(757-768)Online publication date: 1-Mar-2017
https://dl.acm.org/doi/10.14778/3067421.3067425
Xu QYan MHuang CXiong JHuang QYao YLiu QLienhart RWang HChen SBoll SChen PFriedland GLi JYan S(2017)Exploring Outliers in Crowdsourced Ranking for QoEProceedings of the 25th ACM international conference on Multimedia10.1145/3123266.3123267(1540-1548)Online publication date: 23-Oct-2017
https://dl.acm.org/doi/10.1145/3123266.3123267
Sellam TKersten M(2016)Fast, Explainable View Detection to Characterize Exploration QueriesProceedings of the 28th International Conference on Scientific and Statistical Database Management10.1145/2949689.2949692(1-12)Online publication date: 18-Jul-2016
https://dl.acm.org/doi/10.1145/2949689.2949692
Angiulli FFassetti F(2016)Toward Generalizing the Unification with Statistical OutliersACM Transactions on Knowledge Discovery from Data10.1145/282995610:3(1-26)Online publication date: 29-Jan-2016
https://dl.acm.org/doi/10.1145/2829956
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Recommendations

Intensional logic programming

The decidability of the intensional fragment of classical linear logic

The intractability of computing the Hamming distance

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations