LIVIVO - Search results -

Search results

Result 1 - 10 of total 31

Search options

Book ; Online: Co-movement Pattern Mining from Videos

Zhang, Dongxiang / Ma, Teng / Hu, Junnan / Bei, Yijun / Tan, Kian-Lee / Chen, Gang

2023

Abstract: Co-movement pattern mining from GPS trajectories has been an intriguing subject in spatial-temporal data mining. In this paper, we extend this research line by migrating the data source from GPS sensors to surveillance cameras, and presenting the first ... ...

Abstract	Co-movement pattern mining from GPS trajectories has been an intriguing subject in spatial-temporal data mining. In this paper, we extend this research line by migrating the data source from GPS sensors to surveillance cameras, and presenting the first investigation into co-movement pattern mining from videos. We formulate the new problem, re-define the spatial-temporal proximity constraints from cameras deployed in a road network, and theoretically prove its hardness. Due to the lack of readily applicable solutions, we adapt existing techniques and propose two competitive baselines using Apriori-based enumerator and CMC algorithm, respectively. As the principal technical contributions, we introduce a novel index called temporal-cluster suffix tree (TCS-tree), which performs two-level temporal clustering within each camera and constructs a suffix tree from the resulting clusters. Moreover, we present a sequence-ahead pruning framework based on TCS-tree, which allows for the simultaneous leverage of all pattern constraints to filter candidate paths. Finally, to reduce verification cost on the candidate paths, we propose a sliding-window based co-movement pattern enumeration strategy and a hashing-based dominance eliminator, both of which are effective in avoiding redundant operations. We conduct extensive experiments for scalability and effectiveness analysis. Our results validate the efficiency of the proposed index and mining algorithm, which runs remarkably faster than the two baseline methods. Additionally, we construct a video database with 1169 cameras and perform an end-to-end pipeline analysis to study the performance gap between GPS-driven and video-driven methods. Our results demonstrate that the derived patterns from the video-driven approach are similar to those derived from groundtruth trajectories, providing evidence of its effectiveness.
Keywords	Computer Science - Databases
Subject code	005
Publishing date	2023-08-10
Publishing country	us
Document type	Book ; Online
Database	BASE - Bielefeld Academic Search Engine (life sciences selection)

Full text online

Full text

Inter-library loan at ZB MED

Your chosen title can be delivered directly to ZB MED Cologne location if you are registered as a user at ZB MED Cologne.

Book ; Online: Semantic and Influence aware k-Representative Queries over Social Streams

Wang, Yanhao / Li, Yuchen / Tan, Kian-Lee

2019

Abstract: Massive volumes of data continuously generated on social platforms have become an important information source for users. A primary method to obtain fresh and valuable information from social streams is \emph{social search}. Although there have been ... ...

Abstract	Massive volumes of data continuously generated on social platforms have become an important information source for users. A primary method to obtain fresh and valuable information from social streams is \emph{social search}. Although there have been extensive studies on social search, existing methods only focus on the \emph{relevance} of query results but ignore the \emph{representativeness}. In this paper, we propose a novel Semantic and Influence aware $k$-Representative ($k$-SIR) query for social streams based on topic modeling. Specifically, we consider that both user queries and elements are represented as vectors in the topic space. A $k$-SIR query retrieves a set of $k$ elements with the maximum \emph{representativeness} over the sliding window at query time w.r.t. the query vector. The representativeness of an element set comprises both semantic and influence scores computed by the topic model. Subsequently, we design two approximation algorithms, namely \textsc{Multi-Topic ThresholdStream} (MTTS) and \textsc{Multi-Topic ThresholdDescend} (MTTD), to process $k$-SIR queries in real-time. Both algorithms leverage the ranked lists maintained on each topic for $k$-SIR processing with theoretical guarantees. Extensive experiments on real-world datasets demonstrate the effectiveness of $k$-SIR query compared with existing methods as well as the efficiency and scalability of our proposed algorithms for $k$-SIR processing. Comment: 27 pages, 14 figures, to appear in the 22nd International Conference on Extending Database Technology (EDBT 2019)
Keywords	Computer Science - Social and Information Networks ; Computer Science - Databases
Subject code	006
Publishing date	2019-01-29
Publishing country	us
Document type	Book ; Online
Database	BASE - Bielefeld Academic Search Engine (life sciences selection)

Full text online

Full text

Inter-library loan at ZB MED

Your chosen title can be delivered directly to ZB MED Cologne location if you are registered as a user at ZB MED Cologne.

Article ; Online: High body mass index and sleep problems during pregnancy: A meta-analysis and meta-regression of observational studies.

Lau, Ying / Cheng, Ling Jie / Chee, Daniel Guang Hui / Zhao, Menglu / Wong, Sai Ho / Wong, Suei Nee / Tan, Kian Lee

Journal of sleep research

2021 Volume 31, Issue 1, Page(s) e13443

Abstract: Despite the well-established correlation of weight and sleeping problems, little is known about the nature of the association. The present study examined whether pregnant women with high body mass index have a risk of developing sleep problems, and ... ...

Abstract	Despite the well-established correlation of weight and sleeping problems, little is known about the nature of the association. The present study examined whether pregnant women with high body mass index have a risk of developing sleep problems, and identified any covariates that affect this relationship. We systematically searched electronic databases, specialized journals, various clinical trial registries, grey literature databases and the reference list of the identified studies. All observational studies were obtained from inception until 9 August 2020. The Newcastle-Ottawa Scale was adopted to assess the quality of studies. Stata software was used to conduct meta-analysis and meta-regression. Forty-six observational studies involving 2,240,804 participants across 16 countries were included. Quality assessment scores ranged from 4 to 10 (median = 6). Meta-analyses revealed that the risk of sleep apnea, habitual snoring, short sleep duration and poor sleep quality is increased in pregnant women with high body mass index, but not for daytime sleepiness, insomnia or restless legs syndrome. Subgroup differences were detected on body mass index between different regions, nature of population, year of publication, age group and study quality. Random-effects meta-regression analyses showed that year and quality of publication were covariates on the relationships between pre-pregnant body mass index and sleep apnea risk. Our review shows that sleep apnea, habitual snoring, short sleep duration and poor sleep quality are important concerns for pregnant women with high body mass index. Developing screening and targeted interventions is recommended to promote efficacious perinatal care.
MeSH term(s)	Body Mass Index ; Female ; Humans ; Pregnancy ; Sleep Apnea Syndromes/epidemiology ; Sleep Quality ; Sleep Wake Disorders/epidemiology ; Snoring/epidemiology
Language	English
Publishing date	2021-07-22
Publishing country	England
Document type	Journal Article ; Meta-Analysis ; Research Support, Non-U.S. Gov't ; Review
ZDB-ID	1122722-9
ISSN	1365-2869 ; 0962-1105
ISSN (online)	1365-2869
ISSN	0962-1105
DOI	10.1111/jsr.13443
Database	MEDical Literature Analysis and Retrieval System OnLINE

Full text online

Accessible to users with ZB MED library card

In stock of ZB MED Cologne/Königswinter

Zs.A 3464: Show issues			Location: Je nach Verfügbarkeit (siehe Angabe bei Bestand) bis Jg. 1994: Bestellungen von Artikeln über das Online-Bestellformular Jg. 1995 - 2021: Lesesall (2.OG) ab Jg. 2022: Lesesaal (EG)
Zs.MO 343: Show issues

Order via subito

This service is chargeable due to the Delivery terms set by subito. Orders including an article and supplementary material will be classified as separate orders. In these cases, fees will be demanded for each order.

Details ▾

Book ; Online: A Fully Dynamic Algorithm for k-Regret Minimizing Sets

Wang, Yanhao / Li, Yuchen / Wong, Raymond Chi-Wing / Tan, Kian-Lee

2020

Abstract: Selecting a small set of representatives from a large database is important in many applications such as multi-criteria decision making, web search, and recommendation. The $k$-regret minimizing set ($k$-RMS) problem was recently proposed for ... ...

Abstract	Selecting a small set of representatives from a large database is important in many applications such as multi-criteria decision making, web search, and recommendation. The $k$-regret minimizing set ($k$-RMS) problem was recently proposed for representative tuple discovery. Specifically, for a large database $P$ of tuples with multiple numerical attributes, the $k$-RMS problem returns a size-$r$ subset $Q$ of $P$ such that, for any possible ranking function, the score of the top-ranked tuple in $Q$ is not much worse than the score of the $k$\textsuperscript{th}-ranked tuple in $P$. Although the $k$-RMS problem has been extensively studied in the literature, existing methods are designed for the static setting and cannot maintain the result efficiently when the database is updated. To address this issue, we propose the first fully-dynamic algorithm for the $k$-RMS problem that can efficiently provide the up-to-date result w.r.t.~any insertion and deletion in the database with a provable guarantee. Experimental results on several real-world and synthetic datasets demonstrate that our algorithm runs up to four orders of magnitude faster than existing $k$-RMS algorithms while returning results of nearly equal quality. Comment: 15 pages, 11 figures; to appear in ICDE 2021
Keywords	Computer Science - Databases ; Computer Science - Data Structures and Algorithms
Subject code	006
Publishing date	2020-05-29
Publishing country	us
Document type	Book ; Online
Database	BASE - Bielefeld Academic Search Engine (life sciences selection)

Full text online

Full text

Inter-library loan at ZB MED

Your chosen title can be delivered directly to ZB MED Cologne location if you are registered as a user at ZB MED Cologne.

Book ; Online: Sense The Physical, Walkthrough The Virtual, Manage The Metaverse

Ooi, Beng Chin / Tan, Kian-Lee / Tung, Anthony / Chen, Gang / Shou, Mike Zheng / Xiao, Xiaokui / Zhang, Meihui

A Data-centric Perspective

2022

Abstract: In the Metaverse, the physical space and the virtual space co-exist, and interact simultaneously. While the physical space is virtually enhanced with information, the virtual space is continuously refreshed with real-time, real-world information. To ... ...

Abstract	In the Metaverse, the physical space and the virtual space co-exist, and interact simultaneously. While the physical space is virtually enhanced with information, the virtual space is continuously refreshed with real-time, real-world information. To allow users to process and manipulate information seamlessly between the real and digital spaces, novel technologies must be developed. These include smart interfaces, new augmented realities, efficient storage and data management and dissemination techniques. In this paper, we first discuss some promising co-space applications. These applications offer experiences and opportunities that neither of the spaces can realize on its own. We then argue that the database community has much to offer to this field. Finally, we present several challenges that we, as a community, can contribute towards managing the Metaverse.
Keywords	Computer Science - Human-Computer Interaction ; Computer Science - Artificial Intelligence ; Computer Science - Computer Vision and Pattern Recognition ; Computer Science - Databases ; Computer Science - Distributed ; Parallel ; and Cluster Computing
Subject code	004
Publishing date	2022-06-14
Publishing country	us
Document type	Book ; Online
Database	BASE - Bielefeld Academic Search Engine (life sciences selection)

Full text online

Full text

Inter-library loan at ZB MED

Your chosen title can be delivered directly to ZB MED Cologne location if you are registered as a user at ZB MED Cologne.

Book ; Online: Transparent Concurrency Control

Zhou, Ningnan / Zhou, Xuan / Tan, Kian-lee / Wang, Shan

Decoupling Concurrency Control from DBMS

2019

Abstract: For performance reasons, conventional DBMSes adopt monolithic architectures. A monolithic design cripples the adaptability of a DBMS, making it difficult to customize, to meet particular requirements of different applications. In this paper, we propose ... ...

Abstract	For performance reasons, conventional DBMSes adopt monolithic architectures. A monolithic design cripples the adaptability of a DBMS, making it difficult to customize, to meet particular requirements of different applications. In this paper, we propose to completely separate the code of concurrency control (CC) from a monolithic DBMS. This allows us to add / remove functionalities or data structures to / from a DBMS easily, without concerning the issues of data consistency. As the separation deprives the concurrency controller of the knowledge about data organization and processing, it may incur severe performance issues. To minimize the performance loss, we devised a two-level CC mechanism. At the operational level, we propose a robust scheduler that guarantees to complete any data operation at a manageable cost. At the transactional level, the scheduler can utilize data semantics to achieve enhanced performance. Extensive experiments were conducted to demonstrate the feasibility and effectiveness of our approach.
Keywords	Computer Science - Databases
Subject code	670
Publishing date	2019-02-01
Publishing country	us
Document type	Book ; Online
Database	BASE - Bielefeld Academic Search Engine (life sciences selection)

Full text online

Full text

Inter-library loan at ZB MED

Your chosen title can be delivered directly to ZB MED Cologne location if you are registered as a user at ZB MED Cologne.

Book ; Online: Efficient Sampling Algorithms for Approximate Temporal Motif Counting (Extended Version)

Wang, Jingjing / Wang, Yanhao / Jiang, Wenjun / Li, Yuchen / Tan, Kian-Lee

2020

Abstract: A great variety of complex systems ranging from user interactions in communication networks to transactions in financial markets can be modeled as temporal graphs, which consist of a set of vertices and a series of timestamped and directed edges. ... ...

Abstract	A great variety of complex systems ranging from user interactions in communication networks to transactions in financial markets can be modeled as temporal graphs, which consist of a set of vertices and a series of timestamped and directed edges. Temporal motifs in temporal graphs are generalized from subgraph patterns in static graphs which take into account edge orderings and durations in addition to structures. Counting the number of occurrences of temporal motifs is a fundamental problem for temporal network analysis. However, existing methods either cannot support temporal motifs or suffer from performance issues. In this paper, we focus on approximate temporal motif counting via random sampling. We first propose a generic edge sampling (ES) algorithm for estimating the number of instances of any temporal motif. Furthermore, we devise an improved EWS algorithm that hybridizes edge sampling with wedge sampling for counting temporal motifs with 3 vertices and 3 edges. We provide comprehensive analyses of the theoretical bounds and complexities of our proposed algorithms. Finally, we conduct extensive experiments on several real-world datasets, and the results show that our ES and EWS algorithms have higher efficiency, better accuracy, and greater scalability than the state-of-the-art sampling method for temporal motif counting. Comment: 17 pages, 9 figures, to appear in CIKM 2020
Keywords	Computer Science - Social and Information Networks ; Computer Science - Data Structures and Algorithms ; Computer Science - Machine Learning
Subject code	006
Publishing date	2020-07-28
Publishing country	us
Document type	Book ; Online
Database	BASE - Bielefeld Academic Search Engine (life sciences selection)

Full text online

Full text

Inter-library loan at ZB MED

Your chosen title can be delivered directly to ZB MED Cologne location if you are registered as a user at ZB MED Cologne.

Book ; Online: Enhancing Balanced Graph Edge Partition with Effective Local Search

Guo, Zhenyu / Xiao, Mingyu / Zhou, Yi / Zhang, Dongxiang / Tan, Kian-Lee

2020

Abstract: Graph partition is a key component to achieve workload balance and reduce job completion time in parallel graph processing systems. Among the various partition strategies, edge partition has demonstrated more promising performance in power-law graphs ... ...

Abstract	Graph partition is a key component to achieve workload balance and reduce job completion time in parallel graph processing systems. Among the various partition strategies, edge partition has demonstrated more promising performance in power-law graphs than vertex partition and thereby has been more widely adopted as the default partition strategy by existing graph systems. The graph edge partition problem, which is to split the edge set into multiple balanced parts to minimize the total number of copied vertices, has been widely studied from the view of optimization and algorithms. In this paper, we study local search algorithms for this problem to further improve the partition results from existing methods. More specifically, we propose two novel concepts, namely adjustable edges and blocks. Based on these, we develop a greedy heuristic as well as an improved search algorithm utilizing the property of the max-flow model. To evaluate the performance of our algorithms, we first provide adequate theoretical analysis in terms of the approximation quality. We significantly improve the previously known approximation ratio for this problem. Then we conduct extensive experiments on a large number of benchmark datasets and state-of-the-art edge partition strategies. The results show that our proposed local search framework can further improve the quality of graph partition by a wide margin. Comment: To appear in AAAI 2021
Keywords	Computer Science - Data Structures and Algorithms ; Computer Science - Artificial Intelligence
Subject code	006
Publishing date	2020-12-17
Publishing country	us
Document type	Book ; Online
Database	BASE - Bielefeld Academic Search Engine (life sciences selection)

Full text online

Full text

Inter-library loan at ZB MED

Your chosen title can be delivered directly to ZB MED Cologne location if you are registered as a user at ZB MED Cologne.

Book ; Conference proceedings: Special issue on mobile and wireless data management

Tan, Kian-Lee

[nine papers, four of which are extended versions of the best papers presented at the Third International Conference on Mobile Data Management (MDM'02) and the other five are selected from submissions to an open call for papers]

(Mobile networks & applications ; 8.2003,4)

2003

Institution	International Conference on Mobile Data Management
Event/congress	International Conference on Mobile Data Management (3, 2002, Singapore) ; MDM (3, 2002, Singapore)
Author's details	guest ed.: Kian-Lee Tan
Series title	Mobile networks & applications ; 8.2003,4
Language	English
Size	S. 309 - 476, Ill., graph. Darst
Publisher	Kluwer Acad. Publ
Publishing place	Dordrecht u.a.
Document type	Book ; Conference proceedings
Note	Die Vorlage enth. insgesamt 2 Werke ; Literaturangaben
Database	Library catalogue of the German National Library of Science and Technology (TIB), Hannover

Inter-library loan at ZB MED

Your chosen title can be delivered directly to ZB MED Cologne location if you are registered as a user at ZB MED Cologne.

Details ▾

Book ; Online: Database Meets Deep Learning

Wang, Wei / Zhang, Meihui / Chen, Gang / Jagadish, H. V. / Ooi, Beng Chin / Tan, Kian-Lee

Challenges and Opportunities

2019

Abstract: Deep learning has recently become very popular on account of its incredible success in many complex data-driven applications, such as image classification and speech recognition. The database community has worked on data-driven applications for many ... ...

Abstract	Deep learning has recently become very popular on account of its incredible success in many complex data-driven applications, such as image classification and speech recognition. The database community has worked on data-driven applications for many years, and therefore should be playing a lead role in supporting this new wave. However, databases and deep learning are different in terms of both techniques and applications. In this paper, we discuss research problems at the intersection of the two fields. In particular, we discuss possible improvements for deep learning systems from a database perspective, and analyze database applications that may benefit from deep learning techniques. Comment: The previous version of this paper has appeared in SIGMOD Record. In this version, we extend it to include the recent developments in this field and references to recent work
Keywords	Computer Science - Databases ; Computer Science - Distributed ; Parallel ; and Cluster Computing ; Computer Science - Machine Learning
Subject code	004
Publishing date	2019-06-21
Publishing country	us
Document type	Book ; Online
Database	BASE - Bielefeld Academic Search Engine (life sciences selection)

Full text online

Full text

Inter-library loan at ZB MED

Your chosen title can be delivered directly to ZB MED Cologne location if you are registered as a user at ZB MED Cologne.

To top

Full text online

More links

Kategorien

Inter-library loan at ZB MED

Full text online

More links

Kategorien

Inter-library loan at ZB MED

Full text online

More links

Kategorien

In stock of ZB MED Cologne/Königswinter

Order via subito

Full text online

More links

Kategorien

Inter-library loan at ZB MED

Full text online

More links

Kategorien

Inter-library loan at ZB MED

Full text online

More links

Kategorien

Inter-library loan at ZB MED

Full text online

More links

Kategorien

Inter-library loan at ZB MED

Full text online

More links

Kategorien

Inter-library loan at ZB MED

More links

Kategorien

Inter-library loan at ZB MED

Full text online

More links

Kategorien

Inter-library loan at ZB MED