Showing 4 open source projects for "ming"

View related business solutions
  • Earn up to 16% annual interest with Nexo. Icon
    Earn up to 16% annual interest with Nexo.

    More flexibility. More control.

    Generate interest, access liquidity without selling, and execute trades seamlessly. All in one platform. Geographic restrictions, eligibility, and terms apply.
    Get started with Nexo.
  • $300 Free Credits to Build on Google Cloud Icon
    $300 Free Credits to Build on Google Cloud

    New to Google Cloud? Get $300 in credits to explore Compute Engine, BigQuery, Cloud Run, Gemini Enterprise Agent Platform, and more.

    Start your next project with $300 in free Google Cloud credit. Spin up VMs, run containers, query petabytes in BigQuery, or build agents with Gemini Enterprise Agent Platform. Once your credits are used, keep building with 20+ always-free tier products including Compute Engine, Cloud Storage, GKE, and Cloud Run functions. No commitment required—just sign up and start building.
    Claim $300 Free
  • 1
    Isolation Similarity

    Isolation Similarity

    aNNE similarity based on Isolation Kernel

    ...https://ojs.aaai.org//index.php/AAAI/article/view/4402 Bibtex format: @inproceedings{qin2019nearest, title={Nearest-neighbour-induced isolation similarity and its impact on density-based clustering}, author={Qin, Xiaoyu and Ting, Kai Ming and Zhu, Ye and Lee, Vincent CS}, booktitle={Proceedings of the AAAI Conference on Artificial Intelligence}, volume={33}, pages={4755--4762}, year={2019} }
    Downloads: 0 This Week
    Last Update:
    See Project
  • 2
    Distance Scaling

    Distance Scaling

    A Distance Scaling Method to Improve Density-Based Clustering

    These functions implement a distance scaling method, proposed by Ye Zhu, Kai Ming Ting, and Maia Angelova, "A Distance Scaling Method to Improve Density-Based Clustering", in PAKDD2018 proceedings: https://doi.org/10.1007/978-3-319-93040-4_31.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 3
    Clustering by Shared Subspaces

    Clustering by Shared Subspaces

    Grouping Points by Shared Subspaces for Effective Subspace Clustering

    These functions implement a subspace clustering algorithm, proposed by Ye Zhu, Kai Ming Ting, and Mark J. Carman: "Grouping Points by Shared Subspaces for Effective Subspace Clustering", Published in Pattern Recognition Journal at https://doi.org/10.1016/j.patcog.2018.05.027
    Downloads: 0 This Week
    Last Update:
    See Project
  • 4
    Isolation Forest detects data-anomalies using binary trees. Platform: R (www.r-project.org) Reference: Fei Tony Liu, Kai Ming Ting, and Zhi-Hua Zhou, “Isolation Forest”, IEEE International Conference on Data Mining 2008 (ICDM 08)
    Downloads: 1 This Week
    Last Update:
    See Project
  • Our Free Plans just got better! | Auth0 Icon
    Our Free Plans just got better! | Auth0

    With up to 25k MAUs and unlimited Okta connections, our Free Plan lets you focus on what you do best—building great apps.

    You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
    Try free now
  • Previous
  • You're on page 1
  • Next
Auth0 Logo