Sciweavers

292 search results - page 18 / 59
» A Partition-Based Approach to Graph Mining
Sort
View
EPIA
2009
Springer
14 years 3 months ago
An Algorithm to Discover the k-Clique Cover in Networks
Abstract. In social network analysis, a k-clique is a relaxed clique, i.e., a kclique is a quasi-complete sub-graph. A k-clique in a graph is a sub-graph where the distance between...
Luís Cavique, Armando B. Mendes, Jorge M. A...
ICDE
2005
IEEE
164views Database» more  ICDE 2005»
14 years 9 months ago
Knowledge Discovery from Transportation Network Data
Transportation and Logistics are a major sector of the economy, however data analysis in this domain has remained largely in the province of optimization. The potential of data mi...
Wei Jiang, Jaideep Vaidya, Zahir Balaporia, Chris ...
IADIS
2008
13 years 10 months ago
Data Mining In Non-Stationary Multidimensional Time Series Using A Rule Similarity Measure
Time series analysis is a wide area of knowledge that studies processes in their evolution. The classical research in the area tends to find global laws underlying the behaviour o...
Nikolay V. Filipenkov
DMIN
2007
110views Data Mining» more  DMIN 2007»
13 years 10 months ago
Mining for Structural Anomalies in Graph-based Data
—In this paper we present graph-based approaches to mining for anomalies in domains where the anomalies consist of unexpected entity/relationship alterations that closely resembl...
William Eberle, Lawrence B. Holder
WSDM
2012
ACM
245views Data Mining» more  WSDM 2012»
12 years 4 months ago
The early bird gets the buzz: detecting anomalies and emerging trends in information networks
In this work we propose a novel approach to anomaly detection in streaming communication data. We first build a stochastic model for the system based on temporal communication pa...
Brian Thompson