BibSLEIGH — Stan

Travelled to:

1 × Australia
1 × Canada
1 × Estonia
1 × Finland
1 × Italy
1 × Japan
1 × Slovenia
1 × The Netherlands
1 × United Kingdom
10 × USA

Collaborated with:

T.Pietrzykowski S.Lapointe J.Sayyad-Shirabad T.C.Lethbridge J.Su A.P.Felty C.X.Ling É.Alphonse S.Scott M.Kubat A.Ahmad P.Clark G.Fouqué H.Ould-Brahim M.Gick J.Morin K.Forsythe J.S.Shirab G.Dufay J.Genest B.Plante E.Bigdeli M.Mohammadi B.Raahemi H.Zhang I.T.Hernádvölgyi V.Capretta D.W.Aha S.Szpakowicz G.E.Kersten W.Michalowski Z.Koperczak

Talks about:

learn (5) base (5) softwar (4) select (3) induct (3) effici (3) reus (3) mine (3) use (3) implement (2)

Person: Stan Matwin

DBLP: Matwin:Stan

Contributed to:

2014

2011

2008

2005

2003

2002

2001

1999

1997

1994

1993

1992

1991

1990

1989

1987

1984

1982

Wrote 23 papers:

KDIR-2014-BigdeliMRM #clustering #summary: Arbitrary Shape Cluster Summarization with Gaussian Mixture Model (EB, MM, BR, SM), pp. 43–52.
ICML-2011-SuSM #classification #multi #naive bayes #scalability #using: Large Scale Text Classification using Semisupervised Multinomial Naive Bayes (JS, JSS, SM), pp. 97–104.
ICML-2008-SuZLM #learning #network #parametricity: Discriminative parameter learning for Bayesian networks (JS, HZ, CXL, SM), pp. 1016–1023.
CADE-2005-DufayFM #data flow #information management #ml #privacy: Privacy-Sensitive Information Flow with JML (GD, APF, SM), pp. 116–130.
TLCA-2005-MatwinFHC #data mining #formal method #mining #privacy #using: Privacy in Data Mining Using Formal Methods (SM, APF, ITH, VC), pp. 278–292.
ICSM-2003-Sayyad-ShirabadLM #legacy #maintenance #mining: Mining the Maintenance History of a Legacy Software System (JSS, TCL, SM), pp. 95–104.
ICML-2002-AlphonseM #induction #logic programming #set: Feature Subset Selection and Inductive Logic Programming (ÉA, SM), pp. 11–18.
ICSM-2001-ShirabadLM #maintenance #mining: Supporting Software Maintenance by Mining Software Update Records (JSS, TCL, SM), pp. 22–31.
ICML-1999-ScottM #classification #re-engineering: Feature Engineering for Text Classification (SS, SM), pp. 379–388.
ICML-1997-KubatM #set: Addressing the Curse of Imbalanced Training Sets: One-Sided Selection (MK, SM), pp. 179–186.
ICML-1994-AhaLLM #learning #recursion #set: Learning Recursive Relations with Randomly Selected Small Training Sets (DWA, SL, CXL, SM), pp. 12–18.
ICSM-1994-MatwinA #analysis #automation #composition #reuse #using: Reuse of Modular Software with Automated Comment Analysis (SM, AA), pp. 222–231.
ICML-1993-ClarkM #induction #learning #modelling #using: Using Qualitative Models to Guide Inductive Learning (PC, SM), pp. 49–56.
KBSE-1992-FouqueM #automation #named #reuse: Caesar: A System for CAse basEd SoftwAre Reuse (GF, SM), p. 17.
KBSE-1992-MatwinB #database #query #reuse: Reusing Database Queries in Analogical Domains (SM, HOB), p. 16.
ML-1992-LapointeM #induction #named #performance #recursion #source code: Sub-unification: A Tool for Efficient Induction of Recursive Programs (SL, SM), pp. 273–281.
ML-1991-GickM: The Importance of Causal Structure and Facts in Evaluating Explanations (MG, SM), pp. 51–54.
ML-1990-GenestMP #approach #learning: Explanation-Based Learning with Incomplete Theories: A Three-step Approach (JG, SM, BP), pp. 286–294.
ML-1989-MatwinM #learning: Learning Procedural Knowledge in the EBG Context (SM, JM), pp. 197–199.
SLP-1987-MatwinSKMK87 #tool support: A Logic-Based Tools for Negotiation Support (SM, SS, GEK, WM, ZK), pp. 499–506.
CADE-1984-ForsytheM #deduction #implementation: Implementation Strategies for Plan-Based Deduction (KF, SM), pp. 426–444.
CADE-1982-MatwinP #backtracking #data type #exponential #implementation #performance: Exponential Improvement of Efficient Backtracking: data Structure and Implementation (SM, TP), pp. 240–259.
CADE-1982-PietrzykowskiM #backtracking #deduction #exponential #performance: Exponential Improvement of Efficient Backtracking: A Strategy for Plan-Based Deduction (TP, SM), pp. 223–239.