Sciweavers

870 search results - page 86 / 174
» Graph Comparison Using Fine Structure Analysis
Sort
View
ICC
2008
IEEE
126views Communications» more  ICC 2008»
15 years 4 months ago
Discovering Packet Structure through Lightweight Hierarchical Clustering
— The complexity of current Internet applications makes the understanding of network traffic a challenging task. By providing larger-scale aggregates for analysis, unsupervised ...
Abdulrahman Hijazi, Hajime Inoue, Ashraf Matrawy, ...
ICDM
2005
IEEE
168views Data Mining» more  ICDM 2005»
15 years 3 months ago
Usage-Based PageRank for Web Personalization
Recommendation algorithms aim at proposing “next” pages to a user based on her current visit and the past users’ navigational patterns. In the vast majority of related algor...
Magdalini Eirinaki, Michalis Vazirgiannis
COR
2010
146views more  COR 2010»
14 years 10 months ago
A search space "cartography" for guiding graph coloring heuristics
We present a search space analysis and its application in improving local search algorithms for the graph coloring problem. Using a classical distance measure between colorings, w...
Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz
DIM
2007
ACM
15 years 1 months ago
Linkability estimation between subjects and message contents using formal concepts
In this paper, we examine how conclusions about linkability threats can be drawn by analyzing message contents and subject knowledge in arbitrary communication systems. At first, ...
Stefan Berthold, Sebastian Clauß
KDD
2005
ACM
145views Data Mining» more  KDD 2005»
15 years 10 months ago
Using and Learning Semantics in Frequent Subgraph Mining
The search for frequent subgraphs is becoming increasingly important in many application areas including Web mining and bioinformatics. Any use of graph structures in mining, howev...
Bettina Berendt