Top-Down Mining of Interesting Patterns from Very High Dimensional Data

@article{Liu2006TopDownMO,
  title={Top-Down Mining of Interesting Patterns from Very High Dimensional Data},
  author={Hongyan Liu and Jiawei Han and Dong Xin and Zheng Shao},
  journal={22nd International Conference on Data Engineering (ICDE'06)},
  year={2006},
  pages={114-114}
}
Many real world applications deal with transactional data, characterized by a huge number of transactions (tuples) with a small number of dimensions (attributes). However, there are some other applications that involve rather high dimensional data with a small number of tuples. Examples of such applications include bioinformatics, survey-based statistical analysis, text processing, and so on. High dimensional data pose great challenges to most existing data mining algorithms. Although there are… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.
6 Citations
6 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-6 of 6 references

Efficiently Using Prefix-trees in Mining Frequent Itemsets

  • G. Grahne, J. Zhu
  • In Proc. of the IEEE ICDM Workshop on Frequent…
  • 2003
1 Excerpt

Finding closed patterns in long biological datasets

  • A. K. H. Tung
  • 2003

Similar Papers

Loading similar papers…