from    
to    
search  

 


物理系colloquium: 单原子灵敏检测用于探索古老的冰与水
集成电路系列学术邀请报告第07期:先进IC制造中的计算光刻技术
The Role of Behavioral Science as Facilitator and Accelerator of SDGsand Glob...
天文系 Colloquium: Like a wrecking ball: understanding giant planets as theke...
报告题目:
Data Mining using Fractals and Power Laws
 报告人:
Prof.Christos Faloutsos
CMU
报告时间:
2007-06-07 10:00
报告地点:
FIT 1-415
主办单位:
清华大学计算机系
  简介:
What patterns can we find in a bursty web traffic? On the web or on the 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.


BIOGRAPHICAL NOTE
Christos Faloutsos is a Professor at Carnegie Mellon University. He has received the Presidential Young Investigator Award by the National Science Foundation (1989), the Research Contributions Award in ICDM 2006, nine ``best paper'' awards, and several teaching awards. He has served as a member of the executive committee of SIGKDD; he has published over 160 refereed articles, 11 book chapters and one monograph. He holds five patents and he has given over 20 tutorials and 10 invited distinguished lectures. His research interests include data mining for streams and networks, fractals, indexing for multimedia and bio-informatics data, and database performance.




今日相关信息
清华大学外语系学术讲座之一:The Villa...
聆听智者演绎人生、感悟为人治学之道
Regional & Urban Planning supported b...
压力应对有良方:谈大学生压力管理
 
同类别相关信息
注意报告时间更改:New and Old Graph...
注意报告时间更改:String Graphs and...
Algorithmic Graph Theory and its Ap...
Optimal Binary Comparison Search Tr...
Dynamic Service Migration and Workl...
学术活动