Packages

object DeclareMining

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. DeclareMining
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  5. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native() @IntrinsicCandidate()
  6. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  7. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  8. def extract_existence(logname: String, complete_traces_that_changed: Dataset[EventDeclare], bChangedTraces: Broadcast[Map[String, (Int, Int)]]): Unit

    Extract the state for the existence constraints.

    Extract the state for the existence constraints. This state maintains the number of traces that contain a specific number of occurrences per activity. For example, there is a record that shows how many trace contain exactly 2 occurrences of the activity A. This state is then used to calculate existence constraints and it is stored in the declare/existence.parquet file.

    logname

    name of the log database

    complete_traces_that_changed

    all events of traces that changed in the new batch

    bChangedTraces

    broadcasted variable in the form (trace_id)->[start_position, end_position]

  9. def extract_ordered(logname: String, complete_traces_that_changed: Dataset[EventDeclare], bChangedTraces: Broadcast[Map[String, (Int, Int)]]): Unit

    Extract the state for the ordered constraints.

    Extract the state for the ordered constraints. This state maintains the values for some key constraints, which can then be used to calculate the support of all the ordered constraints. The basic ordered constraints are stored in the /declare/order.parquet/ file.

    logname

    name of the log database

    complete_traces_that_changed

    all events of traces that changed in the new batch

    bChangedTraces

    broadcasted variable in the form (trace_id)->[start_position, end_position]

  10. def extract_positions(new_events: Dataset[EventDeclare], logname: String, complete_traces_that_changed: Dataset[EventDeclare], bChangedTraces: Broadcast[Map[String, (Int, Int)]]): Unit

    Extract the state for the position constraints.

    Extract the state for the position constraints. This state maintains the activities that appear first and last in traces. This method is responsible to add the first events for new traces and update the last events of traces that contain new events in the last batch. The state is stored in the declare/position.parquet file.

    new_events

    events in the new batch

    logname

    name of the log database

    complete_traces_that_changed

    all events of traces that changed in the new batch

    bChangedTraces

    broadcasted variable in the form (trace_id)->[start_position, end_position]

  11. def extract_unordered(logname: String, complete_traces_that_changed: Dataset[EventDeclare], bChangedTraces: Broadcast[Map[String, (Int, Int)]]): Unit

    Extract the state for the unordered constraints.

    Extract the state for the unordered constraints. This state maintains the tables U[x] and |I[x,y]UI[y,x]|, which are then used to extract all unordered constraints. The tables are stored in the /declare/unorder/u.parquet/ and /declare/unorder/i.parquet/ files, respectively.

    logname

    name of the log database

    complete_traces_that_changed

    all events of traces that changed in the new batch

    bChangedTraces

    broadcasted variable in the form (trace_id)->[start_position, end_position]

  12. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @IntrinsicCandidate()
  13. def handle_negatives(logname: String, activity_matrix: RDD[(String, String)]): Unit

    Extracts the negative state, which contains all the pair of activities that do not appear in this order in any of the traces.

    Extracts the negative state, which contains all the pair of activities that do not appear in this order in any of the traces.

    logname

    name of the log database

    activity_matrix

    an rdd with all the possible pair of activities

  14. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @IntrinsicCandidate()
  15. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  16. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  17. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @IntrinsicCandidate()
  18. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @IntrinsicCandidate()
  19. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  20. def toString(): String
    Definition Classes
    AnyRef → Any
  21. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  22. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  23. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Deprecated Value Members

  1. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] ) @Deprecated
    Deprecated

Inherited from AnyRef

Inherited from Any

Ungrouped