{"id":"bc68fa6c-8125-4e91-8b0c-23f175b4aae2","arxiv_id":"1908.06801","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":5.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":1,"one_line_summary":"The paper presents an FP-growth-based algorithm that mines non-redundant discriminative patterns from hybrid symbolic-numeric data using interval items, exhaustive covering, and branch-and-bound pruning.","lead":"This paper describes a new algorithm for finding patterns that separate one class of data from another when the data contains both symbolic and numeric fields. The method extends a known frequent-pattern mining algorithm to handle ranges of numbers directly, and tests it on two standard credit and iris datasets.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Static merge in §3.1 is unsafe: the strict dominance inequality can fail, so removed cut-points can delete the closed best-covering patterns that exhaustive covering promises to output.","rationale":"The reader's conditional verdict was based on the lack of baselines, absent code, and the heuristic nature of the dynamic merge. Our concern is more pointed: the static merge in Section 3.1 has a false strict inequality, so the search-space reduction is not guaranteed lossless. The paper's own exhaustive-covering and closedness-on-positives constraints are violated in a simple four-transaction counterexample. This is not a disagreement with external consensus but an internal correctness gap in the algorithm as described. If confirmed, the paper's central algorithmic claim needs revision; at minimum, the merge must be restricted to cases where the removed interval has nonzero support in every pattern context, or the output guarantee must be weakened. There is no machine-checked proof or shipped code to mitigate the gap, and the reported experiments do not exercise such equality cases. We therefore recommend REJECT rather than CONDITIONAL, because the core reduction can omit patterns the algorithm promises to output.","tokens_in":11853,"tokens_out":14211,"duration_ms":138303,"concrete_test":"Build the four-transaction dataset from the attack and run the prototype with F-score for the positive class, both with and without the Section 3.1 merge enabled. Separately, brute-force enumerate all interval items over the original cut-point set {5,15,25} and compute the closed best-covering patterns. Verify whether the merged run outputs a pattern covering t1 after closedness filtering; the full enumeration should output {S=a, A∈[5,15)}. Also run the same comparison on 100 random small hybrid datasets to confirm that the equality case is not degenerate.","verdict_should_be":"REJECT","load_bearing_attack":"Section 3.1's static merge is not lossless as claimed. The justification asserts that for any pattern x, p(⟨A,[vl,t)⟩∪x | c) < p(⟨A,[vl,v)⟩∪x | c) when t is a cut-point inside a positive-only region [u,v). This is false: the right side differs from the left by p(⟨A,[t,v)⟩∪x | c), which can be 0 whenever the positive transactions whose A-values fall in [t,v) do not also contain x. In that case the specific interval has the same positive and negative support as the merged interval and hence the same F-score, so best-covering does not remove it; the closedness-on-positives constraint actively prefers the specific interval as the most specific representative. Removing the cut-point therefore either deletes the only valid closed best-covering pattern for some positive transaction (breaking the exhaustive-covering guarantee in Section 2.9) or silently changes closedness to be relative to a reduced interval language. Concretely, with transactions t1=(A=10,S=a,c), t2=(A=20,S=b,c), t3=(A=0,S=c,¬c), t4=(A=30,S=d,¬c), initial cut-points 5,15,25 make [5,15) and [15,25) positive-only; after the merge, [5,25) is the only interval. For x={S=a}, [5,15)∪x and [5,25)∪x have identical support, but only the former is closed. The dynamic merge of Section 3.4 inherits this problem and is explicitly a heuristic.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper proposes an FP-growth-based algorithm for mining discriminative patterns in transactional datasets that contain both symbolic and numeric attributes. Numeric values are first transformed into base interval items using class-informed cut-points, and interval items are organized in a concept lattice so that upper-interval supports can be computed by dynamic programming. The search uses dual-monotonic relevance scores, branch-and-bound pruning with minimum-support raising, and an exhaustive-covering strategy that maintains a top-1 candidate list for each positive transaction; the best-covering and closedness-on-positives constraints are applied to reduce redundancy. The manuscript reports mined patterns for the iris and German credit datasets and claims that the algorithm is efficient for hybrid domains. The central claim is that the proposed algorithm can mine closed, best-covering discriminative patterns while preserving the exhaustive-covering guarantee.","tokens_in":12214,"tokens_out":9852,"duration_ms":101073,"significance":"The idea of representing numeric intervals as items in a concept lattice and computing supports of upper intervals by dynamic programming is natural and potentially useful, and the per-transaction candidate-list formulation of exhaustive covering is clearly specified. The dual-monotonicity-based pruning conditions in Section 2.7 are also derived transparently as a strength of the paper. However, the current manuscript does not establish the advertised guarantees. The static interval-merge step in Section 3.1 is not lossless, the dynamic merge in Section 3.4 is explicitly heuristic, and the experimental section provides no comparison with alternative algorithms and reports a seven-hour runtime on a small dataset. If the merge operations can be made provably safe, or if the claims are explicitly weakened to describe an approximate algorithm, the paper could become a more solid contribution; in its present form, the correctness and efficiency claims are not supported.","major_comments":[{"comment":"The first and third displayed inequalities in Section 3.1 are not guaranteed to be strict. For a positive-only region [u,v) and a cut-point t inside it, one can only conclude p(⟨A,[vl,t)⟩∪x | c) ≤ p(⟨A,[vl,v)⟩∪x | c), with equality whenever no positive transaction satisfying x has an A-value in [t,v). In that case the specific interval and the merged interval have identical positive and negative support relative to the same pattern x, hence identical relevance under F-score; the best-covering constraint does not eliminate the specific pattern, and the closedness-on-positives constraint actively selects the more specific one. Removing t therefore removes the only closed best-covering representative for some positive transactions and invalidates the exhaustive-covering guarantee stated in Section 2.9. Concretely, with transactions t1=(A=10,S=a,c), t2=(A=20,S=b,c), t3=(A=0,S=c,¬c), t4=(A=30,S=d,¬c) and initial cut-points 5, 15, 25, the patterns [5,15)∪{S=a} and [5,25)∪{S=a} tie on positive and negative support, but only the former is closed; after merging [5,15) and [15,25), the closed representative is no longer representable. The analogous argument applies to the negative-only merge.","section":"Section 3.1 (static merge)"},{"comment":"The dynamic merge of base intervals inside conditional FP-trees is introduced as a heuristic, but no correctness argument is given. Because the decision to merge is made on the conditional database for the current prefix x, an interval can appear to be positive-only relative to that prefix while still containing positive transactions that are relevant to some later extension of the pattern. The equality example from Section 3.1 carries over directly: merging two conditional base intervals can delete a cut-point that would be needed for a closed best-covering pattern under the original interval language. As long as this heuristic is employed, the paper cannot claim that the algorithm returns the exact exhaustive-covering, best-covering, closed-on-the-positives answer. The manuscript should either prove that the dynamic merge preserves the output or explicitly characterize the output as an approximation and quantify the loss empirically.","section":"Section 3.4 (dynamic merge)"},{"comment":"The title and abstract claim efficient discriminative pattern mining, but the experimental section reports no baseline comparison and no quality or scalability evaluation. The German credit run for the bad class visited 2.1 billion candidate patterns and took 24,707 seconds (nearly 7 hours) on a dataset of only 1,000 instances; the iris results in Table 1 are presented without timing or comparison. To support the efficiency claim, the paper needs comparisons with at least one existing numeric subgroup or emerging-pattern miner, such as the methods in [3] or [11], or with a version of the proposed algorithm without the merge heuristics. The runtime also depends on the precision parameter ε and on the number of cut-points, but no values or sensitivity analysis are reported. Without these experiments the central contribution is not demonstrated.","section":"Section 4 (experiments)"}],"minor_comments":[{"comment":"The precision parameter ε is never given a concrete value or a procedure for setting it; the paper should report the exact ε used and the resulting number of base intervals in the experiments.","section":"Section 2.1"},{"comment":"The notation 'x /nequaly' and 'x /nequaly' appears corrupted; the intended inequality symbols should be typeset properly, for example as x ≠ y.","section":"Section 2.4"},{"comment":"The abstract mentions both iris and German credit datasets, but Section 4 reports details only for German credit; a table of runtimes and candidate counts for iris would improve completeness.","section":"Section 4"},{"comment":"The dynamic re-ordering rule is described only verbally; a pseudocode sketch or a small running example would make the traversal order and the handling of different attribute types clearer.","section":"Section 3.6"},{"comment":"The concluding remark that the number of base intervals severely affects runtime is important but is not developed into any complexity analysis or practical guidance; a brief complexity statement would help readers understand scalability.","section":"Section 5"}],"recommendation":"major_revision","confidential_remarks":"The manuscript appears to be a short translation of a domestic conference paper, and the current experimental and correctness content is thinner than what one would expect for a full journal article. The most serious issue is the unsound static merge in Section 3.1, which touches the core guarantee of the algorithm; the editor may wish to ask the authors to either repair the proof and the algorithm or explicitly reposition the paper as a heuristic mining method. The self-citations to prior work on exhaustive covering and dual-monotonicity are used as foundations and are not in themselves problematic."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"First, the thing to know: this paper extends your exhaustive covering framework to numeric attributes by introducing interval items over a concept lattice, and the static merge that removes cut-points inside positive-only regions is meant to be justified by dual-monotonicity. That justification is not sound. The claim p(⟨A,[vl,t)⟩∪x|c) < p(⟨A,[vl,v)⟩∪x|c) assumes there is at least one positive transaction in [t,v) that also contains x. If no such transaction exists, the two patterns have identical support and relevance; the more specific one is then the one the closedness constraint should keep. Removing the cut-point deletes it. A simple example: positives at A=10 and 20, negatives at A=0 and 30, cut-points at 5,15,25. Both [5,15) and [15,25) are positive-only and get merged to [5,25). For the pattern {S=a} covering only the A=10 positive, [5,15) and [5,25) have equal support, and only the former is closed. The merge makes the closed pattern unavailable, and the general one is pruned by the closedness test, so that positive transaction ends up with no output pattern. The exhaustive-covering guarantee is therefore relative to the reduced interval language, not the original one. The paper should either prove a version that works with non-strict support differences or explicitly state the guarantee is in the reduced language.\n\nWhat is genuinely new and worth credit: the concept-lattice representation for interval items, the dynamic programming for computing upper-interval support, and the dynamic merge heuristic in §3.4. The dynamic merge is honestly labeled a heuristic, but it inherits the same closedness problem. The paper is clearly written and the iris patterns are interpretable. The experiments, though, are weak: no baseline comparison at all, and the bad class in German credit takes about seven hours. That does not demonstrate the efficiency claimed in the title.\n\nMy overall take: the core idea is plausible and the paper is detailed enough that it deserves a serious referee, but the merge proof needs a fix and the experiments need baselines. If the merge cannot be made lossless, the contribution shrinks to a heuristic without formal guarantees. I would not cite it as a reliable method until that is resolved.","headline":"The interval-item concept lattice is a natural extension, but the static merge in §3.1 breaks the exhaustive-covering guarantee, and the experiments don't compare against anything.","tokens_in":12662,"tokens_out":5570,"would_cite":false,"duration_ms":51507,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"deepseek-v4-flash","headline":"Algorithm mines class-distinguishing patterns in hybrid datasets without pre-discretizing numeric attributes.","keywords":["discriminative pattern mining","emerging pattern mining","subgroup discovery","hybrid domains","interval items","concept lattice","FP-growth","exhaustive covering"],"falsifier":"Construct a small hybrid dataset with two numeric attributes where, for some combination of items, the best F-score pattern requires a cut-point inside a region containing only positive (or only negative) values for that attribute, because the conjunction with an interval on the other attribute makes that cut-point beneficial. Run the proposed algorithm and compare its output to a brute-force enumeration of all interval itemsets; if the optimal pattern is missing or has a lower score than the brute-force best, the merge is unsafe.","tokens_in":11665,"feed_emoji":"📊","tokens_out":7633,"duration_ms":60407,"temperature":0.7,"pith_summary":"The paper proposes an algorithm for discriminative pattern mining—finding patterns that distinguish one class from the others—that works directly on hybrid datasets containing both symbolic and numeric attributes. The key idea is to convert each numeric value into a base interval item and to allow patterns to use both base and upper intervals in a concept lattice, then search that space with FP-growth extended by branch-and-bound pruning. The search applies two redundancy constraints, best-covering and closedness-on-the-positives, plus exhaustive covering, which guarantees every positive transaction is covered by some output pattern. The paper demonstrates the algorithm on the iris and German credit datasets, reporting patterns that separate the classes with high F-scores. If correct, the method offers a way to mine discriminative patterns without the usual attribute-wise discretization step.","feed_headline":"Algorithm mines class-distinguishing patterns in hybrid datasets","feed_subtitle":"Turns numeric values into interval items in a concept lattice and prunes the search with two non-redundancy constraints.","key_machinery":"The central object is the interval-item concept lattice: for each numeric attribute, cut-points divide the value range into base intervals, and upper intervals are unions of consecutive base intervals, partially ordered by subsumption. The algorithm computes supports of upper intervals from base-interval supports via dynamic programming over this lattice, and prunes the search based on dual-monotonicity of the relevance score, which lets it raise the minimum-support threshold during the search. A static merge operation removes cut-points inside single-class regions, justified by best-covering and dual-monotonicity, and a dynamic merge further combines base intervals that appear only in positive or only in negative conditional transactions, at the cost of an unproven heuristic. The search itself uses exhaustive covering, tracking per-positive-transaction top-1 patterns, and enforces the best-covering and closedness-on-the-positives constraints to cut redundancy.","core_discovery":"On its own terms, the paper claims that discriminative pattern mining can be extended to hybrid domains by representing numeric attributes as interval items in a concept lattice and searching through all combinations of symbolic, base interval, and upper interval items under two redundancy constraints. The proposed algorithm, built on FP-growth with minimum-support raising and branch-and-bound pruning, uses dual-monotonicity of the relevance score (e.g., F-score) to justify removing cut-points inside regions containing only one class's values, thereby shrinking the search space. It maintains exhaustive covering: for each positive transaction, the search determines its top-1 pattern, and after pruning by the best-covering and closedness-on-the-positives constraints, the union of these per-transaction patterns is returned. The paper reports execution results on the iris dataset and the German credit dataset, showing patterns for each class; for example, the German credit data yields rules such as 'credit amount < 10920 and duration < 66' for the good class.","pith_inferences":["The dynamic merge of base intervals in conditional trees lacks a formal correctness guarantee; if it ever discards a cut-point needed by an optimal pattern, the algorithm could miss the best pattern, so the safety of this heuristic is an open question.","The paper notes that runtime is severely affected by the number of base intervals; a natural extension would be to combine this approach with non-greedy histogram-based discretization to reduce the interval count.","Although the paper stops at pattern mining, the mined rule sets could serve as the basis for an associative classifier, and testing classification accuracy on standard benchmarks would give a concrete measure of practical value."],"forward_implications":["The algorithm can mine discriminative patterns from hybrid datasets without an attribute-wise discretization step, avoiding the risk of inappropriate discretization.","Exhaustive covering guarantees that every positive transaction is covered by at least one output pattern, so the returned set gives a complete characterization of the target class.","The combination of best-covering and closedness-on-the-positives constraints removes redundant patterns, leaving only those that are locally best for some positive transaction and maximal in positive coverage.","The static merge of cut-points is justified for any dual-monotonic relevance score, so the approach applies not only to F-score but also to χ², information gain, and similar scores."],"supporting_citations":[{"why":"Supplies the baseline FP-growth algorithm on which the search is built and whose conditional-tree recursion is extended to interval items.","marker":"[12]"},{"why":"Introduces the exhaustive covering and best-covering constraint, and provides the lemma used to justify the static merge of cut-points.","marker":"[14]"},{"why":"Defines dual-monotonicity of relevance, the property that underpins the pruning and the merge justification.","marker":"[15]"},{"why":"Provides the closedness-on-the-positives constraint used to delete redundant patterns.","marker":"[10]"},{"why":"Provides the top-k mining with minimum-support raising that the algorithm extends to discriminative pattern mining.","marker":"[17]"},{"why":"Introduced the cut-point merge operation for numeric attributes, which the paper generalizes under dual-monotonic relevance.","marker":"[3]"},{"why":"Proposed the 'conquering without separating' strategy that underlies exhaustive covering.","marker":"[4]"}],"fun_headline_variants":["Efficient discriminative patterns for hybrid datasets","Mining class-distinguishing rules with numeric intervals","Pruned lattice search finds patterns for hybrid data","Faster pattern mining for mixed symbolic and numeric data","Hybrid data mining: numeric values become intervals in lattice"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The search-space reduction assumes that merging cut-points inside single-class regions does not discard any cut-point needed for an optimal pattern; the static merge is justified by dual-monotonicity and the best-covering constraint, but the dynamic merge of base intervals in conditional trees is an additional heuristic without a formal guarantee.","fun_headline_variants_meta":{"raw":{"variants":["Efficient discriminative patterns for hybrid datasets","Mining class-distinguishing rules with numeric intervals","Pruned lattice search finds patterns for hybrid data","Faster pattern mining for mixed symbolic and numeric data","Hybrid data mining: numeric values become intervals in lattice"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000797,"raw_usage":{"total_tokens":3450,"prompt_tokens":831,"completion_tokens":2619,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":447,"completion_tokens_details":{"reasoning_tokens":2545}},"tokens_in":447,"tokens_out":2619,"duration_ms":18333,"temperature":1.0,"reasoning_tokens":2545,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T13:09:47.616200+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Construct a small hybrid dataset with two numeric attributes where, for some combination of items, the best F-score pattern requires a cut-point inside a region containing only positive (or only negative) values for that attribute, because the conjunction with an interval on the other attribute makes that cut-point beneficial. Run the proposed algorithm and compare its output to a brute-force enumeration of all interval itemsets; if the optimal pattern is missing or has a lower score than the brute-force best, the merge is unsafe.","supporting_citations":[{"cited_title":"In: Proc","cited_arxiv_id":null,"evidence_quote":"Supplies the baseline FP-growth algorithm on which the search is built and whose conditional-tree recursion is extended to interval items."},{"cited_title":"I n: Proc","cited_arxiv_id":null,"evidence_quote":"Introduces the exhaustive covering and best-covering constraint, and provides the lemma used to justify the static merge of cut-points."},{"cited_title":"In: Proc","cited_arxiv_id":null,"evidence_quote":"Defines dual-monotonicity of relevance, the property that underpins the pruning and the merge justification."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Provides the closedness-on-the-positives constraint used to delete redundant patterns."},{"cited_title":"I n: Proc","cited_arxiv_id":null,"evidence_quote":"Provides the top-k mining with minimum-support raising that the algorithm extends to discriminative pattern mining."},{"cited_title":"IEEE Trans","cited_arxiv_id":null,"evidence_quote":"Introduced the cut-point merge operation for numeric attributes, which the paper generalizes under dual-monotonic relevance."},{"cited_title":"In: Proc","cited_arxiv_id":null,"evidence_quote":"Proposed the 'conquering without separating' strategy that underlies exhaustive covering."}],"review_version":1}