![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Reference Work Entry In depth
Query by Humming
-
Chapter and Conference Paper
Counting Edges and Triangles in Online Social Networks via Random Walk
Online social network (OSN) analysis has attracted much attention in recent years. Edge and triangle counts are both fundamental properties in OSNs. However, for many OSNs, one can only access parts of the net...
-
Living Reference Work Entry In depth
Query by Humming
-
Chapter and Conference Paper
Community Based Information Dissemination
Given a social network, we study the problem of finding \(k\) seeds that maximize the dissemination of information. B...
-
Article
Maximizing bichromatic reverse nearest neighbor for L p -norm in two- and three-dimensional spaces
Bichromatic reverse nearest neighbor (BRNN) has been extensively studied in spatial database literature. In this paper, we study a related problem called MaxBRNN: find an optimal region that maximizes the size...
-
Article
STAIRS: Towards efficient full-text filtering and dissemination in DHT environments
Nowadays “live” content, such as weblog, wikipedia, and news, is ubiquitous in the Internet. Providing users with relevant content in a timely manner becomes a challenging problem. Differing from Web search te...
-
Article
Fast graph query processing with a low-cost index
This paper studies the problem of processing supergraph queries, that is, given a database containing a set of graphs, find all the graphs in the database of which the query graph is a supergraph. Existing works ...
-
Chapter and Conference Paper
Mining N-most Interesting Itemsets
Previous methods on mining association rules require users to input a minimum support threshold. However, there can be too many or too few resulting rules if the threshold is set inappropriately. It is difficu...
-
Reference Work Entry In depth
Query by Humming
-
Chapter and Conference Paper
Workshop Organizers’ Message
International Workshop on Privacy-Preserving Data Analysis (PPDA) 2009 took place at Brisbane, Australia on 21st April, 2009. There were two sessions for this workshop with 2 paper presentations in the first s...
-
Article
Scaling and time war** in time series querying
The last few years have seen an increasing understanding that dynamic time war** (DTW), a technique that allows local flexibility in aligning time series, is superior to the ubiquitous Euclidean distance for...
-
Chapter
Privacy-Preserving Data Stream Classification
In a wide range of applications, multiple data streams need to be examined together in order to discover trends or patterns existing across several data streams. One common practice is to redirect all data str...
-
Chapter and Conference Paper
Clustering Massive Text Data Streams by Semantic Smoothing Model
Clustering text data streams is an important issue in data mining community and has a number of applications such as news group filtering, text crawling, document organization and topic detection and tracing e...
-
Chapter and Conference Paper
Finding Time Series Discords Based on Haar Transform
The problem of finding anomaly has received much attention recently. However, most of the anomaly detection algorithms depend on an explicit definition of anomaly, which may be impossible to elicit from a doma...
-
Chapter and Conference Paper
Achieving k-Anonymity by Clustering in Attribute Hierarchical Structures
Individual privacy will be at risk if a published data set is not properly de-identified. k-anonymity is a major technique to de-identify a data set. A more general view of k-anonymity is clustering with a constr...
-
Chapter and Conference Paper
ISM: Item Selection for Marketing with Cross-Selling Considerations
Many different algorithms are studied on association rules in the literature of data mining. Some researchers are now focusing on the application of association rules. In this paper, we will study one of the a...
-
Article
Optimal Algorithms for Finding User Access Sessions from Very Large Web Logs
Although efficient identification of user access sessions from very large web logs is an unavoidable data preparation task for the success of higher level web log mining, little attention has been paid to algo...
-
Chapter and Conference Paper
Mining Frequent Episodes for Relating Financial Events and Stock Trends
It is expected that stock prices can be affected by the local and overseas political and economic events. We extract events from the financial news of Chinese local newspapers which are available on the web, t...
-
Chapter and Conference Paper
Enhancing Effectiveness of Outlier Detections for Low Density Patterns
Outlier detection is concerned with discovering exceptional behaviors of objects in data sets. It is becoming a growingly useful tool in applications such as credit card fraud detection, discovering criminal b...
-
Chapter and Conference Paper
Optimal Algorithms for Finding User Access Sessions from Very Large Web Logs
Although efficient identification of user access sessions from very large web logs is an unavoidable data preparation task for the success of higher level web log mining, little attention has been paid to algo...