Sciweavers

1162 search results - page 150 / 233
» Minimum Cycle Bases in Graphs Algorithms and Applications
Sort
View
175
Voted
CIKM
2010
Springer
15 years 2 months ago
SHRINK: a structural clustering algorithm for detecting hierarchical communities in networks
Community detection is an important task for mining the structure and function of complex networks. Generally, there are several different kinds of nodes in a network which are c...
Jianbin Huang, Heli Sun, Jiawei Han, Hongbo Deng, ...
142
Voted
KDD
2004
ACM
158views Data Mining» more  KDD 2004»
16 years 4 months ago
A generalized maximum entropy approach to bregman co-clustering and matrix approximation
Co-clustering is a powerful data mining technique with varied applications such as text clustering, microarray analysis and recommender systems. Recently, an informationtheoretic ...
Arindam Banerjee, Inderjit S. Dhillon, Joydeep Gho...
122
Voted
ICPR
2010
IEEE
15 years 6 months ago
Entropy Estimation and Multi-Dimensional Scale Saliency
In this paper we survey two multi-dimensional Scale Saliency approaches based on graphs and the k-d partition algorithm. In the latter case we introduce a new divergence metric an...
Pablo Suau, Francisco Escolano
CIKM
2009
Springer
15 years 10 months ago
A mobile tourist assistance and recommendation system based on complex networks
In recent years, the tourism assistance community is gradually shifting its emphasis to digital, interactive systems. Our project aims for digital tourism assistance by combining ...
Alf-Christian Schering, Martin Dueffer, Andreas Fi...
ICVS
2003
Springer
15 years 9 months ago
Automatic Mapping of Settlement Areas Using a Knowledge-Based Image Interpretation System
Abstract. We introduce the knowledge-based image interpretation system GeoAIDA and give examples for an image operator, extracting trees from aerial imagery. Moreover we present a ...
Bernd-Michael Straub, Markus Gerke, Martin Pahl