Author of the publication

AnyFI: An anytime frequent itemset mining algorithm for data streams.

, , , and . IEEE BigData, page 942-947. IEEE Computer Society, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Anytime clustering of data streams while handling noise and concept drift., , , , , , and . J. Exp. Theor. Artif. Intell., 34 (3): 399-429 (2022)DD-Rtree: A dynamic distributed data structure for efficient data distribution among cluster nodes for spatial data mining algorithms., , , , , and . IEEE BigData, page 27-36. IEEE Computer Society, (2016)HADCLEAN: A hybrid approach to data cleaning in data warehouses., , , and . CAMP, page 136-142. IEEE, (2012)AnySC: Anytime Set-wise Classification of Variable Speed Data Streams., , , , and . IEEE BigData, page 967-974. IEEE, (2018)"Ït's not like Jarvis✱., , , , and . ACE, page 124-133. ACM, (2024)AnyStreamKM: Anytime k-medoids Clustering for Streaming Data., , , and . IEEE Big Data, page 844-853. IEEE, (2022)An Adaptive Hierarchical Method for Anytime Set-wise Clustering of Variable and High-Speed Data Streams., , , , , and . IEEE Big Data, page 568-577. IEEE, (2023)μDBSCAN: An Exact Scalable DBSCAN Algorithm for Big Data Exploiting Spatial Locality., , , , , , and . CLUSTER, page 1-11. IEEE, (2019)Grid-R-tree: a data structure for efficient neighborhood and nearest neighbor queries in data mining., , , , , and . Int. J. Data Sci. Anal., 10 (1): 25-47 (2020)Parallelizing OPTICS for Commodity Clusters., , , , , , and . ICDCN, page 33:1-33:10. ACM, (2015)