NDLI: Incremental Temporal Pattern Mining Using Efficient Batch-Free Stream Clustering

Please wait, while we are loading the content...

Managing Sensor Data Streams: Lessons Learned from the WeBike Project

Measuring Fairness in Ranked Outputs

SGVCut: A Vertex-Cut Partitioning Tool for Random Walks-based Computations over Social Network graphs

Incremental Discovery of Inclusion Dependencies

How the Passengers Flow in Complex Metro Networks?

VISOR: Visualizing Summaries of Ordered Data

Generating What-If Scenarios for Time Series Data

DualDB: An Efficient LSM-based Publish/Subscribe Storage System

Skluma: A Statistical Learning Pipeline for Taming Unkempt Data Repositories

Computing Influence of a Product through Uncertain Reverse Skyline

DistriPlan: An Optimized Join Execution Framework for Geo-Distributed Scientific Data

DataSynthesizer: Privacy-Preserving Synthetic Datasets

FlatFIT: Accelerated Incremental Sliding-Window Aggregation For Real-Time Analytics

Fides: Towards a Platform for Responsible Data Science

A Benchmark for Betweenness Centrality Approximation Algorithms on Large Graphs

Challenges of Differentially Private Release of Data Under an Open-world Assumption

Incremental Temporal Pattern Mining Using Efficient Batch-Free Stream Clustering

Mining Persistent and Discriminative Communities in Graph Ensembles

Dot-Product Join: Scalable In-Database Linear Algebra for Big Model Analytics

High-Definition Digital Elevation Model System Vision Paper

On-line Versioned Schema Inference for Large Semantic Web Data Sources

Discovering Partial Periodic Itemsets in Temporal Databases

Bi-Level Online Aggregation on Raw Data

Detecting Global Hyperparaboloid Correlated Clusters Based on Hough Transform

Tiling Strategies for Distributed Point Cloud Databases

Edge Labeling Schemes for Graph Data

Computing Isochrones in Multimodal Spatial Networks using Tile Regions

Class-based Conditional MaxRS Query in Spatial Data Streams

Location and Processing Aware Datacube Caching

Active Learning with Density-Initialized Decision Tree for Record Matching

MELT: Mapreduce-based Efficient Large-scale Trajectory Anonymization

BLOCK: Efficient Execution of Spatial Range Queries in Main-Memory

PLI: Augmenting Live Databases with Custom Clustered Indexes

Multi-Hypothesis CSV Parsing

Improving Statistical Similarity Based Data Reduction for Non-Stationary Data

Fast Equi-Join Algorithms on GPUs: Design and Implementation

Dynamic Group Trip Planning Queries in Spatial Databases

Query Suggestion to allow Intuitive Interactive Search in Multidimensional Time Series

SHRec: Scalable Holistic Recommendation

A Unified Correlation-based Approach to Sampling Over Joins

Probabilistic k-Nearest Neighbor Monitoring of Moving Gaussians

Incremental Temporal Pattern Mining Using Efficient Batch-Free Stream Clustering

Content Provider	ACM Digital Library
Author	Lu, Yifeng Hassani, Marwan Seidl, Thomas
Abstract	This paper address the problem of temporal pattern mining from multiple data streams containing temporal events. Temporal events are considered as real world events aligned with comprehensive starting and ending timing information rather than simple integer timestamps. Predefined relations, such as "before" and "after", describe the heterogeneous relationships hidden in temporal data with limited diversity. In this work, the relationships among events are learned dynamically from the temporal information. Each event is treated as an object with a label and numerical attributes. An online-offline model is used as the primary structure for analyzing the evolving multiple streams. Different distance functions on temporal events and sequences can be applied depending on the application scenario. A prefix tree is introduced for a fast incremental pattern update. Events in the real world usually persist for some period. It is more natural to model events as intervals with temporal information rather than as points on the timeline. Based on the representation proposed in this work, our approach can also be extended to handle interval data. Experiments show how the method, with richer information and more accurate results than the state-of-the-art, processes both point-based and interval-based event streams efficiently.
Starting Page	1
Ending Page	12
Page Count	12
File Format	PDF
ISBN	9781450352826
DOI	10.1145/3085504.3085511
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2017-06-27
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Stream clustering Interval-based events Sequential pattern mining
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

An efficient algorithm for mining time interval-based patterns in large database

Parallel and quantitative sequential pattern mining for large-scale interval-based temporal data

Online Incremental Mining Based on Trusted Behavior Interval

Efficient Mining of High Utility Sequential Pattern from Incremental Sequential Dataset

CEMiner -- An Efficient Algorithm for Mining Closed Patterns from Time Interval-Based Data

A fuzzy constrained stream sequential pattern mining algorithm

Incremental Mining of High Utility Sequential Patterns in Incremental Databases

Sequential pattern mining of multi modal data streams in dyadic interactions.

Incremental mining of temporal patterns in interval-based database

Incremental Temporal Pattern Mining Using Efficient Batch-Free Stream Clustering

Similar Documents

An efficient algorithm for mining time interval-based patterns in large database

Parallel and quantitative sequential pattern mining for large-scale interval-based temporal data

Online Incremental Mining Based on Trusted Behavior Interval

Efficient Mining of High Utility Sequential Pattern from Incremental Sequential Dataset

CEMiner -- An Efficient Algorithm for Mining Closed Patterns from Time Interval-Based Data

A fuzzy constrained stream sequential pattern mining algorithm

Incremental Mining of High Utility Sequential Patterns in Incremental Databases

Sequential pattern mining of multi modal data streams in dyadic interactions.

Incremental mining of temporal patterns in interval-based database

Incremental Temporal Pattern Mining Using Efficient Batch-Free Stream Clustering