2011
DOI: 10.1002/dac.1211
|View full text |Cite
|
Sign up to set email alerts
|

A sliding window‐based false‐negative approach for ubiquitous data stream analysis

Abstract: Ubiquitous data stream mining (UDSM) is the process of performing data analysis on mobile, embedded and ubiquitous devices. In many cases, a large volume of data can be mined for interesting and relevant information in a wide variety of applications. Data stream mining requires computationally intensive mining techniques to be applied in mobile environments constrained by analysis of a real-time single pass with limited computational resources. Therefore, we have to ensure that the result is within the error t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
7
0

Year Published

2013
2013
2014
2014

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(7 citation statements)
references
References 20 publications
0
7
0
Order By: Relevance
“…The quantity T = F + N [s] is defined as period. Similarly to the windowed approach proposed in , a group of n periods T composes the window W = n ⋅ T [s]. The mentioned quantities are shown in Figure .…”
Section: Physical Activity Detectionmentioning
confidence: 99%
“…The quantity T = F + N [s] is defined as period. Similarly to the windowed approach proposed in , a group of n periods T composes the window W = n ⋅ T [s]. The mentioned quantities are shown in Figure .…”
Section: Physical Activity Detectionmentioning
confidence: 99%
“…The default setting of sampling rate is 100 Hz in the app. Therefore we set the width of sliding windows is 1.5 s and 50% overlap []. To cancel the effect of accelerometer orientation, we extract features from two signals based on the transformed accelerometer data: the vertical acceleration, a v ( t ) = a Z ( t ) and the horizontal acceleration magnitude, ah()t=aX2()t+aY2()t.…”
Section: Process Of Activity Recognitionmentioning
confidence: 99%
“…They modeled the multi-hop wireless networks as classic G/G/1 queuing networks. It was observed that data requirements in WMNs are mainly for Internet accesses [20,[23][24][25][26][27][28][29][30][31][32][33][34][35]. Jamieson and Balakrishnan [6] modeled gateway nodes as independent M/D/1 queue stations.…”
Section: Related Workmentioning
confidence: 99%
“…When s is equal to 0, it represents a gateway. Let N(s) denote the number of s-hop nodes, and let r(s) be the ratio between N(s) and N. We have the classic GI/Geom/1 discrete time queue [22][23][24][25][26][27][28][29][30][31][32][33][34][35], and then we insert the strategies of the exhaustive service, with booting procedure and closing procedure; namely users reach the special time as follows: t = n À , n = 0, 1, 2, . .…”
Section: Network Modelmentioning
confidence: 99%