Travelled to:
1 × Canada
1 × China
1 × Slovenia
12 × USA
Collaborated with:
X.Z.Fern J.G.Dy T.Lane ∅ K.Small B.C.Wallace T.A.Trikalinos Y.Zhou T.M.Stough P.E.Utgoff N.H.Kapadia J.A.B.Fortes J.Hasan A.Jalote T.N.Vijaykumar D.Preston R.Khardon D.Sulla-Menashe M.A.Friedl B.Ahmed T.Thesen K.Blackmon Y.Zhao O.Devinsky R.Kuzniecky
Talks about:
learn (6) cluster (4) select (4) featur (4) comput (4) applic (4) data (4) base (4) approach (3) tree (3)
Person: Carla E. Brodley
DBLP: Brodley:Carla_E=
Facilitated 2 volumes:
Contributed to:
Wrote 18 papers:
- ICML-c2-2014-AhmedTBZDKB #detection #random
- Hierarchical Conditional Random Fields for Outlier Detection: An Application to Detecting Epileptogenic Cortical Malformations (BA, TT, KB, YZ, OD, RK, CEB), pp. 1080–1088.
- ICML-2011-SmallWBT #learning
- The Constrained Weight Space SVM: Learning with Ranked Features (KS, BCW, CEB, TAT), pp. 865–872.
- KDD-2010-PrestonBKSF #clustering #constraints #using
- Redefining class definitions using constraint-based clustering: an application to remote sensing of the earth’s surface (DP, CEB, RK, DSM, MAF), pp. 823–832.
- KDD-2010-WallaceSBT #learning
- Active learning for biomedical citation screening (BCW, KS, CEB, TAT), pp. 173–182.
- HPCA-2005-HasanJVB #smt
- Heat Stroke: Power-Density-Based Denial of Service in SMT (JH, AJ, TNV, CEB), pp. 166–177.
- ICML-2004-FernB #clustering #graph #problem
- Solving cluster ensemble problems by bipartite graph partitioning (XZF, CEB).
- ICML-2003-FernB #lazy evaluation
- Boosting Lazy Decision Trees (XZF, CEB), pp. 178–185.
- ICML-2003-FernB03a #approach #clustering #random
- Random Projection for High Dimensional Data Clustering: A Cluster Ensemble Approach (XZF, CEB), pp. 186–193.
- ICML-2000-DyB #identification #learning #order #set
- Feature Subset Selection and Order Identification for Unsupervised Learning (JGD, CEB), pp. 247–254.
- ICML-2000-LaneB #interface #learning #reduction
- Data Reduction Techniques for Instance-Based Learning from Human/Computer Interface Data (TL, CEB), pp. 519–526.
- KDD-2000-DyB #feature model #interactive #visualisation
- Visualization and interactive feature selection for unsupervised data (JGD, CEB), pp. 360–364.
- HPDC-1999-KapadiaFB #grid #modelling #predict
- Predictive Application-Performance Modeling in a Computational Grid Environment (NHK, JABF, CEB), pp. 47–54.
- ICML-1999-ZhouB #algorithm #approach #hybrid #learning #memory management #parametricity #requirements
- A Hybrid Lazy-Eager Approach to Reducing the Computation and Memory Requirements of Local Parametric Learning Algorithms (YZ, CEB), p. 503–?.
- KDD-1998-LaneB #concept #identification #learning #online #security
- Approaches to Online Learning and Concept Drift for User Identification in Computer Security (TL, CEB), pp. 259–263.
- KDD-1997-StoughB #image #multi #reduction
- Image Feature Reduction through Spoiling: Its Application to Multiple Matched Filters for Focus of Attention (TMS, CEB), pp. 255–258.
- ICML-1995-Brodley #automation
- Automatic Selection of Split Criterion during Tree Growing Based on Node Location (CEB), pp. 73–80.
- ICML-1993-Brodley #automation
- Automatic Algorith/Model Class Selection (CEB), pp. 17–24.
- ML-1990-UtgoffB #incremental #multi
- An Incremental Method for Finding Multivariate Splits for Decision Trees (PEU, CEB), pp. 58–65.