Sciweavers

113 search results - page 22 / 23
» Frequent subgraph pattern mining on uncertain graph data
Sort
View
CIKM
2008
Springer
13 years 6 months ago
On effective presentation of graph patterns: a structural representative approach
In the past, quite a few fast algorithms have been developed to mine frequent patterns over graph data, with the large spectrum covering many variants of the problem. However, the...
Chen Chen, Cindy Xide Lin, Xifeng Yan, Jiawei Han
WWW
2009
ACM
14 years 5 months ago
Smart Miner: a new framework for mining large scale web usage data
In this paper, we propose a novel framework called SmartMiner for web usage mining problem which uses link information for producing accurate user sessions and frequent navigation...
Murat Ali Bayir, Ismail Hakki Toroslu, Ahmet Cosar...
CIKM
2009
Springer
13 years 11 months ago
L2 norm regularized feature kernel regression for graph data
Features in many real world applications such as Cheminformatics, Bioinformatics and Information Retrieval have complex internal structure. For example, frequent patterns mined fr...
Hongliang Fei, Jun Huan
CIDM
2009
IEEE
13 years 11 months ago
Mining for insider threats in business transactions and processes
—Protecting and securing sensitive information are critical challenges for businesses. Deliberate and intended actions such as malicious exploitation, theft or destruction of dat...
William Eberle, Lawrence B. Holder
ICDM
2007
IEEE
159views Data Mining» more  ICDM 2007»
13 years 11 months ago
Incremental Subspace Clustering over Multiple Data Streams
Data streams are often locally correlated, with a subset of streams exhibiting coherent patterns over a subset of time points. Subspace clustering can discover clusters of objects...
Qi Zhang, Jinze Liu, Wei Wang 0010