← Search

Data · dataset · 2024

Clustering Based Technique for Outlier detection

Listed in ScienceDB

Certainly!

Description

Here's a description of the provided code:1. **MicroCluster Class**: This class represents a micro-cluster and its properties including `mD` (membership degree), `center` (center coordinates), `radius`, `edge_list` (list of neighboring micro-clusters), and `base_cluster_count` (number of base clusters within the micro-cluster).2. **distance Function**: This function calculates the Euclidean distance between two points in n-dimensional space.3. **update_center_radius Function**: This function updates the center and radius of a micro-cluster after incorporating a new point.4. **initialize_stage Function**: This function implements Algorithm 1 - Initializing Stage.

It takes a new data point `s`, a list of micro-clusters `M_C`, a list of prospective micro-clusters `Pmc`, and radius parameters `RadiusM_N` and `RadiusM`. It updates the micro-cluster membership degrees and adjusts their centers and radii accordingly.5. **core_micro_cluster_formation Function**: This function implements Algorithm 2 - Core Micro-cluster Formation. It iteratively checks for intersecting micro-clusters and updates their edge lists to reflect their adjacency.6. **buffer_deletion Function**: This function implements Algorithm 3 - Buffer Deletion.

Read the rest (2 more)

It clears the list of prospective micro-clusters if it is not empty.7. **save_prospective_micro_clusters Function**: This function implements Algorithm 4 - Saving Prospective Microclusters. It adds outlier micro-clusters from the datastream to the list of prospective micro-clusters.8. **remove_outlier_micro_clusters Function**: This function implements Algorithm 5 - Removing Outlier Microclusters. It removes outlier micro-clusters from memory based on a specified threshold value and updates the edge lists of related core micro-clusters.9. **Usage Example**: This section demonstrates the usage of the implemented algorithms with sample data and parameters.

It initializes data, executes the algorithms sequentially, and prints the resulting micro-cluster configurations after each algorithm execution.Overall, the provided code allows for the initialization, formation, and management of micro-clusters in a data stream mining context. It can be extended and customized for specific applications by adjusting the parameters and incorporating additional algorithms or functionalities.

Links

Where it is published

Catalogue records · 1

Topics

Inferred from text
Machine learning 71%
Provenance · 1 source records, 12 field assertions
SourceKeyLast seenRaw
ScienceDB10.57760/sciencedb.1702011 d agoJSON v1
FieldAssertionExtractorEvidence
access_levelsource · scidb cnconnector:scidb_cn@1.0.0
concepts[field].anzsrc:group:4611enrichment · scidb cntaxonomy-embedding@1.0.0title+keywords+description (71%)
concepts[field].local:field:computer-science-aimapping · scidb cnconnector:scidb_cn@1.0.0
concepts[field].local:field:earth-environmentalmapping · scidb cnconnector:scidb_cn@1.0.0
concepts[field].local:field:engineeringmapping · scidb cnconnector:scidb_cn@1.0.0
concepts[field].local:field:humanitiesmapping · scidb cnconnector:scidb_cn@1.0.0
concepts[field].local:field:life-sciencesmapping · scidb cnconnector:scidb_cn@1.0.0
concepts[field].local:field:social-sciencemapping · scidb cnconnector:scidb_cn@1.0.0
descriptionsource · scidb cnconnector:scidb_cn@1.0.0/metadata/dc/description
license_textsource · scidb cnconnector:scidb_cn@1.0.0
publication_datesource · scidb cnconnector:scidb_cn@1.0.0
titlesource · scidb cnconnector:scidb_cn@1.0.0/metadata/dc/title