2009 |
31 | EE | Ian Davidson,
S. S. Ravi:
Using instance-level constraints in agglomerative hierarchical clustering: theoretical and empirical results.
Data Min. Knowl. Discov. 18(2): 257-282 (2009) |
2008 |
30 | EE | Ian Davidson,
Zijie Qi:
Finding Alternative Clusterings Using Constraints.
ICDM 2008: 773-778 |
2007 |
29 | EE | Ian Davidson,
S. S. Ravi:
Intractability and clustering with constraints.
ICML 2007: 201-208 |
28 | EE | Ian Davidson,
S. S. Ravi,
Martin Ester:
Efficient incremental constrained clustering.
KDD 2007: 240-249 |
27 | EE | Rong Ge,
Martin Ester,
Wen Jin,
Ian Davidson:
Constraint-driven clustering.
KDD 2007: 320-329 |
26 | EE | Wei Fan,
Ian Davidson:
On Sample Selection Bias and Its Efficient Correction via Model Averaging and Unlabeled Examples.
SDM 2007 |
25 | EE | Ian Davidson,
S. S. Ravi:
The complexity of non-hierarchical clustering with instance and cluster level constraints.
Data Min. Knowl. Discov. 14(1): 25-61 (2007) |
24 | EE | Xingquan Zhu,
Taghi M. Khoshgoftaar,
Ian Davidson,
Shichao Zhang:
Editorial: Special issue on mining low-quality data.
Knowl. Inf. Syst. 11(2): 131-136 (2007) |
2006 |
23 | | Ian Davidson,
S. S. Ravi:
Identifying and Generating Easy Sets of Constraints for Clustering.
AAAI 2006 |
22 | | Kiri Wagstaff,
Sugato Basu,
Ian Davidson:
When Is Constrained Clustering Beneficial, and Why?.
AAAI 2006 |
21 | EE | Kun Zhang,
Wei Fan,
Xiaojing Yuan,
Ian Davidson,
Xiangshang Li:
Forecasting Skewed Biased Stochastic Ozone Days: Analyses and Solutions.
ICDM 2006: 753-764 |
20 | EE | Wei Fan,
Ian Davidson:
Reverse testing: an efficient framework to select amongst classifiers under sample selection bias.
KDD 2006: 147-156 |
19 | EE | Ian Davidson,
Kiri Wagstaff,
Sugato Basu:
Measuring Constraint-Set Utility for Partitional Clustering Algorithms.
PKDD 2006: 115-126 |
18 | EE | Ian Davidson,
Wei Fan:
When Efficient Model Averaging Out-Performs Boosting and Bagging.
PKDD 2006: 478-486 |
2005 |
17 | | Minoo Aminian,
Ian Davidson:
Active Learning with Partially Labeled Data via Bias Reduction.
FLAIRS Conference 2005: 810-811 |
16 | EE | Wei Fan,
Ian Davidson,
Bianca Zadrozny,
Philip S. Yu:
An Improved Categorization of Classifier's Sensitivity on Sample Selection Bias.
ICDM 2005: 605-608 |
15 | EE | Ashwin Satyanarayana,
Ian Davidson:
A Dynamic Adaptive Sampling Algorithm (DASA) for Real World Applications: Finger Print Recognition and Face Recognition.
ISMIS 2005: 631-640 |
14 | EE | Ian Davidson,
S. S. Ravi:
Agglomerative Hierarchical Clustering with Constraints: Theoretical and Empirical Results.
PKDD 2005: 59-70 |
13 | | Ian Davidson,
S. S. Ravi:
Clustering with Constraints: Feasibility Issues and the k-Means Algorithm.
SDM 2005 |
2004 |
12 | | Ian Davidson:
An Ensemble Technique for Stable Learners with Performance Bounds.
AAAI 2004: 330-335 |
11 | EE | Ke Yin,
Ian Davidson:
Bayesian Model Averaging Across Model Spaces via Compact Encoding.
AMAI 2004 |
10 | EE | Ian Davidson,
Minoo Aminian:
Using the Central Limit Theorem for Belief Network Learning.
AMAI 2004 |
9 | EE | Ke Yin,
Ian Davidson:
An Information Theoretic Optimal Classifier for Semi-supervised Learning.
IDEAL 2004: 740-745 |
8 | EE | Ian Davidson,
Goutam Paul:
Locating secret messages in images.
KDD 2004: 545-550 |
7 | EE | Ian Davidson,
Ashish Grover,
Ashwin Satyanarayana,
Giri Kumar Tayi:
A general approach to incorporate data quality matrices into data mining algorithms.
KDD 2004: 794-798 |
6 | EE | Ke Yin,
Ian Davidson:
Further Applications of a Particle Visualization Framework.
PAKDD 2004: 704-710 |
2003 |
5 | | George Berg,
Ian Davidson,
Ming-Yuan Duan,
Goutam Paul:
Searching for Hidden Messages: Automatic Detection of Steganography.
IAAI 2003: 51-56 |
2002 |
4 | EE | Ian Davidson:
Visualizing Clustering Results.
SDM 2002 |
2000 |
3 | EE | Ian Davidson:
Minimum Message Length Clustering Using Gibbs Sampling.
UAI 2000: 160-167 |
1996 |
2 | | Arkadi Kosmynin,
Ian Davidson:
Using Background Contextual Knowledge for Document Representation.
PODP 1996: 123-133 |
1985 |
1 | EE | Ian Davidson:
Testing conformance to OSI standards.
Computer Communications 8(4): 170-179 (1985) |