Skip to main content

and
  1. No Access

    Chapter and Conference Paper

    Constrained Clustering via Post-processing

    Constrained clustering has received much attention since its inception as the ability to add weak supervision into clustering has many uses. Most existing work is algorithm-specific, limited to simple together...

    Nguyen-Viet-Dung Nghiem, Christel Vrain, Thi-Bich-Hanh Dao in Discovery Science (2020)

  2. No Access

    Chapter and Conference Paper

    Keyless Steganography in Spatial Domain Using Energetic Pixels

    Steganography is the field of hiding messages in apparently innocuous media (e.g. images). Hiding messages in the pixel intensities of images is a popular approach in spatial domain steganography. However, sin...

    Goutam Paul, Ian Davidson, Imon Mukherjee, S. S. Ravi in Information Systems Security (2012)

  3. Chapter and Conference Paper

    When Efficient Model Averaging Out-Performs Boosting and Bagging

    The Bayes optimal classifier (BOC) is an ensemble technique used extensively in the statistics literature. However, compared to other ensemble techniques such as bagging and boosting, BOC is less known and rar...

    Ian Davidson, Wei Fan in Knowledge Discovery in Databases: PKDD 2006 (2006)

  4. Chapter and Conference Paper

    Measuring Constraint-Set Utility for Partitional Clustering Algorithms

    Clustering with constraints is an active area of machine learning and data mining research. Previous empirical work has convincingly shown that adding constraints to clustering improves performance, with respe...

    Ian Davidson, Kiri L. Wagstaff, Sugato Basu in Knowledge Discovery in Databases: PKDD 2006 (2006)

  5. No Access

    Chapter and Conference Paper

    A Dynamic Adaptive Sampling Algorithm (DASA) for Real World Applications: Finger Print Recognition and Face Recognition

    In many real world problems, data mining algorithms have access to massive amounts of data (defense and security). Mining all the available data is prohibitive due to computational (time and memory) constraint...

    Ashwin Satyanarayana, Ian Davidson in Foundations of Intelligent Systems (2005)

  6. Chapter and Conference Paper

    Agglomerative Hierarchical Clustering with Constraints: Theoretical and Empirical Results

    We explore the use of instance and cluster-level constraints with agglomerative hierarchical clustering. Though previous work has illustrated the benefits of using constraints for non-hierarchical clustering, ...

    Ian Davidson, S. S. Ravi in Knowledge Discovery in Databases: PKDD 2005 (2005)

  7. No Access

    Chapter and Conference Paper

    An Information Theoretic Optimal Classifier for Semi-supervised Learning

    Model uncertainty refers to the risk associated with basing prediction on only one model. In semi-supervised learning, this uncertainty is greater than in supervised learning (for the same total number of inst...

    Ke Yin, Ian Davidson in Intelligent Data Engineering and Automated Learning – IDEAL 2004 (2004)

  8. No Access

    Chapter and Conference Paper

    Further Applications of a Particle Visualization Framework

    Previous work introduced a 3D particle visualization framework that viewed each data point as a particle affected by gravitational forces. We showed the use of this tool for visualizing cluster results and ano...

    Ke Yin, Ian Davidson in Advances in Knowledge Discovery and Data Mining (2004)