![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Chapter and Conference Paper
Approximate Bit-Vector Algorithms for Hashing-Based Similarity Searches
Similarity search, or finding approximate nearest neighbors, is becoming an increasingly important tool to find the closest matches for a given query object in large scale database. Recently, learning hashing-...
-
Chapter and Conference Paper
A PWF Smoothing Algorithm for K-Sensitive Stream Mining Technologies over Sliding Windows
The development of Streaming Mining technologies as a hotspot entered the limelight, which is more effectively to avoid big data and distributed streams mining problems. Especially for the IoT and Ubiquitous Comp...
-
Chapter and Conference Paper
Using a Real-Time Top-k Algorithm to Mine the Most Frequent Items over Multiple Streams
Some applications such as sensor networks, internet traffic analysis, location-based services, and health measurements are always required for considering unbounded, fast, large-volumes, continuous, even for d...