enter search term and/or author name
How do we find a natural clustering of a real-world point set which contains an unknown number of clusters with different shapes, and which may be contaminated by noise? As most clustering algorithms were designed with certain...
Using frequent patterns to analyze data has been one of the fundamental approaches in many data mining applications. Research in frequent pattern mining has so far mostly focused on developing efficient algorithms to discover various kinds of...
Measuring and extracting proximity graphs in networks
Yehuda Koren, Stephen C. North, Chris Volinsky
Article No.: 12
Measuring distance or some other form of proximity between objects is a standard data mining tool. Connection subgraphs were recently proposed as a way to demonstrate proximity between nodes in networks. We propose a new way of measuring and...
Learning to detect events with Markov-modulated poisson processes
Alexander Ihler, Jon Hutchins, Padhraic Smyth
Article No.: 13
Time-series of count data occur in many different contexts, including Internet navigation logs, freeway traffic monitoring, and security logs associated with buildings. In this article we describe a framework for detecting anomalous events in such...
Assessing data mining results via swap randomization
Aristides Gionis, Heikki Mannila, Taneli Mielikäinen, Panayiotis Tsaparas
Article No.: 14
The problem of assessing the significance of data mining results on high-dimensional 0--1 datasets has been studied extensively in the literature. For problems such as mining frequent sets and finding correlations, significance testing can be done...