Sciweavers

4085 search results - page 244 / 817
» Benchmarking Data Mining Algorithms
Sort
View
138
Voted
JCP
2006
173views more  JCP 2006»
15 years 3 months ago
Database Intrusion Detection using Weighted Sequence Mining
Data mining is widely used to identify interesting, potentially useful and understandable patterns from a large data repository. With many organizations focusing on webbased on-lin...
Abhinav Srivastava, Shamik Sural, Arun K. Majumdar
KDD
2006
ACM
115views Data Mining» more  KDD 2006»
16 years 4 months ago
Aggregating time partitions
Partitions of sequential data exist either per se or as a result of sequence segmentation algorithms. It is often the case that the same timeline is partitioned in many different ...
Evimaria Terzi, Panayiotis Tsaparas, Taneli Mielik...
109
Voted
KDD
1998
ACM
146views Data Mining» more  KDD 1998»
15 years 8 months ago
Mining Association Rules in Hypertext Databases
In this workweproposea generalisation of the notion of associationrule in the contextof flat transactions to that of a compositeassociation rule in the context of a structured dir...
José Borges, Mark Levene
141
Voted
SIGMOD
2010
ACM
217views Database» more  SIGMOD 2010»
15 years 8 months ago
Mining knowledge from databases: an information network analysis approach
Most people consider a database is merely a data repository that supports data storage and retrieval. Actually, a database contains rich, inter-related, multi-typed data and infor...
Jiawei Han, Yizhou Sun, Xifeng Yan, Philip S. Yu
PAKDD
2004
ACM
186views Data Mining» more  PAKDD 2004»
15 years 9 months ago
CMTreeMiner: Mining Both Closed and Maximal Frequent Subtrees
Abstract. Tree structures are used extensively in domains such as computational biology, pattern recognition, XML databases, computer networks, and so on. One important problem in ...
Yun Chi, Yirong Yang, Yi Xia, Richard R. Muntz