• Aucun résultat trouvé

Future Work

Dans le document tel-00431117, version 1 - 10 Nov 2009 (Page 172-175)

148 CHAPTER 9. CONCLUSIONS the semantic similarity between generalized sequence rules on the concept hierarchy.

We proposed the notions of unexpected sequential patterns and unexpected implication rules, in order to evaluate the discovered unexpected sequences by using a self-validation process. We also proposed three forms ofunexpected implication rules, includeunexpected class rule,unexpected association rule, and unexpected occurrence rule, to study what is associated with the unexpect-edness, what implies the unexpectunexpect-edness, and what the unexpectedness implies.

As a derived approach, we proposed the discovery and evaluation of unexpected sentences in free format text documents. We presented the part-of-speech data model of free format text documents, and then we presented the discovery of opposite sentiments in the context of opinion mining. We further generalized this approach to general text classification, where we proposed sequential pattern based class descriptors, and then we proposed the notion of unexpected sentences in text documents. The experimental evaluation shows that the accuracy of text classification can be improved with eliminating unexpected sentences.

9.2. FUTURE WORK 149 rule on the number of sequences that support the premise sequencesα. Given a rule sατ sβ and a sequence database D, the gap distribution is the distribution of the gaps between the premise and conclusion sequences in the mining process, which specifies the predictability of a rule. In Section 7.3.3 of Chapter 7, we have proposed a routine GapDist (Algorithm 19) to compute the gap distribution, which can be integrated into the pattern-growth framework.

9.2.2 Mining Unexpectedness with Fuzzy Rules

In Chapter 5, we have discussed that there is a very extended way of considering fuzzy association rules and gradual rules in discovering the unexpectedness in data. Hence, we are interested in mining more complex unexpectedness with fuzzy rules, which can be summarized as Table 9.1.

Rule Semantic Contradiction Unexpected Rules if X is A, then Y isB A6≃sem C if X isC, then Y is B if X is A, then Y isB B 6≃sem D if X isA, thenY is D

Table 9.1: Fuzzy unexpectedness.

Unexpectedness can be addressed by considering fuzzy association rules. For instance, if “age isold →salary ishigh” corresponds to prior knowledge, then “age isyoung → salaryishigh” or

“age is old → salaryis low” can be considered as unexpected, since we have that old contradicts young and high contradicts low. The same manner can also be extended to gradual rules. For instance, if prior knowledge shows that “ age increases→salary increases”, then “age increases

→salary decreases” is unexpected, since we have that increase contradicts decrease, etc.

Rule Semantic Contradiction Unexpected Rules

if X isA, thenY is B A6≃semC if X is C and Z is E, thenY is B if X isA, thenY is B A6≃semC if X is C, then Y isB and Z isE if X isA, thenY is B B 6≃semD if X is A and Z is E, then Y isD if X isA, thenY is B B 6≃semD if X is A, then Y is D and Z isE

Table 9.2: Complex unexpectedness.

Our goal is not discover only unexpected rules, but also the correlations within unexpected rules. Table 9.2 lists more complex cases, where the correlations within unexpected rules can be measured by frequency.

9.2.3 Mining Intermediate Patterns

Let us consider a belief b consisting of a sequence association rule sα → sβ and the semantic contradictionsβ 6≃sem sγ. From this belief, a sequence supporting the rulesα →sγ is unexpected.

tel-00431117, version 1 - 10 Nov 2009

150 CHAPTER 9. CONCLUSIONS Considering a large sequence databaseD, a subsetDb ⊆ Dcan be discovered, where each sequence s ∈ Db supports the rule sα → sγ. If we can find the rule sα∧sα → sγ in the sequence set Db

with strong support and confidence value, then we can say that the sequence sα is akey sequence, which may play an important role in the causality of the unexpectedness.

From this observation, we propose the notion ofintermediate patterns in the context of associ-ation rule mining. Given an associassoci-ation rule X →Y, whereX and Y are two patterns (itemsets), the rule depicts that the presence of X implies the presence of Y. Different from this notion, we are interested in the case that the patterns X and Y are not present in same itemsets, however, a pattern Z can occur X∪Y . We call such a rule as a transition rule, denoted as X →Z Y, where X,Y, andZ are three patterns, and the patternZ is so called aintermediate pattern. Such a rule can be represented as follows:

(X →Z Y)⇒(X∪ ¬Z 6→Y)∧(X∪Z →Y).

Intermediate patterns can be interesting to many domains. For instance, Swanson found papers that connected terms A and B are also papers that connected B and C. From that, he made connections A to C [Swa86], where one example was a connection between fish oil and migraines. Not difficult to see, in the problem of Swanson’s Raynaud-Fish Oil and Migraine-Magnesium discoveries, which is also closely connected to text mining applications [GL96, Sri04, WKdJvdBV01], an intermediate pattern plays the role of the term B.

The notion of intermediate pattern can be push back to the context of sequence mining, with the notion of sequence transition rule, denoted assα

sβ, that is, (sα

sβ)⇒(sα· ¬sγ 6→sβ)∧(sα·sβ →sγ).

A sequence transition rule sα

sβ depicts that if the sequence sγ occurs after the occurrence of the sequence sα, then the sequence sβ will occur later; otherwise, without the sequence sγ, the sequence sβ does not occur.

To discover (sequence) transition rules and intermediate patterns/sequences can be interesting for finding new trends or new chances for business intelligence. In [Ohs06], a similar business process is introduced in terms of finding KeyGraph from events or states for chance discovery.

9.2.4 Mining Unexpected Sentences with Dependency Tree

In Chapter 8, we proposed a general framework for discovery unexpected sentences in text doc-uments, where the semantic contradictions are determined from antonyms of words. Obvious, we cannot indicate antonyms for most nouns and verbs, hence, even though we have proposed a general framework, the application is limited to sentiment classification.

We are interested in extending our approach with two methods. On one hand, according to the frameworkSoftMuse, concept hierarchies can be used for determining semantic contradictions, so

tel-00431117, version 1 - 10 Nov 2009

9.3. FINAL THOUGHTS 151

Dans le document tel-00431117, version 1 - 10 Nov 2009 (Page 172-175)