Abstract
In many languages, the English word “computer” is often literally translated to “the counting machine.” Counting is apparently the most elementary operation that a computer can do, and thus it should be trivial to a computer to count. This, however, is a misconception. The apparently simple operation of enumeration and counting is actually computationally hard. It is also one of the most important elementary operation for many data mining tasks. We show how capital counting is for a variety of data mining applications and how this complex task can be achieved with acceptable efficiency.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proc. 1994 Int. Conf. Very Large Data Bases, Santiago, Chile, September 1994, pp. 487–499 (1994)
Bay, S., Pazzani, M.: Detecting changes in categorical data: Mining contrast sets. In: ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Diego, USA, pp. 302–306 (1999)
Bayardo, R.J.: Efficiently mining long patterns from databases. In: ACM SIGMOD (1998)
Beil, F., Ester, M., Xu, X.: Frequent term-based text clustering. In: ACM Int. Conf. on Knowledge Discovery and Data Mining (SIGKDD 2002), Edmonton, Canada (2002)
Dong, G., Li, J.: Efficient mining of emerging patterns: Discovering trends and differences. In: ACM SIGKDD International Conference on Knowledge Discovery and Data MIning, San Diego, USA, pp. 43–52 (1999)
El-Hajj, M., Zaïane, O.R.: Cofi approach for mining frequent itemsets revisited. In: 9th ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery (DMKD 2004), Paris, France, June 2004, pp. 70–75 (2004)
Gusfield, D.: Algorithms on Strings, Trees, and sequences: Computer Science and Coputational Biology. Cambridge University Press, Cambridge (1997)
Liu, B., Hsu, W., Ma, Y.: Integrating classification and association rule mining. In: 4th Intl. Conf. on Knowledge Discovery and Data Mining (KDD 1998), New York City, NY, August 1998, pp. 80–86 (1998)
Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Discovering frequent closed itemsets for association rules. In: International Conference on Database Theory (ICDT), January 1999, pp. 398–416 (1999)
Weigend, A., Gershenfeld, N.: Time Series Prediction: Forecasting the Future and Understanding the Past. Addison-Wesley, Reading (1993)
Wu, X., Wan, X., Wu, G., Xu, D., Lin, G.-H.: Whole genome phylogeny construction via complete composition vectors. Technical Report TR05-06, Department of Computing Science, University of Alberta (January 2005)
Yang, Q., Wang, H., Zhang, W.: Web-log mining for quantitative temporal-event prediction. IEEE Computational Intelligence Bulletin 1(1), 10–18 (2002)
Zaïane, O.R., Antonie, M.-L.: Classifying text documents by associating terms with text categ ories. In: Proc. of the Thirteenth Australasian Database Conference (ADC 2002), Melbourne, Australia, January 2002, pp. 215–222 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zaïane, O.R. (2005). Relevance of Counting in Data Mining Tasks. In: Li, X., Wang, S., Dong, Z.Y. (eds) Advanced Data Mining and Applications. ADMA 2005. Lecture Notes in Computer Science(), vol 3584. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11527503_4
Download citation
DOI: https://doi.org/10.1007/11527503_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-27894-8
Online ISBN: 978-3-540-31877-4
eBook Packages: Computer ScienceComputer Science (R0)