Sciweavers

538 search results - page 60 / 108
» Efficient and Effective Clustering Methods for Spatial Data ...
Sort
View
KDD
2007
ACM
144views Data Mining» more  KDD 2007»
14 years 9 months ago
Fast direction-aware proximity for graph mining
In this paper we study asymmetric proximity measures on directed graphs, which quantify the relationships between two nodes or two groups of nodes. The measures are useful in seve...
Hanghang Tong, Christos Faloutsos, Yehuda Koren
ISMIS
2009
Springer
14 years 3 months ago
Discovering Structured Event Logs from Unstructured Audit Trails for Workflow Mining
Workflow mining aims to find graph-based process models based on activities, emails, and various event logs recorded in computer systems. Current workflow mining techniques mainly ...
Liqiang Geng, Scott Buffett, Bruce Hamilton, Xin W...
KDD
2009
ACM
206views Data Mining» more  KDD 2009»
14 years 9 months ago
Ranking-based clustering of heterogeneous information networks with star network schema
A heterogeneous information network is an information network composed of multiple types of objects. Clustering on such a network may lead to better understanding of both hidden s...
Yizhou Sun, Yintao Yu, Jiawei Han
EDBT
2008
ACM
180views Database» more  EDBT 2008»
14 years 9 months ago
Probabilistic ranked queries in uncertain databases
Recently, many new applications, such as sensor data monitoring and mobile device tracking, raise up the issue of uncertain data management. Compared to "certain" data, ...
Xiang Lian, Lei Chen 0002
KDD
2008
ACM
243views Data Mining» more  KDD 2008»
14 years 9 months ago
Permu-pattern: discovery of mutable permutation patterns with proximity constraint
Pattern discovery in sequences is an important problem in many applications, especially in computational biology and text mining. However, due to the noisy nature of data, the tra...
Meng Hu, Jiong Yang, Wei Su