[{"_1":2,"_98":-5,"_99":-5},"loaderData",{"_3":4,"_13":14},"root",{"_5":6,"_7":8,"_9":10,"_11":12},"isProduction",true,"domain","cran-e.com","version","2.11.0","nonce","ZDA1MjBmY2ItMzAzOC00ZGNlLTk1ZGEtNzcxMzcwYjQ1NGQx","routes/_page.author.$authorName",{"_15":16,"_17":18,"_40":41,"_28":97},"authorName","Thibaut Goetghebuer-Planchon","packages",[19,33],{"_20":21,"_30":31},"package",{"_22":23,"_24":25,"_26":27,"_28":29},"id",3374,"name","MatrixExtra","title","Extra Methods for Sparse Matrices","description","Extends sparse matrix and vector classes from the 'Matrix' package by providing: (a) Methods and operators that work natively on CSR formats (compressed sparse row, a.k.a. 'RsparseMatrix') such as slicing/sub-setting, assignment, rbind(), mathematical operators for CSR and COO such as addition (\"+\") or sqrt(), and methods such as diag(); (b) Multi-threaded matrix multiplication and cross-product for many types, including the 'float32' type from 'float'; (c) Coercion methods between pairs of classes which are not present in 'Matrix', such as 'dgCMatrix' -> 'ngRMatrix', as well as convenience conversion functions; (d) Utility functions for sparse matrices such as sorting the indices or removing zero-valued entries; (e) Fast transposes that work by outputting in the opposite storage format; (f) Faster replacements for many 'Matrix' methods for all sparse types, such as slicing and elementwise multiplication. (g) Convenience functions for sparse objects, such as 'mapSparse' or a shorter 'show' method.","roles",[32],"cph",{"_20":34,"_30":39},{"_22":35,"_24":36,"_26":37,"_28":38},12910,"isotree","Isolation-Based Outlier Detection","Fast and multi-threaded implementation of isolation forest (Liu, Ting, Zhou (2008) <[doi:10.1109/ICDM.2008.17](https://doi.org/10.1109%2FICDM.2008.17)>), extended isolation forest (Hariri, Kind, Brunner (2018) <[doi:10.48550/arXiv.1811.02141](https://doi.org/10.48550/arXiv.1811.02141)>), SCiForest (Liu, Ting, Zhou (2010) <[doi:10.1007/978-3-642-15883-4_18](https://doi.org/10.1007%2F978-3-642-15883-4_18)>), fair-cut forest (Cortes (2021) ), robust random-cut forest (Guha, Mishra, Roy, Schrijvers (2016) <[http://proceedings.mlr.press/v48/guha16.html](http://proceedings.mlr.press/v48/guha16.html)>), and customizable variations of them, for isolation-based outlier detection, clustered outlier detection, distance or similarity approximation (Cortes (2019) <[doi:10.48550/arXiv.1910.12362](https://doi.org/10.48550/arXiv.1910.12362)>), isolation kernel calculation (Ting, Zhu, Zhou (2018) <[doi:10.1145/3219819.3219990](https://doi.org/10.1145%2F3219819.3219990)>), and imputation of missing values (Cortes (2019) <[doi:10.48550/arXiv.1911.06646](https://doi.org/10.48550/arXiv.1911.06646)>), based on random or guided decision tree splitting, and providing different metrics for scoring anomalies based on isolation depth or density (Cortes (2021) <[doi:10.48550/arXiv.2111.11639](https://doi.org/10.48550/arXiv.2111.11639)>). Provides simple heuristics for fitting the model to categorical columns and handling missing data, and offers options for varying between random and guided splits, and for using different splitting criteria.",[32],"otherAuthors",[42,59,63,69,73,76,80,84,87,90,94],{"_22":43,"_24":44,"_45":-5,"_46":-5,"_47":48,"_49":50,"_51":-5,"_52":53,"_54":-5,"_55":-5,"_56":-5,"_57":-5,"_58":53},486,"Martin Maechler","email","extra","orc_id","0000-0002-8685-9910","orc_link","https://orcid.org/0000-0002-8685-9910","github_id","created_at","2024-11-24T20:49:18.832187+00:00","github_link","unknown_link","website_link","linkedin_link","_last_scraped_at",{"_22":60,"_24":61,"_45":-5,"_46":-5,"_47":-5,"_49":-5,"_51":-5,"_52":62,"_54":-5,"_55":-5,"_56":-5,"_57":-5,"_58":62},2620,"David Cortes","2024-11-24T20:49:21.105835+00:00",{"_22":64,"_24":65,"_45":-5,"_46":-5,"_47":66,"_49":67,"_51":-5,"_52":68,"_54":-5,"_55":-5,"_56":-5,"_57":-5,"_58":68},3656,"Dmitry Selivanov","0000-0003-0492-6647","https://orcid.org/0000-0003-0492-6647","2024-11-24T20:49:22.430757+00:00",{"_22":70,"_24":71,"_45":-5,"_46":-5,"_47":-5,"_49":-5,"_51":-5,"_52":72,"_54":-5,"_55":-5,"_56":-5,"_57":-5,"_58":72},12318,"Robert Gentleman","2024-11-24T20:49:28.440999+00:00",{"_22":74,"_24":75,"_45":-5,"_46":-5,"_47":-5,"_49":-5,"_51":-5,"_52":72,"_54":-5,"_55":-5,"_56":-5,"_57":-5,"_58":72},12319,"Ross Ihaka",{"_22":77,"_24":78,"_45":-5,"_46":-5,"_47":-5,"_49":-5,"_51":-5,"_52":79,"_54":-5,"_55":-5,"_56":-5,"_57":-5,"_58":79},15764,"Stephen Moshier","2024-11-24T20:49:30.777716+00:00",{"_22":81,"_24":82,"_45":-5,"_46":-5,"_47":-5,"_49":-5,"_51":-5,"_52":83,"_54":-5,"_55":-5,"_56":-5,"_57":-5,"_58":83},21552,"David Blackman","2024-11-24T20:49:35.03944+00:00",{"_22":85,"_24":86,"_45":-5,"_46":-5,"_47":-5,"_49":-5,"_51":-5,"_52":83,"_54":-5,"_55":-5,"_56":-5,"_57":-5,"_58":83},21553,"Sebastiano Vigna",{"_22":88,"_24":89,"_45":-5,"_46":-5,"_47":-5,"_49":-5,"_51":-5,"_52":83,"_54":-5,"_55":-5,"_56":-5,"_57":-5,"_58":83},21554,"NumPy Developers",{"_22":91,"_24":92,"_45":-5,"_46":-5,"_47":-5,"_49":-5,"_51":-5,"_52":93,"_54":-5,"_55":-5,"_56":-5,"_57":-5,"_58":93},25692,"SciPy Developers","2024-11-24T20:49:37.942926+00:00",{"_22":95,"_24":96,"_45":-5,"_46":-5,"_47":-5,"_49":-5,"_51":-5,"_52":93,"_54":-5,"_55":-5,"_56":-5,"_57":-5,"_58":93},25693,"Enthought Inc","Thibaut Goetghebuer-Planchon has worked on 2 packages so far. Two's company, but it looks like Thibaut Goetghebuer-Planchon is just getting warmed up! Thibaut Goetghebuer-Planchon has worked with 11 other authors. That's a whole squad of coders! It must be like managing a small battalion of creativity and caffeine.","actionData","errors"]

Thibaut Goetghebuer-Planchon

2 Packages

Team