![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
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...
-
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...
-
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...
-
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...
-
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...
-
Article
Diamond Quorum Consensus for High Capacity and Efficiency in a Replicated Database System
Many quorum consensus protocols have been proposed for the management of replicated data in a distributed environment. The advantages of a replicated database system over a non-replicated one include high avai...
-
Chapter and Conference Paper
Discovering Temporal Patterns for Interval-based Events
In many daily transactions, the time when an event takes place is known and stored in databases. Examples range from sales records, stock exchange, patient records, to scientific databases in geophysics and as...