Reviews:FrancoisScharffe about Classification scheme - adjacency list model - to Taxonomy Revision as of 12:27, 11 September 2009 by FrancoisScharffe (Talk | contribs) (New page: {{Content OP Proposal Review Template |CreationDate=2009/9/11 |SubmittedBy=FrancoisScharffe |ContentOPUnderReview=Classification scheme - adjacency list model - to Taxonomy |RevisionID=579...) (diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

{{#reviewabout:Submissions:Classification scheme - adjacency list model - to Taxonomy|}}

FrancoisScharffe about Classification scheme - adjacency list model - to Taxonomy (Revision ID: scheme - adjacency list model - to Taxonomy?oldid=5798 5798)

Overall suggestion (score): 1 - needs minor revision

Review Summary: This pattern present the process of transforming an adjacency list into an owl class hierarchy. The problem is simple, well described and well illustrated. My only concern is that the relation between the termis in the adjacency list might not correspond to a subclass relation. In this case the pattern shouldn't be used. This should be explicitely mentioned.

Reviewer Confidence: I am confident given this is an easy problem.

Problems: Clearly stated.

Community Relevance: This might be useful even if the problem is rather simple.

Relation to Best Practices: Yes this represent a best practice. No alternative solution is mentioned but the given algorithm is certainly the optimal one.

Reusability: The pattern cannot be used in every situations. Only when the adjacency list models a subsumption relation. This should be clearly mentioned in the pattern description.

Relations to Other Patterns:

Overall Understandability: Overall very understandable.

Clear Problem Description: yes

Clear Relevance and Consequences: Not clear. Please state this pattern is only valid if the adjacency list supposes a subsumption between the entities.

Clear Figures and Illustrations: Yes

Missing Information: Already mentioned

Posted: 2009/9/11 Last modified: 2009/09/11

All reviews | Add a comment at the bottom of this page