Philip M. Long mainly investigates Discrete mathematics, Combinatorics, Algorithm, Genetics and DNA microarray. His research in the fields of Constant factor overlaps with other disciplines such as Class. The concepts of his Algorithm study are interwoven with issues in Supervised learning, Boosting, Mathematical optimization and AdaBoost.
His work on Basal-like carcinoma as part of general Genetics study is frequently linked to Basal-Like Breast Carcinoma, Estrogen receptor and Breast cancer classification, therefore connecting diverse disciplines of science. His DNA microarray research includes themes of Microarray, Computational biology, Hepatocellular carcinoma and Pathology. He combines subjects such as Hybridization probe, Complementary DNA, In silico and Genomics with his study of Gene expression.
Artificial intelligence, Discrete mathematics, Algorithm, Combinatorics and Machine learning are his primary areas of study. The study of Artificial intelligence is intertwined with the study of Pattern recognition in a number of ways. His Discrete mathematics study integrates concerns from other disciplines, such as Function, Computational learning theory and Constant.
His Constant study combines topics in areas such as Generalization and Lipschitz continuity. In his work, Time complexity is strongly intertwined with Active learning, which is a subfield of Algorithm. His study on Integer is often connected to Sample complexity as part of broader study in Combinatorics.
His scientific interests lie mostly in Algorithm, Gradient descent, Residual, Distribution and Linear map. Philip M. Long has researched Algorithm in several fields, including Generalization, Convolutional neural network, Lipschitz continuity and Constant. His Gradient descent research incorporates elements of Positive-definite matrix, Margin, Linear separability and Applied mathematics.
His work focuses on many connections between Residual and other disciplines, such as Singular value, that overlap with his field of interest in Computation, Normalization, Least squares and Eigenvalues and eigenvectors. His Distribution research integrates issues from Integer and Combinatorics. In his study, Regularization and Quadratic equation is strongly linked to Invariant, which falls under the umbrella field of Combinatorics.
Philip M. Long focuses on Algorithm, Linear map, Residual, Gradient descent and Initialization. Philip M. Long works mostly in the field of Algorithm, limiting it down to topics relating to Dimension and, in certain cases, Statistical learning theory. His Linear map study incorporates themes from Singular value, Normalization and Computation.
His Residual research includes elements of Identity function, Pure mathematics, Identity and Sigmoid function. His studies deal with areas such as Linear separability, Margin, Linear classifier, Fraction and Limit as well as Gradient descent. His Initialization study spans across into fields like Positive-definite matrix, Identity, Algebra, Function and Parameterized complexity.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Breast cancer classification and prognosis based on gene expression profiles from a population-based study
Christos Sotiriou;Soek-Ying Neo;Lisa M McShane;Edward L Korn.
Proceedings of the National Academy of Sciences of the United States of America (2003)
Comparative full-length genome sequence analysis of 14 SARS coronavirus isolates and common mutations associated with putative origins of infection
Yijun Ruan;Chia Lin Wei;Ai Ee Ling;Vinsensius B Vega.
The Lancet (2003)
Comment on “ 'Stemness': Transcriptional Profiling of Embryonic and Adult Stem Cells” and “A Stem Cell Molecular Signature” (I)
Nicolas O. Fortunel;Hasan H. Otu;Huck Hui Ng;Jinhui Chen.
Science (2003)
The Relaxed Online Maximum Margin Algorithm
Yi Li;Philip M. Long.
neural information processing systems (1999)
Random classification noise defeats all convex potential boosters
Philip M. Long;Rocco A. Servedio.
Machine Learning (2010)
Performance guarantees for hierarchical clustering
Sanjoy Dasgupta;Philip M. Long.
conference on learning theory (2002)
Benign overfitting in linear regression
Peter L. Bartlett;Philip M. Long;Gábor Lugosi;Alexander Tsigler.
Proceedings of the National Academy of Sciences of the United States of America (2020)
TRACKING DRIFTING CONCEPTS BY MINIMIZING DISAGREEMENTS
David P. Helmbold;Philip M. Long.
conference on learning theory (1994)
Optimal gene expression analysis by microarrays
Lance D. Miller;Philip M. Long;Philip M. Long;Limsoon Wong;Sayan Mukherjee.
Cancer Cell (2002)
On the difficulty of approximately maximizing agreements
Shai Ben-David;Nadav Eiron;Philip M. Long.
Journal of Computer and System Sciences (2003)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
Columbia University
University of California, Santa Cruz
Google (United States)
University of Mississippi
University of Leoben
Carnegie Mellon University
The Jackson Laboratory
Google (United States)
University of Maryland, College Park
University of Waterloo
MIT
University of California, Riverside
University of St. Gallen
Brookhaven National Laboratory
Durham University
Utrecht University
Spanish National Research Council
University of California, Berkeley
Portland State University
University of Georgia
Technical University of Munich
University of Glasgow
University of Tennessee Health Science Center
Nanoregmed Ltd.
University of Washington
Lawrence Livermore National Laboratory