Sciweavers

7150 search results - page 545 / 1430
» Graph-Based Data Mining
Sort
View
IJCNN
2006
IEEE
16 years 1 months ago
Prototype based outlier detection
— Outliers refer to “minority” data that are different from most other data. They usually disturb data mining process. But, sometimes they provide valuable information. Thus,...
Seungtaek Kim, Sungzoon Cho
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
16 years 7 months ago
Dense itemsets
Frequent itemset mining has been the subject of a lot of work in data mining research ever since association rules were introduced. In this paper we address a problem with frequen...
Heikki Mannila, Jouni K. Seppänen
AAAI
2008
15 years 9 months ago
Clustering via Random Walk Hitting Time on Directed Graphs
In this paper, we present a general data clustering algorithm which is based on the asymmetric pairwise measure of Markov random walk hitting time on directed graphs. Unlike tradi...
Mo Chen, Jianzhuang Liu, Xiaoou Tang
ICDM
2008
IEEE
106views Data Mining» more  ICDM 2008»
16 years 1 months ago
Metropolis Algorithms for Representative Subgraph Sampling
While data mining in chemoinformatics studied graph data with dozens of nodes, systems biology and the Internet are now generating graph data with thousands and millions of nodes....
Christian Hübler, Hans-Peter Kriegel, Karsten...
ICDE
2010
IEEE
290views Database» more  ICDE 2010»
15 years 11 months ago
The Model-Summary Problem and a Solution for Trees
Modern science is collecting massive amounts of data from sensors, instruments, and through computer simulation. It is widely believed that analysis of this data will hold the key ...
Biswanath Panda, Mirek Riedewald, Daniel Fink