Skip to main content

Specialty Mining

  • Conference paper
Data Warehousing and Knowledge Discovery (DaWaK 2010)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 6263))

Included in the following conference series:

  • 972 Accesses

Abstract

In this paper, we consider the problem of mining the special properties of a given record in a relational dataset. In our formulation, a property is a combination of multiple attribute-value pairs. The support of a property is the number of records that satisfy it. We consider a property as special if its support occurs to us as a shock and the measure of this shock factor is more than a user defined threshold η. We provide a way to define this notion of shock based on entropy. We also output the shock factor for records in the dataset in a convenient, easily-interpretable manner. An illustrated example is provided on how users can interpret the results. Experiments on real and synthetic data sets reveal interesting properties of data records that cannot be mined using traditional approaches.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Kanungo, T., Mount, D.M., Netanyahu, N.S., Paitko, C.D., Silverman, R.: An efficient k-means clustering algorithm algorithm: Analysis and implementation. IEEE Trans. Pattern Analysis and Machine Intelligence (2002)

    Google Scholar 

  2. Ester, M., Kriegel, H., Sander, J., Xu, X.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: Intl. Conf. on Knowledge Discovery and Data Mining, KDD (1996)

    Google Scholar 

  3. Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proc. of Intl. Conf. on Very Large Databases (VLDB) (September 1994)

    Google Scholar 

  4. Srikant, R., Agrawal, R.: Mining quantitative association rules in large relational tables. In: Proc. of ACM SIGMOD Intl. Conf. on Management of Data (June 1996)

    Google Scholar 

  5. Agrawal, R., Gehrke, J., Gunopulos, D., Raghavan, P.: Automatic subspace clustering of high dimensional data for data mining applications. In: Proc. of ACM SIGMOD Intl. Conf. on Management of Data (1998)

    Google Scholar 

  6. Agrawal, C., Yu, P.: Outlier detection for high dimensional data. In: Proc. of ACM SIGMOD Intl. Conf. on Management of Data (2001)

    Google Scholar 

  7. Ng, R., Breunig, M., Kriegel, H., Sander, J.: Identifying density based local outliers. In: Proc. of ACM SIGMOD Intl. Conf. on Management of Data (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kumar, H., Paravastu, R., Pudi, V. (2010). Specialty Mining. In: Bach Pedersen, T., Mohania, M.K., Tjoa, A.M. (eds) Data Warehousing and Knowledge Discovery. DaWaK 2010. Lecture Notes in Computer Science, vol 6263. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15105-7_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15105-7_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15104-0

  • Online ISBN: 978-3-642-15105-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics