• Published 2006

UNDERSTANDING COMPLEX DATASETS: DATA MINING WITH MATRIX DECOMPOSITIONS

@inproceedings{Kumar2006UNDERSTANDINGCD,
  title={UNDERSTANDING COMPLEX DATASETS: DATA MINING WITH MATRIX DECOMPOSITIONS},
  author={Vipin Kumar},
  year={2006}
}
ion is the process of identifying a solution to a general problem rather than a specific problem. For example, we can design a generic container to hold different types of data (e.g., integers and floats) in a sorting algorithm. In this way, we can use the sorting algorithm to sort integers and floats. Hence, abstraction helps you achieve reuse. Implementation hiding, as its name implies, is to hide the implementation behind the interface. As long as we do not change the interface of an object… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 83 CITATIONS

Touch and Move: Incoming Call User Authentication

VIEW 7 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

FILTER CITATIONS BY YEAR

2007
2019

CITATION STATISTICS

  • 21 Highly Influenced Citations

References

Publications referenced by this paper.
SHOWING 1-10 OF 48 REFERENCES

Document clustering with prior knowledge

  • SIGIR
  • 2006
VIEW 8 EXCERPTS
HIGHLY INFLUENTIAL

Feature Weighting in k-Means Clustering

VIEW 10 EXCERPTS
HIGHLY INFLUENTIAL

Y-means: a clustering method for intrusion detection

  • CCECE 2003 - Canadian Conference on Electrical and Computer Engineering. Toward a Caring and Humane Technology (Cat. No.03CH37436)
  • 2003
VIEW 8 EXCERPTS
HIGHLY INFLUENTIAL

A framework for finding projected clusters in high dimensional spaces

C C.Aggarwal, C. Procopiuc, J L.Wolf, P S.Yu, J.-S. Park
  • Proceedings of the ACM SIGMOD Conference on Management of Data,
  • 1999
VIEW 7 EXCERPTS
HIGHLY INFLUENTIAL