Algorithms and Heuristics for Data Mining in Sensor Networks

The author defines the term moral in the context on sensor networks through the definition of Index Invariant Graphs and Index Invariant Trees. The methods build on these terms are closely related to the Hidden Conditional Random Field Model. The novel models are then compared with other graph clustering methods, namely Girvan-Newman, Karger's Algorith and Spectral Clustering. The book requires no initial understanding in the field of graph clustering. The book can be used as an introduction to time dynamic sensor networks.

Autorentext

Vladislav Georgiev Vasilev has a PhD in communication networks from the Technical University Sofia. The author also has diverse practical experience with many graph clustering tasks.