default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCrystal Maung
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[c12]Guihong Wan, Crystal Maung, Chenxu Zhang, Haim Schweitzer:
Fast Distance Metrics in Low-dimensional Space for Neighbor Search Problems. ICDM 2020: 1304-1309
2010 – 2019
- 2019
- [c11]Baokun He, Swair Shah, Crystal Maung, Gordon Arnold, Guihong Wan, Haim Schweitzer:
Heuristic Search Algorithm for Dimensionality Reduction Optimally Combining Feature Selection and Feature Extraction. AAAI 2019: 2280-2287 - [c10]Guihong Wan, Crystal Maung, Haim Schweitzer:
Improving the Accuracy of Principal Component Analysis by the Maximum Entropy Method. ICTAI 2019: 808-815 - [i1]Guihong Wan, Crystal Maung, Haim Schweitzer:
Improving the Accuracy of Principal Component Analysis by the Maximum Entropy Method. CoRR abs/1907.11094 (2019) - 2018
- [j3]Swair Shah, Baokun He, Crystal Maung, Haim Schweitzer:
Computing Robust Principal Components by A* Search. Int. J. Artif. Intell. Tools 27(7): 1860013:1-1860013:19 (2018) - [j2]Ke Xu, Crystal Maung, Hiromasa Arai, Haim Schweitzer:
Two-Stage Feature Selection with Unsupervised Second Stage. Int. J. Artif. Intell. Tools 27(7): 1860014:1-1860014:18 (2018) - [c9]Swair Shah, Baokun He, Ke Xu, Crystal Maung, Haim Schweitzer:
Solving Generalized Column Subset Selection With Heuristic Search. AAAI 2018: 8153-8154 - 2017
- [c8]Ke Xu, Tongyi Cao, Swair Shah, Crystal Maung, Haim Schweitzer:
Cleaning the Null Space: A Privacy Mechanism for Predictors. AAAI 2017: 2789-2795 - [c7]Ke Xu, Swair Shah, Tongyi Cao, Crystal Maung, Haim Schweitzer:
Enhancing the Privacy of Predictors. AAAI 2017: 5009-5010 - [c6]Ke Xu, Hiromasa Arai, Crystal Maung, Haim Schweitzer:
Two-Stage Feature Selection with Unsupervised Second Stage. ICTAI 2017: 153-159 - [c5]Swair Shah, Baokun He, Crystal Maung, Haim Schweitzer:
Computing Robust Principal Components by A* Search. ICTAI 2017: 1042-1049 - 2016
- [c4]Hiromasa Arai, Crystal Maung, Ke Xu, Haim Schweitzer:
Unsupervised Feature Selection by Heuristic Search with Provable Bounds on Suboptimality. AAAI 2016: 666-672 - [c3]Hiromasa Arai, Ke Xu, Crystal Maung, Haim Schweitzer:
Weighted A* Algorithms for Unsupervised Feature Selection with Provable Bounds on Suboptimality. AAAI 2016: 4194-4195 - 2015
- [j1]Crystal Maung, Haim Schweitzer:
Improved Greedy Algorithms for Sparse Approximation of a Matrix in Terms of Another Matrix. IEEE Trans. Knowl. Data Eng. 27(3): 769-780 (2015) - [c2]Hiromasa Arai, Crystal Maung, Haim Schweitzer:
Optimal Column Subset Selection by A-Star Search. AAAI 2015: 1079-1085 - 2013
- [c1]Crystal Maung, Haim Schweitzer:
Pass-efficient unsupervised feature selection. NIPS 2013: 1628-1636
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
