Pith. sign in

REVIEW 3 major objections 5 minor 300 references

Class-Aware Reinforcement Learning for Counterfactual Explanation Generation

T0 review · 3 major / 5 minor · reviewed 2026-07-31 · deepseek-v4-flash

Pith's one-line read This paper argues that including the instance's predicted class in the reinforcement-learning state representation makes counterfactual explanation generation faster, higher-reward, and more often valid.

desk verdict A genuinely useful empirical observation about RL state design for CFE, but the main claim needs a control for added input dimension before it's fully convincing. read the letter →

arxiv 2607.27905 v1 pith:WKZJW3GW submitted 2026-07-30 cs.LG cs.AI

classification cs.LGcs.AI
keywords counterfactualexplanationsreinforcementlearningclass-awarestatePPOSHAPLIMEtabulardatavalidity
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

Counterfactual explanations (CFEs) are 'what would need to change' instances that flip a black-box model's prediction, and this paper studies how to generate them with reinforcement learning. Its central claim is that adding the instance's predicted class to the RL state—alongside the usual feature values—improves the search. Across seven tabular datasets, the class-aware policy converged faster, reached higher terminal rewards, produced shorter episodes, and generated significantly more valid CFEs than a class-blind policy identical except for the missing class input. The paper also reports that the class feature ranks among the most influential inputs to the policy's action choices according to SHAP and LIME. If correct, this offers a simple, zero-cost change to many RL-based CFE systems: use a prediction that is already available.

What carries the argument

The load-bearing object is the MDP state used by a Proximal Policy Optimization agent (a standard clipped policy-gradient method). The state is the vector of transformed feature values plus one extra immutable entry: the predicted class of the current instance from the black-box classifier. Actions are single-feature increments or decrements chosen from a set of size twice the number of mutable features; transitions are deterministic and terminal rewards are computed only at episode end as +10 for a valid flip, minus penalties for sparsity and cosine-distance proximity, with a -1 timeout penalty. This state design is what carries the argument: it gives the policy a direct, always-up-to-date

What would settle it

Train the class-blind policy with an extra immutable state entry filled with a random or constant dummy value, keeping input dimension and network capacity the same. If this dummy-feature policy matches the class-aware policy's convergence and validity, the causal role of class-awareness is refuted; if it performs like the original class-blind policy, the class content matters.

Watch

Extended reading notes

Core claim

The discovery the paper aims to establish is that class-awareness is not just neutral but beneficial: a reinforcement-learning agent that observes the current predicted class of the instance it is editing becomes a better counterfactual generator. The authors set up counterfactual generation as an episodic Markov decision process in which an agent changes one feature at a time until the black-box model's prediction flips, with terminal rewards for validity, sparsity, and proximity. The proposed class-aware state representation appends the model's prediction for the current state to the other features; the class-blind baseline is the same formulation without that input. On seven tabular datas

Load-bearing premise

The assumption that carries the paper is that the improvement comes from the class information itself; the experiments do not control for the extra input dimension, and because the class is a deterministic function of the other features, the added state entry provides no new information.

Editorial extensions

If this is right

  • RL-based CFE systems can incorporate the predicted class at zero additional data-collection cost, since the prediction is already computed for the instance.
  • Higher validity and shorter episodes mean faster, more reliable recourse generation for large tabular datasets and production black-box models.
  • The observed gains in both training convergence and test-time validity suggest class-awareness may help in other RL search tasks where a goal condition is cheaply computable.
  • Feature-importance analyses of RL policies should include the class input when it is present; otherwise they will miss a consistently top-ranked driver of action selection.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Because the predicted class is a deterministic function of the other features, the class-aware state carries no new information in the information-theoretic sense; the benefit likely comes from making the goal condition directly visible and from the extra input dimension, so a dummy-feature control would separate these explanations.
  • A testable extension: train class-aware policies and then distill them into class-blind policies of the same architecture; if the distilled policies keep the validity gain, the class input matters only during learning and can be removed at deployment.
  • The same recipe—append the current model prediction to the state—could transfer to image or text counterfactual generation, where an agent editing pixels or tokens could similarly benefit from a direct 'am I done yet?' signal, though the paper does not test this.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 5 minor

Summary. The manuscript proposes adding the predicted class label of the input instance to the state representation of a PPO-based reinforcement learning agent that generates counterfactual explanations (CFEs) for a black-box classifier. The method is compared with a class-blind variant on seven tabular datasets. The authors report faster convergence, higher rewards, shorter episodes, and significantly higher CFE validity for the class-aware variant (p=0.0071), and use SHAP and LIME to show that the class feature is among the most important in the policy's action selection. The paper claims that class-awareness causally improves CFE search.

Significance. The proposed modification is simple and easy to adopt, and RL-based CFE is an active area; demonstrating a reliable benefit from including the predicted class would be a useful practical contribution. The paper's strengths include public datasets, provided code, and a significance test for the validity difference. However, the central causal claim is currently not established because the design confounds the semantic content of the class with an additional input dimension and policy capacity, and the convergence claims are not statistically tested.

major comments (3)
  1. [Sections 3.1–3.3 and 5.2] The design misses a dummy-feature control. The class-aware state includes one extra input dimension, so the PPO policy has a larger first layer. Since the predicted class is a deterministic function of the other features (given the trained XGBoost model), it carries no additional information; the observed improvements in validity, reward, and episode length could be due to the extra capacity or to a generic beneficial effect of an extra input. To attribute the effect to 'class-awareness', the authors should add a control with a random/dummy feature of the same scale, or match capacity (e.g., an extra unused input in class-blind). Without this, the core conclusion is unidentified.
  2. [Section 5.1] Convergence claims are not statistically supported. Figure 4 shows only mean curves from 10 runs; no confidence intervals, significance tests, or quantitative definitions of 'faster convergence' are provided. The statements that class-aware converges faster in some datasets and slower in Adult Income are based on visual inspection. The authors should report time-to-threshold or final reward/episode differences with confidence intervals and a paired test across seeds.
  3. [Section 5.3] The SHAP/LIME analysis is used as confirming evidence, but it cannot distinguish semantic benefit from the general use of a state feature. A feature that is always present and immutable will naturally be used by the policy, especially in the terminal reward condition. The fact that LIME does not rank 'Prediction' in the top 5 for two datasets also weakens the 'consistently among the top features' claim. This evidence does not address the confound raised in the previous comment.
minor comments (5)
  1. [Table 3] A column for the proposed method would make the comparison easier; currently the class-aware results are in Table 2, so the reader must cross-reference.
  2. [Table 2] Typo in the heading: 'validaity' should be 'validity'.
  3. [Sections 1, 2, 5.3] The text contains the encoding artifact "instance?s" (e.g., in the Introduction and Section 5.3). Please fix.
  4. [Section 4] The sentence "the predicted class-based feature was excluded when computing these measures" is important for understanding the reported sparsity/proximity values; state this earlier and ensure the class-blind evaluation also excludes the same feature.
  5. [Section 3.4] Use consistent notation for the test set: D_ts vs \bar{D}^{ts}.

Circularity Check

0 steps flagged · score 0.0 of 10

No circular derivation: the class-aware RL comparison is an independent empirical experiment; the missing dummy-feature control is a confound, not a circularity.

full rationale

The paper's central claim is an empirical A/B comparison between two PPO-based RL agents that differ only in whether the predicted class is included in the state representation. The policy is trained and then evaluated on held-out test instances against a class-blind baseline and external benchmarks (DiCE, ReLAX). The predicted class feature is computed by the already-trained classifier M and is not a parameter fitted to the measured validity/reward outcomes, so no 'prediction' is an input by construction. The SHAP/LIME analysis (Sec. 5.3) shows that the learned policy attends to the class feature it was given; this is corroborative rather than a derivation of the improvement, and it does not reduce the central comparison. The paper's genuine weakness—that the class-aware state has an extra input dimension and therefore more first-layer parameters, while the predicted class is a deterministic function of the other features—is an experimental confound undermining causal attribution, not a case of the paper deriving its conclusion from its own inputs. No load-bearing self-citation or imported uniqueness theorem was found; the only self-citation (Williams 2021) is a definitional aside. The result is therefore self-contained and non-circular.

Assumptions & free parameters 4 free parameters · 3 assumptions · 0 invented entities

No new entities are postulated. The free parameters are mostly shared across arms; the main uncontrolled variable is the extra input dimension in the class-aware state, which is not a fitted parameter but a design confound.

free parameters (4)
  • scalar action step sizes = ±0.01 for four datasets, ±0.1 for others
    Chosen 'based on preliminary experimentation' (Sec 4); affects achievable sparsity and proximity, though the same for both arms.
  • reward weights = +10 validity, -1*(1-sparsity), -1*(1-proximity), -1 timeout
    Hand-chosen weights; validity dominates, which the authors themselves note explains sparsity/proximity dips for some datasets (Sec 5.2).
  • feature resolution = 0.01
    Min-max scaled values rounded to two decimals; selected as a trade-off between learning speed and proximity (Sec 3).
  • PPO and XGBoost hyperparameters = PPO defaults; XGBoost 200 estimators, lr 0.05, fine-tuned max depth/positive weight
    Selected based on initial experimentation (Sec 4); not varied across the central comparison.
assumptions (3)
  • domain assumption XGBoost's predicted class is an adequate black-box oracle for CFE validity.
    All validity, sparsity, and proximity metrics are defined relative to this model (Sec 3, Sec 4).
  • domain assumption Binary classification (with one-vs-all for Penicillin) captures the CFE setup.
    The methodology restricts to binary class flips; multi-class problems are folded into one-vs-all (Sec 3).
  • domain assumption SHAP and LIME feature importance meaningfully describe the learned RL policy's action selection.
    Used to infer that the class feature matters in decisions (Sec 3.6); interpreting a stochastic policy with post-hoc explainers is itself an assumption.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Class-Aware Reinforcement Learning for Counterfactual Explanation Generation." pith.science (2026). https://pith.science/paper/WKZJW3GW

@misc{pith2026260727905,
  author       = {Pith},
  title        = {Pith review of: Class-Aware Reinforcement Learning for Counterfactual Explanation Generation},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/WKZJW3GW}},
  note         = {Machine review of arXiv:2607.27905}
}
read the original abstract

Counterfactual explanations (CFEs) enhance the interpretability of black-box models by generating alternative instances with adjusted feature values that achieve a contrastive outcome. Reinforcement learning (RL) offers a promising approach for CFE generation, enabling efficient exploration of counterfactual instances while ensuring control over key metrics like validity, sparsity, and proximity. Previous studies have formulated RL states exclusively using features derived from the predictors in the supervised dataset. This study explores the impact of including an instance's predicted class, alongside features derived from the predictors, in the RL state representation for generating CFEs. The hypothesis is that class-awareness enhances exploration efficiency and improves policy optimality. We compare the proposed class-aware RL method with the class-blind RL method, which is similar but excludes the instance's class information from the state representation. The comparison was conducted using seven datasets from diverse domains, varying in size. The results show that during training, class-aware RL offers benefits in terms of convergence speed, reward optimization, and episode length reduction. Moreover, it generates significantly more valid CFEs compared to class-blind RL. Finally, the instance's class-based feature consistently ranks among the most influential predictors in RL's action-selection, as shown by the SHAP and LIME values, underscoring the significance of class-awareness in RL for CFE generation. The impact is heightened clarity, faster learning, improved validity, and more effective counterfactual generation across diverse datasets.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

300 extracted references · 25 canonical work pages

  1. [1]

    AI and Ethics , volume=

    Fair counterfactual explanation: application to education , author=. AI and Ethics , volume=. 2026 , publisher=

  2. [2]

    The Journal of Supercomputing , volume=

    Interpretable multimodal emotion recognition using optimized transformer model with SHAP-based transparency , author=. The Journal of Supercomputing , volume=. 2025 , publisher=

  3. [3]

    Explainable and Responsible Artificial Intelligence in Healthcare , pages=

    Explainable Artificial Intelligence Technique in Deep Learning--Based Medical Image Analysis , author=. Explainable and Responsible Artificial Intelligence in Healthcare , pages=. 2025 , publisher=

  4. [4]

    Computational and Structural Biotechnology Journal , year=

    Demystifying the black box: A survey on explainable artificial intelligence (XAI) in bioinformatics , author=. Computational and Structural Biotechnology Journal , year=

  5. [5]

    Neural Processing Letters , volume=

    Recent emerging techniques in explainable artificial intelligence to enhance the interpretable and understanding of AI models for human , author=. Neural Processing Letters , volume=. 2025 , publisher=

  6. [6]

    ACM Computing Surveys , volume=

    A survey of explainable artificial intelligence (XAI) in financial time series forecasting , author=. ACM Computing Surveys , volume=. 2025 , publisher=

  7. [7]

    IEEE Access , year=

    A Literature review on applications of explainable artificial intelligence (XAI) , author=. IEEE Access , year=

  8. [8]

    Healthcare , volume=

    Explainable AI in clinical decision support systems: a meta-analysis of methods, applications, and usability challenges , author=. Healthcare , volume=. 2025 , organization=

Show all 300 references
  1. [9]

    Joint European Conference on Machine Learning and Knowledge Discovery in Databases , pages=

    VCNet: A self-explaining model for realistic counterfactual generation , author=. Joint European Conference on Machine Learning and Knowledge Discovery in Databases , pages=. 2022 , organization=

  2. [10]

    Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining , pages=

    Counternet: End-to-end training of prediction aware counterfactual explanations , author=. Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining , pages=

  3. [11]

    Mittelstadt and Chris Russell , title =

    Sandra Wachter and Brent D. Mittelstadt and Chris Russell , title =. CoRR , volume =. 2017 , url =. 1711.00399 , timestamp =

  4. [12]

    IEEE Access , volume=

    Counterfactual explanation of AI models using an adaptive genetic algorithm with embedded feature weights , author=. IEEE Access , volume=. 2024 , publisher=

  5. [13]

    Proceedings of the AAAI/ACM Conference on AI, Ethics, and Society , pages=

    Certifai: A common framework to provide explanations and analyse the fairness and robustness of black-box models , author=. Proceedings of the AAAI/ACM Conference on AI, Ethics, and Society , pages=

  6. [14]

    IEEE Robotics and Automation Letters , volume=

    Safe-rl: Saliency-aware counterfactual explainer for deep reinforcement learning policies , author=. IEEE Robotics and Automation Letters , volume=. 2024 , publisher=

  7. [15]

    ACM Computing Surveys , volume=

    Redefining counterfactual explanations for reinforcement learning: Overview, challenges and opportunities , author=. ACM Computing Surveys , volume=. 2024 , publisher=

  8. [16]

    Proceedings of the IEEE/CVF international conference on computer vision , pages=

    Human trajectory prediction via counterfactual analysis , author=. Proceedings of the IEEE/CVF international conference on computer vision , pages=

  9. [17]

    IEEE Transactions on Engineering Management , volume=

    Explainable artificial intelligence: Counterfactual explanations for risk-based decision-making in construction , author=. IEEE Transactions on Engineering Management , volume=. 2024 , publisher=

  10. [18]

    IEEE Transactions on Intelligent Transportation Systems , volume=

    SVCE: Shapley value guided counterfactual explanation for machine learning-based autonomous driving , author=. IEEE Transactions on Intelligent Transportation Systems , volume=. 2024 , publisher=

  11. [19]

    International Conference on Discovery Science , pages=

    Ensemble Counterfactual Explanations for Churn Analysis , author=. International Conference on Discovery Science , pages=. 2024 , organization=

  12. [20]

    Proceedings of the ICCBR XCBR , volume=

    Counterfactual Explanation of a Classification Model for Detecting SQL Injection Attacks , author=. Proceedings of the ICCBR XCBR , volume=

  13. [21]

    Journal of Theoretical and Applied Electronic Commerce Research , volume=

    Customer-Centric Decision-Making with XAI and Counterfactual Explanations for Churn Mitigation , author=. Journal of Theoretical and Applied Electronic Commerce Research , volume=. 2025 , publisher=

  14. [22]

    Proceedings of the 2023 6th International Conference on Big Data Technologies , pages=

    Counterfactual learning in customer churn prediction under class imbalance , author=. Proceedings of the 2023 6th International Conference on Big Data Technologies , pages=

  15. [23]

    IEEE Access , volume=

    Model-agnostic counterfactual explanations in credit scoring , author=. IEEE Access , volume=. 2022 , publisher=

  16. [24]

    IEEE Access , year=

    Counterfactual explanations with multiple properties in credit scoring , author=. IEEE Access , year=

  17. [25]

    arXiv preprint arXiv:2008.10138 , year=

    Permuteattack: Counterfactual explanation of machine learning credit scorecards , author=. arXiv preprint arXiv:2008.10138 , year=

  18. [26]

    arXiv preprint arXiv:1811.05245 , year=

    Interpretable credit application predictions with counterfactual explanations , author=. arXiv preprint arXiv:1811.05245 , year=

  19. [27]

    Expert Systems with Applications , volume=

    Feature-weighted counterfactual-based explanation for bankruptcy prediction , author=. Expert Systems with Applications , volume=. 2023 , publisher=

  20. [28]

    arXiv preprint arXiv:2405.00456 , year=

    Counterfactual explanations for deep learning-based traffic forecasting , author=. arXiv preprint arXiv:2405.00456 , year=

  21. [29]

    Data Mining and Knowledge Discovery , author =

    Counterfactual explanations as interventions in latent space , volume =. Data Mining and Knowledge Discovery , author =. 2024 , pages =. doi:10.1007/s10618-022-00889-2 , language =

  22. [30]

    Proceedings of the 5th

    Panagiotou, Emmanouil and Heurich, Manuel and Landgraf, Tim and Ntoutsi, Eirini , month = nov, year =. Proceedings of the 5th. doi:10.1145/3677052.3698673 , language =

  23. [31]

    Provably

    Jiang, Junqi and Lan, Jianglin and Leofante, Francesco and Rago, Antonio and Toni, Francesca , month = feb, year =. Provably. Proceedings of the 15th

  24. [32]

    Data Mining and Knowledge Discovery , volume=

    Counterfactual explanations and how to find them: literature review and benchmarking , author=. Data Mining and Knowledge Discovery , volume=. 2024 , publisher=

  25. [33]

    ACM Computing Surveys , author =

    Counterfactual. ACM Computing Surveys , author =. 2024 , pages =. doi:10.1145/3677119 , abstract =

  26. [34]

    Data mining and knowledge discovery , volume=

    Nice: an algorithm for nearest instance counterfactual explanations , author=. Data mining and knowledge discovery , volume=. 2024 , publisher=

  27. [35]

    Proceedings of the 2020 conference on fairness, accountability, and transparency , pages=

    Explaining machine learning classifiers through diverse counterfactual explanations , author=. Proceedings of the 2020 conference on fairness, accountability, and transparency , pages=

  28. [36]

    Management Review Quarterly , volume=

    Applications of explainable artificial intelligence in finance—a systematic review of finance, information systems, and computer science literature , author=. Management Review Quarterly , volume=. 2024 , publisher=

  29. [37]

    IEEE Access , volume=

    Explainable AI for healthcare 5.0: opportunities and challenges , author=. IEEE Access , volume=. 2022 , publisher=

  30. [38]

    Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining , series =

    Chen, Tianqi and Guestrin, Carlos , title =. Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining , series =. 2016 , isbn =. doi:10.1145/2939672.2939785 , acmid =

  31. [39]

    Database Tuning Advisor for Microsoft

    Agrawal, Sanjay and Chaudhuri, Surajit and Koll. Database Tuning Advisor for Microsoft. 2005 , pages =

  32. [40]

    2008 , pages =

    Measures of. 2008 , pages =

  33. [41]

    2009 , month = apr, pages =

  34. [42]

    Web Document Clustering Based on a New Niching

    Cobos, Carlos and Montealegre, Claudia and Mejia, Maria-Fernanda and Mendoza, Martha and Leon, Elizabeth , year =. Web Document Clustering Based on a New Niching

  35. [43]

    Eades, Peter and Neto, Candido Ferreira Xavier de Mendon. Vertex. Graph. 1995 , series =

  36. [44]

    Sparse Subspace Clustering , booktitle =

    Elhamifar, Ehsan and Vidal, Ren. Sparse Subspace Clustering , booktitle =. 2009 , pages =

  37. [45]

    Enslen, Eric and Hill, Emily and Pollock, Lori L. and. Mining Source Code to Automatically Split Identifiers for Software Analysis , booktitle =. 2009 , pages =

  38. [46]

    Modularity-

    G. Modularity-. 2010 , pages =

  39. [47]

    A Genetic Word Clustering Algorithm , booktitle =

    Hernandez, German and Bobadilla, Leonardo and Sanchez, Oscar , year =. A Genetic Word Clustering Algorithm , booktitle =

  40. [48]

    Jacquemin, Christian and Folch, Helka and Nugier, Sylvaine , year =

  41. [49]

    , year =

    Jones, Steve and Staveley, Mark S. , year =. Phrasier:

  42. [50]

    Li, Jianyu and Yang, Shuzhong , editor =. Visual. Intelligent. 2006 , series =

  43. [51]

    Graph Connectivity in Sparse Subspace Clustering , booktitle =

    Nasihatkon, Behrooz and Hartley, Richard , year =. Graph Connectivity in Sparse Subspace Clustering , booktitle =

  44. [52]

    2007 , pages =

    Combining. 2007 , pages =

  45. [53]

    Visual Exploration of Program Structure, Dependencies and Metrics with

    Reniers, Dennie and Voinea, Lucian and Telea, Alexandru , year =. Visual Exploration of Program Structure, Dependencies and Metrics with

  46. [54]

    and Ersoy, Ozan and Reniers, Dennie , year =

    Telea, Alexandru and Hoogendorp, H. and Ersoy, Ozan and Reniers, Dennie , year =. Extraction and Visualization of Call Dependencies for Large

  47. [55]

    Usui, Shiro and Naud, Antoine and Ueda, Naonori and Taniguchi, Tatsuki , year =

  48. [56]

    and Butz, Cory J

    Yao, Hong and Hamilton, Howard J. and Butz, Cory J. , year =

  49. [57]

    Evaluating the

    Zaidi, Faraz and Archambault, Daniel and Melan. Evaluating the. Advances in. 2010 , pages =

  50. [58]

    and Xiao, Weimin , year =

    Zhao, Kaidi and Liu, Bing and Tirpak, Thomas M. and Xiao, Weimin , year =. A

  51. [59]

    and Rao, Jun and Lightstone, Sam and Lohman, Guy M

    Zilio, Daniel C. and Rao, Jun and Lightstone, Sam and Lohman, Guy M. and Storm, Adam J. and. 2004 , pages =

  52. [60]

    Towards Validating Social Network Simulations , booktitle =

    Abbas, Syed Muhammad Ali and Alam, Shah Jamal and Edmonds, Bruce , year =. Towards Validating Social Network Simulations , booktitle =

  53. [61]

    and Korn, J

    Abello, J. and Korn, J. , year =. IEEE Trans. Visualization and Computer Graphics , volume =

  54. [62]

    and Korn, J

    Abello, J. and Korn, J. and Finocchi, I. , year =. Graph. Proc

  55. [63]

    Antecedents and

    Acar, Adam , year =. Antecedents and. Journal of Website Promotion , volume =

  56. [64]

    Frank and Buchwald, Lynne S

    Ackerman, A. Frank and Buchwald, Lynne S. and Lewski, Frank H. , year =. Software. IEEE Software , volume =

  57. [65]

    , year =

    Adamic, Lada A. , year =. The. Proceedings of the

  58. [66]

    and Glance, Natalie , year =

    Adamic, Lada A. and Glance, Natalie , year =. The Political Blogosphere and the 2004

  59. [67]

    A Dynamic Social Network Software Platform for Counter-Terrorism Decision Support , booktitle =

    Adler, Richard M , year =. A Dynamic Social Network Software Platform for Counter-Terrorism Decision Support , booktitle =

  60. [68]

    and Mustafa, Nabil H

    Agarwal, Pankaj K. and Mustafa, Nabil H. , year =. K-Means Projective Clustering , booktitle =. doi:10.1145/1055558.1055581 , abstract =

  61. [69]

    and Coello, C.A.C

    Aguirre, A.H. and Coello, C.A.C. , year =. Mutual Information-Based Fitness Functions for Evolutionary Circuit Synthesis , booktitle =. doi:10.1109/CEC.2004.1331048 , abstract =

  62. [70]

    2006 , journal =

    A Comprehensive Survey of Numeric and Symbolic Outlier Mining Techniques , author =. 2006 , journal =

  63. [71]

    2011 , month = may, journal =

    A K-Means Type Clustering Algorithm for Subspace Clustering of Mixed Numeric and Categorical Datasets , author =. 2011 , month = may, journal =. doi:10.1016/j.patrec.2011.02.017 , abstract =

  64. [72]

    2007 , journal =

    A K-Mean Clustering Algorithm for Mixed Numeric and Categorical Data , author =. 2007 , journal =. doi:10.1016/j.datak.2007.03.016 , abstract =

  65. [73]

    2010 , journal =

    Link Communities Reveal Multiscale Complexity in Networks , author =. 2010 , journal =

  66. [74]

    Analysis of Topological Characteristics of Huge Online Social Networking Services , booktitle =

    Ahn, Yong-Yeol and Han, Seungyeop and Kwak, Haewoon and Moon, Sue and Jeong, Hawoong , year =. Analysis of Topological Characteristics of Huge Online Social Networking Services , booktitle =

  67. [75]

    2000 , journal =

    A Random Graph Model for Power Law Graphs , author =. 2000 , journal =

  68. [76]

    Aiello, William and Chung, Fan R. K. and Lu, Linyuan , year =. Random

  69. [77]

    2008 , journal =

    Tracking the Ends: A Dynamic Protein Network Controls the Fate of Microtubule Tips , author =. 2008 , journal =

  70. [78]

    Error and

    Albert, R. Error and. 2000 , journal =

  71. [79]

    Power and

    Alderson, Arthur S and Beckfield, Jason , year =. Power and. American Journal of sociology , volume =

  72. [80]

    Intercity

    Alderson, Arthur S and Beckfield, Jason and. Intercity. 2010 , journal =

  73. [81]

    , year =

    Alderson, David and Li, Lun and Willinger, Walter and Doyle, John C. , year =. Understanding. IEEE ACM Transactions on Networking , volume =

  74. [82]

    Fundamentals of

    Alexander, Charles and Sadiku, Matthew , year =. Fundamentals of

  75. [83]

    2005 , journal =

    Strategies for the Diffusion of Innovations on Social Networks , author =. 2005 , journal =

  76. [84]

    , year =

    Allis, Victor L. , year =. Searching for

  77. [85]

    and Kulkarni, R

    Almaas, E. and Kulkarni, R. V. and Stroud, D. , year =. Characterizing the. Physical Review Letters,American Physical Society , volume =

  78. [86]

    Towards a

    Almeida, H. Towards a. 2012 , journal =

  79. [87]

    Is There a Best Quality Metric for Graph Clusters? , booktitle =

    Almeida, H. Is There a Best Quality Metric for Graph Clusters? , booktitle =. 2011 , pages =

  80. [88]

    2013 , journal =

    Scale-Free Homophilic Network , author =. 2013 , journal =

  81. [89]

    Clustering and Exploring Search Results Using Timeline Constructions , booktitle =

    Alonso, Omar and Gertz, Michael and. Clustering and Exploring Search Results Using Timeline Constructions , booktitle =. 2009 , pages =. doi:http://doi.acm.org/10.1145/1645953.1645968 , abstract =

  82. [90]

    1995 , journal =

    Recent Directions in Netlist Partitioning: A Survey , author =. 1995 , journal =. doi:http://dx.doi.org/10.1016/0167-9260(95)00008-4 , abstract =

  83. [91]

    An Efficient K-Means Clustering Algorithm , booktitle =

    Alsabti, Khaled and Ranka, Sanjay and Singh, Vineet , year =. An Efficient K-Means Clustering Algorithm , booktitle =

  84. [92]

    2006 , pages =

    Large Scale Networks Fingerprinting and Visualization Using the K-Core Decomposition , booktitle =. 2006 , pages =

  85. [93]

    2006 , journal =

    K-Core Decomposition: A Tool for the Visualization of Large Scale Networks , author =. 2006 , journal =

  86. [94]

    2000 , journal =

    Classes of Small-World Networks , author =. 2000 , journal =. doi:10.1073/pnas.200327197 , abstract =

  87. [95]

    Influence and Correlation in Social Networks , booktitle =

    Anagnostopoulos, Aris and Kumar, Ravi and Mahdian, Mohammad , year =. Influence and Correlation in Social Networks , booktitle =

  88. [96]

    Ankerst, Mihael and Kao, Anne and Tjoelker, Rodney and Wang, Changzhou , editor =. Visual. 2008 , series =

  89. [97]

    , year =

    Ansoff, Igor H. , year =. Managing. California Management Review , volume =

  90. [98]

    and Eick, Stephen G

    Antis, Jacqueline M. and Eick, Stephen G. and Pyrce, John D. , year =. Visualizing the. IEEE Softw. , volume =. doi:10.1109/52.476288 , abstract =

  91. [99]

    A Study of Information Diffusion over a Realistic Social Network Model , booktitle =

    Apolloni, Andrea and Channakeshava, Karthik and Durbeck, Lisa and Khan, Maleq and Kuhlman, Chris and Lewis, Bryan and Swarup, Samarth , year =. A Study of Information Diffusion over a Realistic Social Network Model , booktitle =

  92. [100]

    Archambault, Daniel and Munzner, Tamara and Auber, David , year =. Grouse:

  93. [101]

    2004 , journal =

    Web Mining: A Survey in the Fuzzy Framework , author =. 2004 , journal =

  94. [102]

    Predicting the Future with Social Media , booktitle =

    Asur, Sitaram and Huberman, Bernardo A , year =. Predicting the Future with Social Media , booktitle =

  95. [103]

    Auber, David , editor =. Tulip -. Graph. 2003 , series =

  96. [104]

    and Chiricota, Y

    Auber, D. and Chiricota, Y. and Jourdan, F. and Melancon, G. , year =. Multiscale

  97. [105]

    , year =

    Aula, A. , year =. Enhancing the Readability of Search Result Summaries , booktitle =

  98. [106]

    Auvil, Loretta and Llora, Xavier and Searsmith, Duane and Searsmith, Kellyn , year =. Visual

  99. [107]

    and Melan

    Amiel, M. and Melan. 2005 , journal =

  100. [108]

    Visualizing

    Bach, Benjamin and Pietriga, Emmanuel and Liccardi, Ilaria , year =. Visualizing. International Journal On Semantic Web and Information Systems (IJSWIS) , volume =

  101. [109]

    Bachmaier, Christian , year =. A. IEEE Trans. Vis. Comput. Graph , volume =

  102. [110]

    1981 , journal =

    A Clustering Performance Measure Based on Fuzzy Set Decomposition , author =. 1981 , journal =

  103. [111]

    and Harshman, Richard A

    Bader, Brett W. and Harshman, Richard A. and Kolda, Tamara G. , abstract =. Temporal

  104. [112]

    2003 , journal =

    An Automated Method for Finding Molecular Complexes in Large Protein Interaction Networks , author =. 2003 , journal =. doi:10.1186/1471-2105-4-2 , abstract =

  105. [113]

    2010 , journal =

    A Spatial Approach to Network Generation for Three Properties: Degree Distribution, Clustering Coefficient and Degree Assortativity , author =. 2010 , journal =

  106. [114]

    Outlier Detection Using Centrality and Center-Proximity , booktitle =

    Bae, Duck-Ho and Jeong, Seo and Kim, Sang-Wook and Lee, Minsoo , year =. Outlier Detection Using Centrality and Center-Proximity , booktitle =

  107. [115]

    2013 , journal =

    Enriched Spatial Comparison of Clusterings through Discovery of Deviating Subspaces , author =. 2013 , journal =

  108. [116]

    2010 , journal =

    A Clustering Comparison Measure Using Density Profiles and Its Application to the Discovery of Alternate Clusterings , author =. 2010 , journal =

  109. [117]

    and Mardaneh, Karim , year =

    Bagirov, Adil M. and Mardaneh, Karim , year =. Modified Global K-Means Algorithm for Clustering in Gene Expression Data Sets , booktitle =

  110. [118]

    2011 , month = apr, journal =

    Fast Modified Global K-Means Algorithm for Incremental Cluster Construction , author =. 2011 , month = apr, journal =. doi:10.1016/j.patcog.2010.10.018 , abstract =

  111. [119]

    Social Influence and the Diffusion of User-Created Content , booktitle =

    Bakshy, Eytan and Karrer, Brian and Adamic, Lada A , year =. Social Influence and the Diffusion of User-Created Content , booktitle =

  112. [120]

    The Role of Social Networks in Information Diffusion , booktitle =

    Bakshy, Eytan and Rosenn, Itamar and Marlow, Cameron and Adamic, Lada , year =. The Role of Social Networks in Information Diffusion , booktitle =

  113. [121]

    Balanyi, Zsolt and Ferenc, Rudolf , year =. Mining. In

  114. [122]

    Baluja, Shumeet and Davies, Scott , year =. Using

  115. [123]

    1999 , journal =

    Emergence of Scaling in Random Networks , author =. 1999 , journal =

  116. [124]

    Barab. Linked:. 2002 , month = may, edition =

  117. [125]

    2000 , journal =

    Scale-Free Characteristics of Random Networks: The Topology of the World-Wide Web , author =. 2000 , journal =

  118. [126]

    A Survey of Fuzzy Clustering Algorithms for Pattern Recognition

    Baraldi, Andrea and Blonda, Palma , year =. A Survey of Fuzzy Clustering Algorithms for Pattern Recognition. IEEE Transactions on Systems, Man, and Cybernetics, Part B , volume =

  119. [127]

    1984 , journal =

    Outliers in Statistical Data , author =. 1984 , journal =

  120. [128]

    2004 , month = mar, journal =

    The Architecture of Complex Weighted Networks , author =. 2004 , month = mar, journal =. doi:http://dx.doi.org/10.1073/pnas.0400087101 , abstract =

  121. [129]

    2004 , journal =

    Modeling the Evolution of Weighted Networks , author =. 2004 , journal =

  122. [130]

    2013 , journal =

    Modeling Temporal Networks Using Random Itineraries , author =. 2013 , journal =

  123. [131]

    2000 , journal =

    On the Properties of Small-World Network Models , author =. 2000 , journal =

  124. [132]

    2013 , journal =

    Analyzing Connectivity in Collective Transportation Line Networks by Means of Hypergraphs , author =. 2013 , journal =

  125. [133]

    2011 , journal =

    Spatial Networks , author =. 2011 , journal =. doi:http://dx.doi.org/10.1016/j.physrep.2010.11.002 , abstract =

  126. [134]

    2011 , journal =

    Percolation in Networks Composed of Connectivity and Dependency Links , author =. 2011 , journal =

  127. [135]

    Bastian, Mathieu and Heymann, Sebastien and Jacomy, Mathieu , year =. Gephi:

  128. [136]

    Modeling and

    Basu, Prithwish and. Modeling and. 2010 , journal =

  129. [137]

    , author =

    Pajek Datasets. , author =

  130. [138]

    Computational

    Batagelj, Vladimir and Mrvar, Andrej , year =. Computational

  131. [139]

    Batagelj, Vladimir and Mrvar, Andrej , year =. Pajek -

  132. [140]

    and Zaversnik, M

    Batagelj, V. and Zaversnik, M. , year =. Generalized

  133. [141]

    Visone -

    Baur, Michael and Benkert, Marc and Brandes, Ulrik and Cornelsen, Sabine and Gaertler, Marco and K. Visone -. Proc. 9th. 2002 , pages =

  134. [142]

    Multi-Circular

    Baur, Michael and Brandes, Ulrik , editor =. Multi-Circular. Graph. 2007 , series =

  135. [143]

    and Brandes, U

    Baur, M. and Brandes, U. and Gaertler, M. and Wagner, D. , year =. Drawing the. Proc

  136. [144]

    Generating

    Baur, Michael and Gaertler, Marco and G. Generating. Proceedings of the. 2007 , month = oct, abstract =

  137. [145]

    2007 , journal =

    Efficient Algorithms for Decomposing Graphs under Degree Constraints , author =. 2007 , journal =. doi:10.1016/j.dam.2006.10.005 , abstract =

  138. [146]

    2013 , journal =

    The Role of Hidden Influentials in the Diffusion of Online Information Cascades , author =. 2013 , journal =. doi:10.1140/epjds18 , abstract =

  139. [147]

    1965 , journal =

    An Improved Index of Centrality , author =. 1965 , journal =

  140. [148]

    Attending to the World: Competition, Cooperation and Connectivity in the

    Beaverstock, Jonathan V and Doel, Marcus A and Hubbard, Phil J and Taylor, Peter J , year =. Attending to the World: Competition, Cooperation and Connectivity in the. Global networks , volume =

  141. [149]

    Beck, Fabian and Burch, Michael and Diehl, Stephan and Weiskopf, Daniel , year =. The

  142. [150]

    1998 , journal =

    The Effect of Community Structure on the Immunity Coverage Required to Prevent Epidemics , author =. 1998 , journal =

  143. [151]

    2006 , journal =

    The. 2006 , journal =

  144. [152]

    Characterizing User Behavior in Online Social Networks , booktitle =

    Benevenuto, Fabr. Characterizing User Behavior in Online Social Networks , booktitle =. 2009 , series =. doi:http://doi.acm.org/10.1145/1644893.1644900 , abstract =

  145. [153]

    Bensaid, A. M. and Hall, L. O. and Bezdek, J. C. and Clarke, L. P. and. Validity-. 1996 , journal =

  146. [154]

    2006 , pages =

    A Framework for Analysis of Dynamic Social Networks , booktitle =. 2006 , pages =. doi:http://doi.acm.org/10.1145/1150402.1150462 , abstract =

  147. [155]

    Berkhin, Pavel , year =. Survey

  148. [156]

    , year =

    Bezdek, James C. , year =. Cluster. Cybernetics and Systems , volume =. doi:10.1080/01969727308546047 , abstract =

  149. [157]

    and Barab

    Bianconi, G. and Barab. Competition and. 2001 , journal =

  150. [158]

    Bilgic, Mustafa and Licamele, Louis and Getoor, Lise and Shneiderman, Ben , year =. D-. Visual

  151. [159]

    Topological

    Bilke, Sven and Peterson, Carsten , year =. Topological. Rev. E , volume =

  152. [160]

    2010 , journal =

    Visualization of Network Structure by the Application of Hypernodes , author =. 2010 , journal =. doi:http://dx.doi.org/10.1016/j.ijar.2009.09.003 , abstract =

  153. [161]

    2009 , journal =

    Smooth Graphs for Visual Exploration of Higher-Order State Transitions , author =. 2009 , journal =

  154. [162]

    2008 , month = oct, journal =

    Fast Unfolding of Communities in Large Networks , author =. 2008 , month = oct, journal =. doi:10.1088/1742-5468/2008/10/P10008 , abstract =

  155. [163]

    and Ivanchenko, M

    Boccaletti, S. and Ivanchenko, M. and Latora, V. and Pluchino, A. and Rapisarda, A. , year =. Detection of. Physical Review E , volume =

  156. [164]

    2002 , month = dec, journal =

    Denormalization Guidelines for Base and Transaction Tables , author =. 2002 , month = dec, journal =

  157. [165]

    and Schrage, John F

    Bock, Douglas B. and Schrage, John F. , year =. Benefits of. Proceedings of the

  158. [166]

    2013 , journal =

    Nature of the Epidemic Threshold for the Susceptible-Infected-Susceptible Dynamics in Networks , author =. 2013 , journal =

  159. [167]

    2004 , journal =

    Models of Social Networks Based on Social Distance Attachment , author =. 2004 , journal =

  160. [168]

    Visual Exploration of Function Call Graphs for Feature Location in Complex Software Systems , booktitle =

    Bohnet, Johannes and D. Visual Exploration of Function Call Graphs for Feature Location in Complex Software Systems , booktitle =. 2006 , pages =. doi:10.1145/1148493.1148508 , isbn =

  161. [169]

    2011 , journal =

    Twitter Mood Predicts the Stock Market , author =. 2011 , journal =

  162. [170]

    Mathematical Results on Scale-Free Random Graphs , booktitle =

    Bollob. Mathematical Results on Scale-Free Random Graphs , booktitle =. 2003 , pages =

  163. [171]

    Bollt, Erik M. and. What Is. 2004 , journal =

  164. [172]

    2007 , journal =

    Some Unique Properties of Eigenvector Centrality , author =. 2007 , journal =. doi:http://dx.doi.org/10.1016/j.socnet.2007.04.002 , keywords =

  165. [173]

    Power and Centrality:

    Bonacich, Phillip , year =. Power and Centrality:. American journal of sociology , pages =

  166. [174]

    1972 , journal =

    Factoring and Weighting Approaches to Status Scores and Clique Identification , author =. 1972 , journal =

  167. [175]

    Influence Propagation in Social Networks:

    Bonchi, Francesco , year =. Influence Propagation in Social Networks:. IEEE Intelligent Informatics Bulletin , volume =

  168. [176]

    Effective

    Bonnel, Nicolas and Lemaire, Vincent and Cotarmanac'H, Alexandre and Morin, Annie , year =. Effective. Proceedings of the 24th

  169. [177]

    Hierarchical-

    Bordogna, Gloria and Pasi, Gabriella , year =. Hierarchical-. Web. doi:http://doi.ieeecomputersociety.org/10.1109/WI-IAT.2009.104 , isbn =

  170. [178]

    2009 , journal =

    2-Mode Concepts in Social Network Analysis , author =. 2009 , journal =

  171. [179]

    2009 , month = feb, journal =

    Network Analysis in the Social Sciences , author =. 2009 , month = feb, journal =. doi:10.1126/science.1165821 , abstract =

  172. [180]

    Borgelt, Christian and N. Fast. Proc

  173. [181]

    An Algorithm for Detecting Communities in Folksonomy Hypergraphs , booktitle =

    Bothorel, C. An Algorithm for Detecting Communities in Folksonomy Hypergraphs , booktitle =. 2011 , pages =

  174. [182]

    The Use of Interactive Graphical Maps for Browsing Medical/Health

    Boulos, Maged , year =. The Use of Interactive Graphical Maps for Browsing Medical/Health. International Journal of Health Geographics , volume =. doi:10.1186/1476-072X-2-1 , abstract =

  175. [183]

    Detecting

    Bourqui, Romain and Gilbert, Fr. Detecting. Social. 2009 , pages =. doi:http://doi.ieeecomputersociety.org/10.1109/ASONAM.2009.55 , isbn =

  176. [184]

    and Zaidi, F

    Bourqui, R. and Zaidi, F. and Gilbert, F. and Sharan, U. and Simonetto, P. , year =

  177. [185]

    , year =

    Boyd, Danah and Ellison, Nicole B. , year =. Social. Journal of Computer-Mediated Communication , volume =

  178. [186]

    Bradley, P. S. and Mangasarian, O. L. , year =. K-. J. of Global Optimization , volume =. doi:http://dx.doi.org/10.1023/A:1008324625522 , abstract =

  179. [187]

    Drawing on

    Brandes, Ulrik , editor =. Drawing on. Drawing. 2001 , series =

  180. [188]

    2001 , journal =

    A Faster Algorithm for Betweenness Centrality , author =. 2001 , journal =

  181. [189]

    2003 , journal =

    Visual Unrolling of Network Evolution and the Analysis of Dynamic Discourse? , author =. 2003 , journal =

  182. [190]

    2008 , journal =

    On Modularity Clustering , author =. 2008 , journal =

  183. [191]

    and Erlebach, T

    Brandes, U. and Erlebach, T. , year =. Network

  184. [192]

    Engineering Graph Clustering:

    Brandes, Ulrik and Gaertler, Marco and Wagner, Dorothea , year =. Engineering Graph Clustering:. ACM Journal of Experimental Algorithmics , volume =

  185. [193]

    2011 , journal =

    Visualization Methods for Longitudinal Social Networks and Stochastic Actor-Oriented Modeling , author =. 2011 , journal =. doi:10.1016/j.socnet.2011.06.002 , abstract =

  186. [194]

    2005 , publisher =

    Structural Similarity in Graphs , author =. 2005 , publisher =

  187. [195]

    2006 , journal =

    Multi-Step Density-Based Clustering , author =. 2006 , journal =. doi:http://dx.doi.org/10.1007/s10115-005-0217-6 , abstract =

  188. [196]

    1975 , journal =

    An Algorithm for Clustering Relational Data with Applications to Social Network Analysis and Comparison with Multi-Dimensional Scaling , author =. 1975 , journal =

  189. [197]

    2000 , journal =

    Forgetting of Friends and Its Effects on Measuring Friendship Networks , author =. 2000 , journal =

  190. [198]

    2003 , journal =

    An Investigation of Graph-Based Class Integration Test Order Strategies , author =. 2003 , journal =. doi:10.1109/TSE.2003.1214324 , abstract =

  191. [199]

    2000 , journal =

    Graph Structure in the Web , author =. 2000 , journal =

  192. [200]

    1973 , month = sep, journal =

    Algorithm 457: Finding All Cliques of an Undirected Graph , author =. 1973 , month = sep, journal =

  193. [201]

    1987 , journal =

    Social Ties and Word-of-Mouth Referral Behavior , author =. 1987 , journal =

  194. [202]

    , year =

    Bruls, Mark and Huizing, Kees and van Wijk, Jarke J. , year =. Squarified. Proc

  195. [203]

    2007 , journal =

    Gaining Scale-Free and High Clustering Complex Networks , author =. 2007 , journal =

  196. [204]

    Buchanan, Mark , year =. Nexus:

  197. [205]

    Improving

    Buchheim, Christoph and J. Improving. 2002 , pages =

  198. [206]

    2010 , journal =

    Catastrophic Cascade of Failures in Interdependent Networks , author =. 2010 , journal =

  199. [207]

    2011 , journal =

    Interdependent Networks with Identical Degrees of Mutually Dependent Nodes , author =. 2011 , journal =

  200. [208]

    2001 , journal =

    Statistical Ensemble of Scale-Free Random Graphs , author =. 2001 , journal =

  201. [209]

    , year =

    Burt, Ronald S. , year =. Brokerage and

  202. [210]

    Focus-Based Filtering + Clustering Technique for Power-Law Networks with Small World Phenomenon , booktitle =

    Boutin, Francois and Thievre, J. Focus-Based Filtering + Clustering Technique for Power-Law Networks with Small World Phenomenon , booktitle =. 2006 , volume =

  203. [211]

    , author =

    Scale-Free Networks from Varying Vertex Intrinsic Fitness. , author =. 2002 , month = dec, journal =

  204. [212]

    2001 , month = sep, journal =

    Are Randomly Grown Graphs Really Random? , author =. 2001 , month = sep, journal =. doi:10.1103/PhysRevE.64.041902 , abstract =

  205. [213]

    Network Robustness and Fragility:

    Callaway, Duncan S and Newman, Mark EJ and Strogatz, Steven H and Watts, Duncan J , year =. Network Robustness and Fragility:. Physical Review Letters , volume =

  206. [214]

    , year =

    Cameron, Peter J. , year =. Random. Discrete

  207. [215]

    1986 , journal =

    Social Resources and Socioeconomic Status , author =. 1986 , journal =

  208. [216]

    and Veltri, Pierangelo , year =

    Cannataro, Mario and Guzzi, Pietro H. and Veltri, Pierangelo , year =. Protein-to-Protein Interactions:. ACM Comput. Surv. , volume =. doi:http://doi.acm.org/10.1145/1824795.1824796 , keywords =

  209. [217]

    2006 , journal =

    A Neighbourhood Evolving Network Model , author =. 2006 , journal =. doi:http://dx.doi.org/10.1016/j.physleta.2005.09.047 , abstract =

  210. [218]

    Knowledge

    Carayol, Nicolas and Roux, Pascale , year =. Knowledge. Journal of Economic Behavior & Organization , volume =

  211. [219]

    , editor =

    Carley, Kathleen M. , editor =. Dynamic. 2003 , abstract =

  212. [220]

    2007 , month = aug, journal =

    Toward an Interoperable Dynamic Network Analysis Toolkit , author =. 2007 , month = aug, journal =. doi:10.1016/j.dss.2006.04.003 , abstract =

  213. [221]

    A Survey of

    Carpineto, Claudio and Osi. A Survey of. 2009 , month = jul, journal =. doi:http://doi.acm.org/10.1145/1541880.1541884 , keywords =

  214. [222]

    Meta Clustering , booktitle =

    Caruana, Rich and Elhaway, M and Nguyen, Nam and Smith, Casey , year =. Meta Clustering , booktitle =

  215. [223]

    Caschili, Simone and Medda, Francesca Romana and Wilson, Alan , year =. An. Networks and Spatial Economics , volume =. doi:10.1007/s11067-014-9274-2 , abstract =

  216. [224]

    2004 , journal =

    Assortative Model for Social Networks , author =. 2004 , journal =. doi:10.1103PhysRevE.70.037101 , abstract =

  217. [225]

    Detection of Overlapping Communities in Dynamical Social Networks , booktitle =

    Cazabet, Remy and Amblard, Fr. Detection of Overlapping Communities in Dynamical Social Networks , booktitle =. 2010 , pages =

  218. [226]

    2011 , month = mar, journal =

    Improving the Performance of K-Means for Color Quantization , author =. 2011 , month = mar, journal =. doi:10.1016/j.imavis.2010.10.002 , abstract =

  219. [227]

    and Negri, M

    Ceri, S. and Negri, M. and Pelagatti, G. , year =. Horizontal Data Partitioning in Database Design , booktitle =. doi:10.1145/582353.582376 , isbn =

  220. [228]

    Measuring

    Cha, Meeyoung and Haddadi, Hamed and Benevenuto, Fabricio and Gummadi, P Krishna , year =. Measuring. ICWSM , volume =

  221. [229]

    Chakrabarti, Deepayan and Faloutsos, Christos , year =. Graph. ACM Comput. Surv. , volume =. doi:10.1145/1132952.1132954 , keywords =

  222. [230]

    Anomaly Detection:

    Chandola, Varun and Banerjee, Arindam and Kumar, Vipin , year =. Anomaly Detection:. ACM Computing Surveys (CSUR) , volume =

  223. [231]

    2010 , journal =

    A Robust Dynamic Niching Genetic Algorithm with Niche Migration for Automatic Clustering Problem , author =. 2010 , journal =

  224. [232]

    Combining Concept Hierarchies and Statistical Topic Models , booktitle =

    Chemudugunta, Chaitanya and Smyth, Padhraic and Steyvers, Mark , year =. Combining Concept Hierarchies and Statistical Topic Models , booktitle =. doi:http://doi.acm.org/10.1145/1458082.1458337 , isbn =

  225. [233]

    , year =

    Chen, Peter P. , year =. The. ACM Transactions on Database Systems , volume =

  226. [234]

    2012 , journal =

    Clustering Large Attributed Information Networks: An Efficient Incremental Computing Approach , author =. 2012 , journal =

  227. [235]

    Hierarchical

    Cheng, Qing and Liu, Zhong and Huang, Jincai and Zhu, Cheng and Liu, Yanjun , year =. Hierarchical. Proceedings of the

  228. [236]

    You Are Where You Tweet: A Content-Based Approach to Geo-Locating Twitter Users , booktitle =

    Cheng, Zhiyuan and Caverlee, James and Lee, Kyumin , year =. You Are Where You Tweet: A Content-Based Approach to Geo-Locating Twitter Users , booktitle =

  229. [237]

    Mapping and Visualizing the Internet , booktitle =

    Cheswick, Bill and Burch, Hal and Branigan, Steve , year =. Mapping and Visualizing the Internet , booktitle =

  230. [238]

    and Parthasarathi, Ranjani and Geetha, T

    Chithirapoovishi, S. and Parthasarathi, Ranjani and Geetha, T. V. , year =. A

  231. [239]

    2003 , journal =

    Data Mining on Temporal Data: A Visual Approach and Its Clinical Application to Hemodialysis , author =. 2003 , journal =

  232. [240]

    2010 , journal =

    Correlated Couplings and Robustness of Coupled Networks , author =. 2010 , journal =. 1010.4971 , abstract =

  233. [241]

    2004 , journal =

    Finding Community Structure in Very Large Networks , author =. 2004 , journal =

  234. [242]

    2009 , journal =

    Power-Law Distributions in Empirical Data , author =. 2009 , journal =

  235. [243]

    1971 , number =

    Further Normalization of the Data Base Relational Model , author =. 1971 , number =

  236. [244]

    2001 , journal =

    Breakdown of the Internet under Intentional Attack , author =. 2001 , journal =

  237. [245]

    Resilience of the

    Cohen, Reuven and Erez, Keren and. Resilience of the. 2000 , month = nov, journal =. doi:10.1103/PhysRevLett.85.4626 , abstract =

  238. [246]

    Clustering with

    Cole, Rowena Marie , year =. Clustering with

  239. [247]

    Coleman, J. S. , year =. An

  240. [248]

    Coleman, T. F. and Mor. Estimation of. 1983 , journal =

  241. [249]

    2012 , journal =

    Simultaneous Classification and Community Detection on Heterogeneous Network Data , author =. 2012 , journal =

  242. [250]

    2005 , publisher =

    Network. 2005 , publisher =

  243. [251]

    , year =

    Condon, Anne and Karp, Richard M. , year =. Algorithms for. Random Structures and Algorithms , volume =

  244. [252]

    and Foggia, P

    Conte, D. and Foggia, P. and Sansone, C. and Vento, M. , year =. Thirty. International Journal of Pattern Recognition and Artificial Intelligence , volume =. doi:10.1142/S0218001404003228 , abstract =

  245. [253]

    Multidimensional Networks and the Dynamics of Sociomateriality:

    Contractor, Noshir and Monge, Peter R and Leonardi, Paul , year =. Multidimensional Networks and the Dynamics of Sociomateriality:. International Journal of Communication , volume =

  246. [254]

    Testing Multitheoretical, Multilevel Hypotheses about Organizational Networks:

    Contractor, Noshir S and Wasserman, Stanley and Faust, Katherine , year =. Testing Multitheoretical, Multilevel Hypotheses about Organizational Networks:. Academy of Management Review , volume =

  247. [255]

    and Holder, Lawrence B

    Cook, Diane J. and Holder, Lawrence B. , year =. Graph-. IEEE Intelligent Systems , volume =

  248. [256]

    Cook, S. A. , year =. The. Proc. of the 3rd

  249. [257]

    Cordella, L. P. and Foggia, P. and Sansone, C. and Vento, M. , year =. Fast. Pattern Recognition, International Conference on , volume =. doi:http://doi.ieeecomputersociety.org/10.1109/ICPR.2000.906251 , isbn =

  250. [258]

    and Leiserson, Charles E

    Cormen, Thomas H. and Leiserson, Charles E. and Rivest, Ronald L. and Stein, Clifford , year =. Introduction to

  251. [259]

    Corneil, D. G. and Gotlieb, C. C. , year =. An. Journal of the ACM (JACM) , volume =

  252. [260]

    Costa, L. D. F. and Rodrigues, F. A. and Travieso, G. and Villas Boas, P. R. , year =. Characterization of Complex Networks:. Advances in Physics , volume =. doi:10.1080/00018730601170527 , abstract =

  253. [261]

    Advances in Knowledge Discovery and Data Mining , pages =

    Crabtree, Daniel and Andreae, Peter and Gao, Xiaoying , year =. Advances in Knowledge Discovery and Data Mining , pages =

  254. [262]

    Feedback Effects between Similarity and Social Influence in Online Communities , booktitle =

    Crandall, David and Cosley, Dan and Huttenlocher, Daniel and Kleinberg, Jon and Suri, Siddharth , year =. Feedback Effects between Similarity and Social Influence in Online Communities , booktitle =

  255. [263]

    Random Walks on the Click Graph , booktitle =

    Craswell, Nick and Szummer, Martin , year =. Random Walks on the Click Graph , booktitle =. doi:10.1145/1277741.1277784 , abstract =

  256. [264]

    2012 , journal =

    A Mathematical Model for Networks with Structures in the Mesoscale , author =. 2012 , journal =

  257. [265]

    2010 , journal =

    Hyperstructures, a New Approach to Complex Systems , author =. 2010 , journal =

  258. [266]

    , year =

    Cross, Rob and Parker, Andrew and Borgatti, Stephen P. , year =. A Bird's-Eye View:. Knowledge Directions , volume =

  259. [267]

    2011 , journal =

    Hierarchical Visual Event Pattern Mining and Its Applications , author =. 2011 , journal =

  260. [268]

    and Pedersen, Jan O

    Cutting, Douglass R. and Pedersen, Jan O. and Karger, David and Tukey, John W. , year =. Scatter/. Proceedings of the

  261. [269]

    Mining Coherent Anomaly Collections on Web Data , booktitle =

    Dai, Hanbo and Zhu, Feida and Lim, Ee-Peng and Pang, HweeHwa , year =. Mining Coherent Anomaly Collections on Web Data , booktitle =

  262. [270]

    2005 , journal =

    Comparing Community Structure Identification , author =. 2005 , journal =

  263. [271]

    2006 , journal =

    The Effect of Size Heterogeneity on Community Identification in Complex Networks , author =. 2006 , journal =

  264. [272]

    1997 , month = may, journal =

    Robust Clustering Methods: A Unified View , author =. 1997 , month = may, journal =. doi:10.1109/91.580801 , abstract =

  265. [273]

    Networks,

    David, Easley and Jon, Kleinberg , year =. Networks,

  266. [274]

    and Satyanarayana, A

    Davidson, I. and Satyanarayana, A. , year =. Speeding up. Proc

  267. [275]

    and Carley, Kathleen M

    Davis, George B. and Carley, Kathleen M. , year =. Clearing the. Social Networks , volume =. doi:10.1016/j.socnet.2008.03.001 , abstract =

  268. [276]

    Optimization of

    Dean, Jeffrey and Grove, David and Chambers, Craig , year =. Optimization of

  269. [277]

    Decker, Hendrik and Teniente, Ernest and Urpi, Toni , year =. How to. Proc. 5th

  270. [278]

    2007 , journal =

    Diffusion Dynamics in Small-World Networks with Heterogeneous Consumers , author =. 2007 , journal =

  271. [279]

    , year =

    Deng, Hongbo and King, Irwin and Lyu, Michael R. , year =. Formal. doi:http://dx.doi.org/10.1109/ICDM.2008.29 , abstract =

  272. [280]

    Multiple

    Department, Rajesh Kasturirangan and Kasturirangan, Rajesh , year =. Multiple. Brain and

  273. [281]

    2003 , journal =

    Hierarchical Tendencies and Regional Patterns in the World City Network: A Global Urban Analysis of 234 Cities , author =. 2003 , journal =

  274. [282]

    Pathways of Change:

    Derudder, Ben and Taylor, Peter and Ni, Pengfei and De Vos, Anneleen and Hoyler, Michael and Hanssens, Heidi and Bassens, David and Huang, Jin and Witlox, Frank and Shen, Wei and others , year =. Pathways of Change:. Urban Studies , volume =

  275. [283]

    Interactive Visual Clustering , booktitle =

    DesJardins, Marie and MacGlashan, James and Ferraioli, Julia , year =. Interactive Visual Clustering , booktitle =. doi:http://doi.acm.org/10.1145/1216295.1216367 , abstract =

  276. [284]

    and Barron, Terence M

    Dey, Debabrata and Storey, Veda C. and Barron, Terence M. , year =. Improving. ACM Trans. Database Syst. , volume =

  277. [285]

    , year =

    Dhillon, Inderjit S. , year =. Co-Clustering Documents and Words Using Bipartite Spectral Graph Partitioning , booktitle =. doi:http://doi.acm.org/10.1145/502512.502550 , abstract =

  278. [286]

    and Mallela, Subramanyam and Kumar, Rahul , year =

    Dhillon, Inderjit S. and Mallela, Subramanyam and Kumar, Rahul , year =. Enhanced Word Clustering for Hierarchical Text Classification , booktitle =. doi:http://doi.acm.org/10.1145/775047.775076 , isbn =

  279. [287]

    and Carley, Kathleen M

    Diesner, Jana and Frantz, Terrill L. and Carley, Kathleen M. , year =. Communication. Comput

  280. [288]

    , author =

    A Note on Two Problems in Connexion with Graphs. , author =. 1959 , journal =

  281. [289]

    Ding, Qin and Gasvoda, Jim , year =. A. International Journal of Computational Intelligence , volume =

  282. [290]

    Territorial and

    Discazeaux, Carine and Rozenblat, Celine and Koenig, Pierre-Yves and Melan. Territorial and

  283. [291]

    Dixon, Mark , year =. An

  284. [292]

    Do Nguyen, Quyen , year =. Anomaly

  285. [293]

    and Nexion, Ascom , year =

    Doar, Matthew B. and Nexion, Ascom , year =. A. Global

  286. [294]

    2000 , school =

    Graph. 2000 , school =

  287. [295]

    Van , year =

    Dongen, S. Van , year =. Graph

  288. [296]

    2009 , journal =

    Rapid Data Handling in Flow Cytometric Rare Event Analysis , author =. 2009 , journal =

  289. [297]

    2007 , journal =

    Rare-Event Analysis in Flow Cytometry , author =. 2007 , journal =

  290. [298]

    2000 , journal =

    Exactly Solvable Small-World Network , author =. 2000 , journal =

  291. [299]

    Dorogovtsev, S. N. and Mendes, J. F. F. , year =. Evolution of

  292. [300]

    2000 , journal =

    Evolution of Networks with Aging of Sites , author =. 2000 , journal =

Pith tools

Reviewed July 31, 2026 · model on record in the stance chip above.