Next Generation Data Mining Tools: Power Laws and Self-Similarity for Graphs, Streams and Traditional Data
Abstract
What patterns can we find in a bursty web traffic? On the web or internet graph itself? How about the distributions of galaxies in the sky, or the distribution of a company’s customers in geographical space? How long should we expect a nearest-neighbor search to take, when there are 100 attributes per patient or customer record? The traditional assumptions (uniformity, independence, Poisson arrivals, Gaussian distributions), often fail miserably. Should we give up trying to find patterns in such settings? Self-similarity, fractals and power laws are extremely successful in describing real datasets (coast-lines, rivers basins, stock-prices, brain-surfaces, communication-line noise, to name a few). We show some old and new successes, involving modeling of graph topologies (internet, web and social networks); modeling galaxy and video data; dimensionality reduction; and more.
Cite
Text
Faloutsos. "Next Generation Data Mining Tools: Power Laws and Self-Similarity for Graphs, Streams and Traditional Data." European Conference on Machine Learning, 2003. doi:10.1007/978-3-540-39857-8_3Markdown
[Faloutsos. "Next Generation Data Mining Tools: Power Laws and Self-Similarity for Graphs, Streams and Traditional Data." European Conference on Machine Learning, 2003.](https://mlanthology.org/ecmlpkdd/2003/faloutsos2003ecml-next/) doi:10.1007/978-3-540-39857-8_3BibTeX
@inproceedings{faloutsos2003ecml-next,
title = {{Next Generation Data Mining Tools: Power Laws and Self-Similarity for Graphs, Streams and Traditional Data}},
author = {Faloutsos, Christos},
booktitle = {European Conference on Machine Learning},
year = {2003},
pages = {10-15},
doi = {10.1007/978-3-540-39857-8_3},
url = {https://mlanthology.org/ecmlpkdd/2003/faloutsos2003ecml-next/}
}